Constraint-Based Scheduling

SB19.1 An Investigation into Two Approaches for Constraint Directed Resource Allocation & Scheduling

• Andrew J. Davenport; University of Toronto, 97 Dovercourt Rd., Toronto, Ontario, M6J 3C2 , Canada; andrewd@eil.utoronto.ca
• J. Christopher Beck; University of Toronto, Enterprise Integration Lab., 4 Taddle Creek Rd., Toronto, Ontario, M5S 3G8 , Canada; chris@eil.utoronto.ca

We investigate new techniques for scheduling with resource alternatives based on the complete decomposition prior to scheduling (CDPS) approach and the multiple alternative decomposition (MAD) approach. We investigate experimentally whether the higher computational cost of decision making in the MAD approach results in better scheduling performance than the CDPS approach.

SB19.2 Incorporating New Scheduling Criteria in Constraint-Based Tools

• Philippe Baptiste; University of Technology of Compiegne, UMR CNRS 6599 HEUDIASYC, Ctr. Recherches de Royallieu, Compiegne Cedex, 60205 , France; philippe.baptiste@hds.utc.fr
• Wim Nuijten; ILOG, 9 rue de Verdun, Gentilly Cedex, 94532 , France; nuijten@ilog.fr

Most of the constraint based tools offer efficient primitives to solve scheduling problems where the goal is to minimize the makespan. Such is not the case for other criteria, e.g., weighted sum of completion times. We propose several research directions that could enable constraint based systems to handle various criteria.

SB19.3 A Constraint Programming Approach for Supply Chain Scheduling

• Mark J. Ringer; JD Edwards World Source Company, 1 Technology Way, U9, Denver, CO 80237; mark_ringer@jdedwards.com

J.D. Edwards, a leading ERP and supply chain software vendor, is developing an advanced planning and scheduling system. A constraint programming approach is used to model, solve and optimize a large and complex manufacturing planning and scheduling problem. We will give an overview of the technical and implementation details encountered using the development of this new system.

SB19.4 Constraint Propagation Techniques for Reservoirs

• Jerome Rogerie; ILOG, 9 rue de Verdun, Gentilly Cedex, 94532 , France; rogerie@ilog.fr
• Wim Nuijten; ILOG, 9 rue de Verdun, Gentilly Cedex, 94532 , France; nuijten@ilog.fr

Reservoirs are resources that allow the definition of both capacity consuming and capacity producing activities on them. Commonly found examples of reservoirs are storage tanks and inventory. We will present some powerful constraint propagation techniques for reservoirs, a subject that despite its practical importance has received relatively little theoretical attention.