Semi-online scheduling with GoS eligibility constraints

We consider semi-online scheduling problems on parallel machines to minimize the makespan subject to Grade of Service (GoS) eligibility constraints with different prior information: (1) the known total processing time, (2) the known largest processing time, (3) the known both total and largest proce...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal of production economics Ročník 153; s. 204 - 214
Hlavní autoři:	Lee, Kangbok, Hwang, Hark-Chin, Lim, Kyungkuk
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.07.2014 Elsevier Sequoia S.A
Témata:	Algorithms Competitive ratio Economics Grade of Service (GoS) Job shops Lower bound example Lower bounds Mathematical problems Operations research Optimization Optimization algorithms Production scheduling Scheduling Scheduling algorithms Semi-online scheduling Studies Unified algorithm Unified algorithm Grade of Service (GoS) Lower bound example Semi-online scheduling Competitive ratio
ISSN:	0925-5273, 1873-7579
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!

Buďte první, kdo okomentuje tento záznam!