Complexity and approximability of scheduling resumable proportionally deteriorating jobs

A set of independent, resumable and proportionally deteriorating jobs is to be executed on a single machine. The machine is not continuously available for processing but the number of non-availability periods, the start time and end time of each period are known in advance. The criterion of schedule...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 200; H. 1; S. 305 - 308
Hauptverfasser:	Gawiejnowicz, Stanisław, Kononov, Alexander
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 2010 Elsevier Elsevier Sequoia S.A
Schriftenreihe:	European Journal of Operational Research
Schlagworte:	Algorithms Approximation Complexity theory Deteriorating jobs Fully polynomial-time approximation scheme Job shops Operations research Production scheduling Scheduling Scheduling Deteriorating jobs Complexity theory Fully polynomial-time approximation scheme Studies Fully polynomial-time approximation scheme Scheduling Complexity theory Deteriorating jobs
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!