We consider Job-Shop and Flow-Shop scheduling problems with twomachines, no more than two operations per job and Time Lags i.e.a minimum time intervalbetween the completion time of the firstoperation and the starting time of the second one.We give complexity results for the preemptive and non preemptive casesand study the relationship between the two problems. For the Flow-Shopproblemwe give lower bounds, upper bounds and analyze their worst-caseperformances. Finally we define a Tabu Search algorithm and provethe effectiveness of the proposed bounds throughextensive computational results.
Shop Problems with two Machines and Time-Lags / Dell'Amico, Mauro. - In: OPERATIONS RESEARCH. - ISSN 0030-364X. - STAMPA. - 44:(1996), pp. 777-787.
Shop Problems with two Machines and Time-Lags
DELL'AMICO, Mauro
1996
Abstract
We consider Job-Shop and Flow-Shop scheduling problems with twomachines, no more than two operations per job and Time Lags i.e.a minimum time intervalbetween the completion time of the firstoperation and the starting time of the second one.We give complexity results for the preemptive and non preemptive casesand study the relationship between the two problems. For the Flow-Shopproblemwe give lower bounds, upper bounds and analyze their worst-caseperformances. Finally we define a Tabu Search algorithm and provethe effectiveness of the proposed bounds throughextensive computational results.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
