Title :
Scheduling Parallel Machines with a Single Server: A Dedicated Case
Author :
Xie, Xie ; Zheng, Yongyue ; Li, Yanping
Author_Institution :
Key Lab. of Manuf. Ind. & Integrated Autom., Shenyang Univ., Shenyang, China
Abstract :
The model in this paper is abstracted from a key course of batch annealing process in the steel industry: heating or cooling. We mainly investigate scheduling parallel dedicated machines with a single sever as well as additional constraints on setups and removals. It generalizes classical parallel machine scheduling problem with a single server which needs to perform setup operation of each job only. The single server in our problem do not only load a job on a machine which takes a certain setup time immediately before processing but also unload a job from the machine which takes a certain removal time after processing. The objective is to minimize make span. A polynomial time approximate algorithm is proposed with a tight worst-case bound at most twice as large as the optimal value.
Keywords :
annealing; batch processing (industrial); computational complexity; cooling; heating; single machine scheduling; steel industry; batch annealing process; classical parallel machine scheduling problem; cooling; heating; parallel dedicated machine scheduling; polynomial time approximate algorithm; removal time; scheduling parallel machines; setup operation; setup time; single server; steel industry; tight worst-case bound; Approximation algorithms; Approximation methods; Job shop scheduling; Parallel machines; Processor scheduling; Schedules; Servers; Heuristics; NP-hard problem; Parallel machines; Ratio performance; Scheduling; Single server;
Conference_Titel :
Computational Sciences and Optimization (CSO), 2012 Fifth International Joint Conference on
Conference_Location :
Harbin
Print_ISBN :
978-1-4673-1365-0
DOI :
10.1109/CSO.2012.39