Scheduling parallel machines with a single server

This paper investigates scheduling parallel 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. This model is motivated by a k...

Full description

Saved in:
Bibliographic Details
Published inProceedings of 2012 International Conference on Measurement, Information and Control Vol. 1; pp. 453 - 456
Main Authors Xie Xie, Huibo Zhou, Yanping Li, Yongyue Zheng
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2012
Subjects
Automation
NP-hard problem
parallel machines
ratio performance
single server
Standardization
Online AccessGet full text

Cover

More Information
Summary:This paper investigates scheduling parallel 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. This model is motivated by a key course of batch annealing process in the steel industry: heating or cooling. The objective is to minimize makespan. For this problem, we first give some complexity results by reduction. Some optimal properties are derived. Based on the properties, a LPT heuristics is proposed which generates a tight worst-case bound 3/2-1/2m.
ISBN:9781457716010
1457716011
DOI:10.1109/MIC.2012.6273340