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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of production economics Jg. 153; S. 204 - 214
Hauptverfasser:	Lee, Kangbok, Hwang, Hark-Chin, Lim, Kyungkuk
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.07.2014 Elsevier Sequoia S.A
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!