Abstract
This is the summary of the author’s PhD thesis supervised by Yves Deville and Pascal Van Hentenryck, and defended on 25 May 2010 at the Université catholique de Louvain in Louvain-la-Neuve. The thesis is written in English and is available from the author, or downloadable from http://becool.info.ucl.ac.be/files2/thesis-monette.pdf. This work is about the gap between high-level modelling of scheduling problems and its efficient resolution. We propose to automatically classify models of scheduling problems, and to apply an appropriate search algorithm. Thanks to the strong separation between model and search, we propose also a simple way to create hybrid algorithms. A second part of the thesis deals with Constraint Programming approaches for two scheduling problems: The one-machine non-preemptive problem and the Just-In-Time Job-Shop problem. All parts are accompanied by experimental results showing their practicality.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baptiste P, Flamini M, Sourd F (2008) Lagrangian bounds for Just-In-Time Job-Shop scheduling. Comput Oper Res 35(3): 906–915
Essafi I, Mati Y, Dauzère-Pèréz S (2008) A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Comput Oper Res 35(8): 2599–2616
Liu SQ, Ong HL, Ng KM (2005) A fast tabu search algorithm for the group shop scheduling problem. Adv Eng Softw 36(8): 533–539
Monette J-N, Deville Y, Dupont P (2007) A position-based propagator for the open-shop problem. In CPAIOR07: Proceedings of the 4th international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems. Springer, Berlin, pp 186–199
Monette J-N, Deville Y, Van Hentenryck P (2009a) Aeon: Synthesizing scheduling algorithms from high-level models. Operations research and cyber-infrastructure. In: Proceedings of the 11th informs computing society conference, pp 43–59
Monette J-N, Deville Y, Van Hentenryck P (2009b) Just-In-Time scheduling with constraint programming. In: ICAPS, pp 241–248
Valls V, Ballestín F, Quintanilla S (2003) A hybrid genetic algorithm for the rcpsp. Technical report, Department of Statistics and Operations Research, University of Valencia
Van Hentenryck P, Michel L (2005) Constraint-based local search. MIT Press, Cambridge
Zhang CY, Li PG, Rao YQ, Guan ZL (2008) A very fast ts/sa algorithm for the job shop scheduling problem. Comput Oper Res 35(1): 282–294
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Monette, JN. Solving scheduling problems from high-level models. 4OR-Q J Oper Res 9, 317–320 (2011). https://doi.org/10.1007/s10288-010-0143-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-010-0143-7