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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of scheduling Ročník 13; číslo 5; s. 479 - 492
Hlavní autori:	Dereniowski, Dariusz, Kubiak, Wiesław
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.10.2010 Springer Science + Business Media Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!