Permutation flowshop scheduling problems with maximal and minimal time lags

Two-machine flow shop scheduling problems with minimal and maximal delays

“…Notice that the lower bound used by Yang and Chern (1995) is based on the length of only two paths of the Johnson sequence, thus it is dominated by LB J . This bound is given also by Fondrevelle et al (2005). Fig.…”

A memetic algorithm for the job-shop with time-lags

“…The addressed problems are: flow-shop, hybrid flow-shop (see [9] for a recent publication), one machine problem, job-shop problems. Let us note the recent publication of Fondrevelle et al [10] devoted to permutation flow-shop scheduling problems including both minimal and maximal time-lags constraints.…”

Scatter search with path relinking for the job shop with time lags and setup times

“…In our case, to decide if the insertion of an operation in an interval is feasible we have to take into account the setup times with respect to the machine predecessor and successor of the operation, and therefore we need to add setup times in the appropriate places of the algorithm (conditions (18) to (22) of the algorithm described [23]). …”

“…Hurink and Keuchel, in [17], propose a local search approach for the single machine problem. Fondrevelle et al in [18] and Dhouib et al in [19] solve permutation flow-shop scheduling problems with maximal and minimal time lags. Botta-Genoulaz [20] tackles the maximum lateness minimization in the hybrid flow shop scheduling with precedence constraints and time lags.…”