This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Integer programming and constraint programming in solving a multi-machine assignment scheduling problem with deadlines and release dates

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
SADYKOV, Rusland
WOLSEY, Laurence
Abstract

We consider both branch-and-cut and column generation approaches for the problem of finding a minimum cost assignment of jobs with release dates and deadlines to unrelated parallel machines. Results are presented for several variants both with and without Constraint Programming. Among the variants, the most effective strategy is to combine a tight and compact, but approximate, Mixed Integer Programming formulation with a global constraint testing single machine feasibility. All the algorithms have been implemented in the Mosel modelling and optimization language.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.core.ucl.ac.be/services/psfiles/dp03/dp2003-81.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) in its series CORE Discussion Papers with number 2003081.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 01 Nov 2003
Date of revision:
Handle: RePEc:cor:louvco:2003081

Contact details of provider:
Postal: Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium)
Phone: 32(10)474321
Fax: +32 10474301
Email:
Web page: http://www.uclouvain.be/core
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Alain GILLIS).

Related research
Keywords:

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

  1. Carlier, Jacques, 1982. "The one-machine sequencing problem," European Journal of Operational Research, Elsevier, vol. 11(1), pages 42-47, September. [Downloadable!] (restricted)
  2. Peridy, Laurent & Pinson, Eric & Rivreau, David, 2003. "Using short-term memory to minimize the weighted number of late jobs on a single machine," European Journal of Operational Research, Elsevier, vol. 148(3), pages 591-603, August. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? Authors registered on the RePEc Author Service receive monthly emails with details about downloads and abstract views of their works.

This page was last updated on 2009-12-16.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.