Scheduling Abstractions for Local Search
Comet is an object-oriented language supporting a constraint-based architecture for local search. This paper presents a collection of abstractions, inspired by constraint-based schedulers, to simplify scheduling algorithms by local search in Comet. The main innovation is the computational model underlying the abstractions. Its core is a precedence graph which incrementally maintains a candidate schedule at every computation step. Organized around this precedence graph are differentiable objects, e.g., resources and objective functions, which support queries to define and evaluate local moves. The abstractions enable Comet programs to feature declarative components strikingly similar to those of constraint-based schedulers and search components expressed with high-level modeling objects and control structures. Their benefits and performance are illustrated on two applications: minimizing total weighted tardiness in a job-shop and cumulative scheduling.
KeywordsLocal Search Local Move Precedence Constraint Local Search Algorithm Feasible Schedule
Unable to display preview. Download preview PDF.
- 1.Cesta, A., Oddi, A., Smith, S.F.: Iterative flattening: A scalable method for solving multi-capacity scheduling problems. In: AAAI/IAAI, pp. 742–747 (2000)Google Scholar
- 2.Di Gaspero, L., Schaerf, A.: Optimization Software Class Libraries, chapter Writing Local Search Algorithms Using Easy Local++. Kluwer, Dordrecht (2002)Google Scholar
- 9.Michel, L., Van Hentenryck, P.: A constraint-based architecture for local search. In: OOPSLA 2000, Seattle, WA (2002)Google Scholar
- 11.Michel, L., Van Hentenryck, P.: Iterative relaxations for iterative flattening in cumulative scheduling. In: ICAPS 2004, Whistler, BC, Canada (2004)Google Scholar
- 16.Singer, M., Pinedo, M.: A computational study of branch and bound techniques for minimizing the totalweighted tardiness in job shops. IIE Scheduling and Logistics 30, 109–118 (1997)Google Scholar
- 20.Walser, J.: Integer Optimization by Local Search. Springer, Heidelberg (1998)Google Scholar
- 21.Werner, F., Winkler, A.: Insertion Techniques for the Heuristic Solution of the Job Shop Problem. TR, Technical Universitaet Magdebourg (1992)Google Scholar