Dedicated constraint propagation for Job-Shop problem with generic time-lags

This paper addresses the Job-Shop scheduling problem with generic time-lags (JSPGTL). This problem is a generalization of the Job-Shop scheduling problem where extra (minimum and maximum) delays can be introduced between any operations. First a state of the art on the job-shop scheduling with time-lags is provided and we outline that the determination of a feasible solution for the JSPGTL is clearly a difficult problem as contrary to more basic time-lags problems. Secondly we propose some dedicated constraint propagation rules wich aim to detect some inconsistancies for the JSPGTL. The efficiency of these rules is illustrated on a small example. These propagation rules can be included in a heuristic method for the acceleration of the search for feasible solution thanks to early detection of certain inconsistancies. This work is the first step of a collaboration which aims to propose a new feature for the resolution of JSPGTL.

[1]  Klaus Neumann,et al.  Heuristic procedures for resource—constrained project scheduling with minimal and maximal time lags: the resource—levelling and minimum project—duration problems , 1996 .

[2]  Mario Vanhoucke,et al.  Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers , 2011, Eur. J. Oper. Res..

[3]  Erik Demeulemeester,et al.  Reactive scheduling in the multi-mode RCPSP , 2011, Comput. Oper. Res..

[4]  Pierre Lopez,et al.  Generalized disjunctive constraint propagation for solving the job shop problem with time lags , 2011, Eng. Appl. Artif. Intell..

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

[6]  Valerie Botta-Genoulaz,et al.  Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness , 2000 .

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

[8]  C. Bierwirth.  A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .

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

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

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

[12]  Freddy Deppner,et al.  Ordonnancement d'atelier avec contraintes temporelles entre opérations. (Scheduling problems with minimal and maximal time lag constraints) , 2004 .

[13]  Sönke Hartmann,et al.  A survey of variants and extensions of the resource-constrained project scheduling problem , 2010, Eur. J. Oper. Res..

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