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...

Celý popis

Podrobná bibliografie

Vydáno v:	European journal of operational research Ročník 200; číslo 1; s. 305 - 308
Hlavní autoři:	Gawiejnowicz, Stanisław, Kononov, Alexander
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 2010 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!