Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines

The paper addresses the problem of multi-slot just-in-time scheduling. Unlike the existing literature on this subject, it studies a more general criterion—the minimization of the schedule makespan rather than the minimization of the number of slots used by schedule. It gives an O ( n log 2 n )-time...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of scheduling Jg. 13; H. 5; S. 479 - 492
Hauptverfasser:	Dereniowski, Dariusz, Kubiak, Wiesław
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.10.2010 Springer Science + Business Media Springer Nature B.V
Schlagworte:	Approximation Artificial Intelligence Business and Management Calculus of Variations and Optimal Control; Optimization Just in time Operations Research/Decision Theory Optimization Optimization algorithms Polynomials Production controls Schedules Scheduling Supply Chain Management Supply chains Just-in-time scheduling Multi-slot Makespan minimization
ISSN:	1094-6136, 1099-1425
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!