Scheduling with multiple servers
- 151 Downloads
In this paper, we consider the problem of scheduling a set of jobs on a set of identical parallel machines. Before the processing of a job can start, a setup is required which has to be performed by a given set of servers. We consider the complexity of such problems for the minimization of the makespan. For the problem with equal processing times and equal setup times we give a polynomial algorithm. For the problem with unit setup times, m machines and m − 1 servers, we give a pseudopolynomial algorithm. However, the problem with fixed number of machines and servers in the case of minimizing maximum lateness is proven to be unary NP-hard. In addition, recent algorithms for some parallel machine scheduling problems with constant precessing times are generalized to the corresponding server problems for the case of constant setup times. Moreover, we perform a worst case analysis of two list scheduling algorithms for makespan minimization.
KeywordsRemote Control Setup Time Parallel Machine List Schedule Partial Schedule
Unable to display preview. Download preview PDF.
- 2.Koulamas, C.P., Scheduling on Two Parallel Machines for Minimizing Machine Interference, Working Paper, 1993.Google Scholar
- 8.Huang, S., Cai, L., and Zhang, X., Parallel Dedicated Machine Scheduling Problem with Sequencedependent Setups and a Single Server, Comput. & Indust. Eng., 2010, vol. 58, no. 1, pp. 165–174.Google Scholar
- 16.Dobson, G. and Kamarkar, U.S., Simultaneous Resource Scheduling to Minimize Weighted Flow Time, Oper. Res., 1988, vol. 37, pp. 1523–1533.Google Scholar
- 19.Hall, N.G., Potts, C.N., and Sriskandarajah, C., Parallel Machine Scheduling with a Common Server, in The Fifth International Workshop on Project Management and Scheduling, Abstracts, 1997, pp. 102–106.Google Scholar
- 23.Kravchenko, S.A. and Werner, F., On a Parallel Machine Scheduling Problem with Equal Processing Times, Preprint of Otto-von-Guericke-Universität, Magdeburg, 2007, no. 26/07.Google Scholar