Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines

We address the single-machine batch scheduling problem with the objective of minimizing the total setup cost. This problem arises when there are n jobs that are partitioned into F families and when setup operations are required whenever the machine switches from processing a job of one family to pro...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of scheduling Vol. 21; no. 6; pp. 595 - 606
Main Authors:	Kress, Dominik, Barketau, Maksim, Pesch, Erwin
Format:	Journal Article
Language:	English
Published:	New York Springer US 01-12-2018 Springer Nature B.V
Subjects:	Artificial Intelligence Batch processing Business and Management Calculus of Variations and Optimal Control; Optimization Job shops Operations Research/Decision Theory Optimization Production scheduling Scheduling Supply Chain Management Switches Setup cost GT-schedule Strong NP-hardness Job families Approximation algorithm Batch scheduling EDD-schedule
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!