Shop Problems With Two Machines and Time Lags

Mauro Dell'Amico
Additional contact information
Mauro Dell'Amico: Dipartimento di Economia Politica, Universitá di Modena, Italy

Operations Research, 1996, vol. 44, issue 5, 777-787

Abstract: We consider Job-Shop and Flow-Shop scheduling problems with two machines, no more than two operations per job, and Time Lags, i.e., a minimum time interval between the completion time of the first operation and the starting time of the second one. We give complexity results for the preemptive and nonpreemptive cases and study the relationship between the two problems. For the Flow-Shop problem we give lower bounds and upper bounds and analyze their worst-case performances. Finally we define a Tabu Search algorithm and prove the effectiveness of the proposed bounds through extensive computational results.

Keywords: analysis of algorithms; computational complexity; production/scheduling; flow shop; job shop; programming; algorithms worst-case analysis (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.44.5.777 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:44:y:1996:i:5:p:777-787

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().