A binary branch and bound algorithm to minimize maximum scheduling cost

This paper examines a single machine scheduling problem of minimizing the maximum scheduling cost that is nondecreasing with job completion time. Job release dates and precedence constraints are considered. We assume that each job can be processed exactly once without preemption. This is a classical...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Omega (Oxford) Jg. 42; H. 1; S. 9 - 15
Hauptverfasser:	Chandra, Charu, Liu, Zhixin, He, Jun, Ruohonen, Toni
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford Elsevier Ltd 01.01.2014 Pergamon Press Inc
Schlagworte:	Algorithms Branch & bound algorithms Branch and bound Cost reduction Health service Heuristic Job shops Manufacturing Mathematical problems Optimization algorithms Production scheduling Scheduling Studies Scheduling Health service Manufacturing Branch and bound
ISSN:	0305-0483, 1873-5274
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!