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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of scheduling Vol. 13; no. 5; pp. 479 - 492
Main Authors:	Dereniowski, Dariusz, Kubiak, Wiesław
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.10.2010 Springer Science + Business Media Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!