Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-22T18:28:33.831Z Has data issue: false hasContentIssue false
  • English
  • Français

Incorporating the strength of MIP modeling in schedule construction

Published online by Cambridge University Press:  08 October 2009

Cor A.J. Hurkens
Cor A.J. Hurkens*
Affiliation:
Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands; [email protected]
Get access

Abstract

Linear programming techniques can be used in constructing schedules but theirapplication is not trivial. This in particular holds true if a trade-offhas to be made between computation time and solution quality. However,it turns out that – whenhandled with care – mixed integer linear programs may provide effectivetools. This is demonstrated in the successful approach to the benchmarkconstructed for the 2007 ROADEF computation challenge on scheduling problemsfurnished by France Telecom.

Keywords

Schedulinginteger programminglower boundshybrid methods.Planificationprogrammation en nombres entiersbornes inférieureshybridisation.
Type
Research Article
Information
RAIRO - Operations Research , Volume 43 , Issue 4: ROADEF 07 , October 2009 , pp. 409 - 420
Copyright
© EDP Sciences, ROADEF, SMAI, 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Applegate, D. and Cook, W., A computational study of the job-shop scheduling problem. ORSA J. Comput. 3 (1991) 149–156. CrossRef
Lawler, E.L. and Labetoulle, J., On preemptive scheduling of unrelated parallel processors by linear programming. J. Assoc. Comput. Mach. 25 (1978) 612–619. CrossRef
Y. Pochet and Laurence A. Wolsey, Production planning by mixed integer programming. Springer Series in Operations Research and Financial Engineering. Springer, New York (2006) xxiv+499 p.