Abstract
This paper describes the aeon system whose aim is to synthesize scheduling algorithms from high-level models. Aeon, which is entirely written in comet, receives as input a high-level model for a scheduling application which is then analyzed to generate a dedicated scheduling algorithm exploiting the structure of the model. Aeon provides a variety of synthesizers for generating complete or heuristic algorithms. Moreover, synthesizers are compositional, making it possible to generate complex hybrid algorithms naturally. Preliminary experimental results indicate that this approach may be competitive with state-of-the-art search algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
1 Aeon is another name for the Greek god of time Chronos. It means forever, eternity.
- 2.
2 In spite of a syntax similar to C++, such classes are not templated classes.
- 3.
3 Future work will also consider MIP-based solvers for various classes of scheduling problems.
- 4.
References
Akers S, Friedman J (1955) A non-numerical approach to production scheduling problems. Operations Research 3:429–442
Dell'Amico M, Trubian M (1993) Applying tabu search to the job-shop scheduling problem. Annals of Operations Research 41:231–252
Kolisch R, Sprecher A (1997) Psplib — a project scheduling problem library. European Journal of Operational Research 96:205–216, URL cite-seer.ist.psu.edu/kolisch96psplib.html
Laborie P, Godard D (2007) Self-adapting large neighborhood search: Application to single-mode scheduling problems. In Proceedings MISTA-07, Paris
Liaw CF (1999) A tabu search algorithm for the open shop scheduling problem. Computers and Operations Research 26:109–126
Nuijten W, Bousonville T, Focacci F, Godard D, Le Pape C (2004) Towards an industrial manufacturing scheduling problem and test bed. PMS URL http://www2.ilog.com/masclib/
Refalo P (2004) Impact-based search strategies for constraint programming. In: CP 2004, Toronto (Canada), pp 557–571
Van Hentenryck P, Michel L (2004) Scheduling abstractions for local search. In: CP-AI-OR'04, Nice, pp 319–334
Van Hentenryck P, Michel L (2005) Constraint-Based Local Search. The MIT Press
Van Hentenryck P, Michel L (2007) Synthesis of constraint-based local search algorithms from high-level models. AAAI'07, Vancouver, British Columbia
Van Hentenryck P, Michel L, Laborie P, Nuijten W, Rogerie J (1999) Combinatorial optimization in OPL studio. In: Portuguese Conference on Artificial Intelligence, pp 1–15, URL citeseer.ist.psu.edu/article/vanhentenryck99combinatorial.html
Zhang CY, Li P, Rao Y, Guan Z (2007) A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Computers & Operations Research 34:3229–3242
Zhang CY, Li P, Rao Y, Guan Z (2008) A very fast ts/sa algorithm for the job shop scheduling problem. Computers & Operations Research 35:282–294
Acknowledgments
The authors want to thank the anonymous reviewers for their helpful comments. This research is partially supported by the Walloon Region, project Transmaze (516207) and by Interuniversity Attraction Poles Programme (Belgian State, Belgian Science Policy).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this paper
Cite this paper
Monette, JN., Deville, Y., Van Hentenryck, P. (2009). Aeon: Synthesizing Scheduling Algorithms from High-Level Models. In: Chinneck, J.W., Kristjansson, B., Saltzman, M.J. (eds) Operations Research and Cyber-Infrastructure. Operations Research/Computer Science Interfaces, vol 47. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-88843-9_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-88843-9_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-88842-2
Online ISBN: 978-0-387-88843-9
eBook Packages: Computer ScienceComputer Science (R0)