Generalized disjunctive constraint propagation for solving the job shop problem with time lags

This paper addresses the job-shop scheduling problem with time-lags. We propose an insertion heuristic and generalized resource constraint propagation mechanisms. Our propositions are embedded in a branch-and-bound algorithm to provide an experimental evaluation on some benchmark instances. The results obtained conclude that our heuristic achieves the best solutions on the instances, especially when problems involve tightened time lags. The results also prove the interest of the constraint propagation generalization when time lags are considered.

[1]  Roman Barták,et al.  Introduction: Special issue on constraint satisfaction techniques for planning and scheduling problems , 2008, Eng. Appl. Artif. Intell..

[2]  Roman Barták,et al.  Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.

[3]  François Laburthe,et al.  Improved CLP Scheduling with Task Intervals , 1994, ICLP.

[4]  Alain Hertz,et al.  A Lower Bound for the Job Insertion Problem , 2003, Discret. Appl. Math..

[5]  Rema Padman,et al.  An integrated survey of deterministic project scheduling , 2001 .

[6]  Manolis Koubarakis,et al.  Backtracking algorithms for disjunctions of temporal constraints , 1998, Artif. Intell..

[7]  J. Erschler,et al.  Potentiels sur un graphe non conjonctif et analyse d'un problème d'ordonnancement à moyens limites , 1979 .

[8]  Johann Hurink,et al.  Local search algorithms for a single-machine scheduling problem with positive and negative time-lags , 2001, Discret. Appl. Math..

[9]  Peter Brucker,et al.  A Branch and Bound Algorithm for a Single-machine Scheduling Problem with Positive, Negative Time-lags , 1999, Discret. Appl. Math..

[10]  Pierre Lopez,et al.  On Not-First/Not-Last conditions in disjunctive scheduling , 2000, Eur. J. Oper. Res..

[11]  Rema Padman,et al.  An integrated survey of project scheduling , 1997 .

[12]  Léon Planken,et al.  Incrementally Solving the STP by Enforcing Partial Path Consistency , 2008 .

[13]  Mathijs de Weerdt,et al.  Incrementally Solving STNs by Enforcing Partial Path Consistency , 2010, ICAPS.

[14]  Professor Dr. Klaus Neumann,et al.  Project Scheduling with Time Windows and Scarce Resources , 2003, Springer Berlin Heidelberg.

[15]  Philippe Lacomme,et al.  A memetic algorithm for the job-shop with time-lags , 2008, Comput. Oper. Res..

[16]  Pierre Lopez,et al.  CONSISTENCY ENFORCING IN SCHEDULING: A GENERAL FORMULATION BASED ON ENERGETIC REASONING , 1996 .

[17]  Christian Artigues,et al.  Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem , 2005, INFORMS J. Comput..

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

[19]  M. Huguet,et al.  Dynamic task sequencing in temporal problems with uncertainty , 2002 .

[20]  Frank Werner,et al.  Insertion Techniques for the Heuristic Solution of the Job Shop Problem , 1995, Discret. Appl. Math..

[21]  Peter Brucker,et al.  Scheduling and constraint propagation , 2002, Discret. Appl. Math..

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

[23]  Pierre Lopez,et al.  Modelling and managing disjunctions in scheduling problems , 1995, J. Intell. Manuf..

[24]  George L. Nemhauser,et al.  One-machine generalized precedence constrained scheduling problems , 1994, Oper. Res. Lett..