Failure-Directed Search for Constraint-Based Scheduling

This paper presents a new constraint programming search algorithm that is designed for a broad class of scheduling problems. Failure-directed Search (FDS) assumes that there is no (better) solution or that such a solution is very hard to find. Therefore, instead of looking for solution(s), it focuses on a systematic exploration of the search space, first eliminating assignments that are most likely to fail. It is a “plan B” strategy that is used once a less systematic “plan A” strategy – here, Large Neighborhood Search (LNS) – is not able to improve current solution any more. LNS and FDS form the basis of the automatic search for scheduling problems in CP Optimizer, part of IBM ILOG CPLEX Optimization Studio.

[1]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[2]  Panos M. Pardalos,et al.  An Algorithm for the Job Shop Scheduling Problem based on Global Equilibrium Search Techniques , 2006, Comput. Manag. Sci..

[3]  Barry O'Sullivan,et al.  Search Strategies for Rectangle Packing , 2008, CP.

[4]  Philippe Laborie,et al.  Temporal linear relaxation in IBM ILOG CP Optimizer , 2016, J. Sched..

[5]  Pascal Van Hentenryck,et al.  Activity-Based Search for Black-Box Constraint Programming Solvers , 2011, CPAIOR.

[6]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[7]  Peter J. Stuckey,et al.  Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint , 2012, CPAIOR.

[8]  Narendra Jussien,et al.  Dynamic Domain Splitting for Numeric CSPs , 1998, ECAI.

[9]  Bart Selman,et al.  Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems , 2000, Journal of Automated Reasoning.

[10]  Peter J. Stuckey,et al.  Solving RCPSP/max by lazy clause generation , 2012, Journal of Scheduling.

[11]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[12]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[13]  María R. Sierra,et al.  A genetic algorithm for job-shop scheduling with operators enhanced by weak Lamarckian evolution and search space narrowing , 2014, Natural Computing.

[14]  Pierre Lopez,et al.  Overview and Possible Extensions of Shaving Techniques for Job-Shop Problems ! , 2000 .

[15]  Philippe Refalo,et al.  Impact-Based Search Strategies for Constraint Programming , 2004, CP.

[16]  Alessandro Agnetis,et al.  A job-shop problem with one additional resource type , 2011, J. Sched..

[17]  Takeshi Yamada,et al.  A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.

[18]  Petr Vilím,et al.  Global Constraints in Scheduling , 2007 .

[19]  Lakhdar Sais,et al.  Nogood Recording from Restarts , 2007, IJCAI.

[20]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[21]  Mats Carlsson,et al.  New filtering for the cumulative constraint in the context of non-overlapping rectangles , 2008, Ann. Oper. Res..

[22]  Philippe Laborie,et al.  Reasoning with Conditional Time-Intervals , 2008, FLAIRS.

[23]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

[24]  Petr Vilím,et al.  Reasoning with Conditional Time-Intervals. Part II: An Algebraical Model for Resources , 2009, FLAIRS.

[25]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[26]  Armin Wolf,et al.  Impact-Based Search in Constraint-based Scheduling , 2008, GI Jahrestagung.

[27]  Laurent Flindt.  An Adaptive Large Neighborhood Search Algorithm for the Multi-mode RCPSP , 2016 .

[28]  Petr Vilím,et al.  Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources , 2011, CPAIOR.

[29]  D. Godard,et al.  Self-Adapting Large Neighborhood Search: Application to Single-Mode Scheduling Problems , 2007 .

[30]  Thorsten Koch,et al.  Branching rules revisited , 2005, Oper. Res. Lett..

[31]  Philippe Baptiste,et al.  Constraint - based scheduling : applying constraint programming to scheduling problems , 2001 .