Non-preemptive two-machine open shop scheduling with non-availability constraints

We study a two-machine open shop scheduling problem, in which the machines are not continuously available for processing. No preemption is allowed in the processing of any operation. The objective is to minimize the makespan. We consider approximability issues of the problem with more than one non-a...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical methods of operations research (Heidelberg, Germany) Germany), 2003-05, Vol.57 (2), p.217-234
Hauptverfasser:	BREIT, J, SCHMIDT, G, STRUSEVICH, V. A
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Approximation Exact sciences and technology Heuristic Job shops Operational research and scientific management Operational research. Management science Preemption Scheduling Scheduling, sequencing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We study a two-machine open shop scheduling problem, in which the machines are not continuously available for processing. No preemption is allowed in the processing of any operation. The objective is to minimize the makespan. We consider approximability issues of the problem with more than one non-availability intervals and present an approximation algorithm with a worst-case ratio of 4/3 for the problem with a single non-availability interval.
ISSN:	1432-2994 1432-5217
DOI:	10.1007/s001860200267