An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints

In this paper, we study the single machine total completion scheduling problem subject to a period of maintenance. We propose an approximation algorithm to solve the problem with a worst case error bound of 3/17. Furthermore, an example is provided to show that the bound is tight. Computational expe...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 161; H. 1; S. 3 - 10
Hauptverfasser:	Sadfi, Cherif, Penz, Bernard, Rapine, Christophe, Błażewicz, Jacek, Formanowicz, Piotr
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 16.02.2005 Elsevier Elsevier Sequoia S.A
Schriftenreihe:	European Journal of Operational Research
Schlagworte:	Algorithms Approximation Approximation algorithm Availability constraints Operations research Production scheduling Single machine scheduling Studies Total completion time Worst case analysis Availability constraints Approximation algorithm Total completion time Single machine scheduling Worst case analysis
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!