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 witch 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.