Automation and Remote Control

, Volume 71, Issue 10, pp 2109–2121 | Cite as

Scheduling with multiple servers

  • F. Werner
  • S. A. Kravchenko
Multi-Machine and Multi-Stage Scheduling Environments


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.


Remote Control Setup Time Parallel Machine List Schedule Partial Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hall, N.G., Potts, C.N., and Sriskandarajah, C., Parallel Machine Scheduling with a Common Server, Discret. Appl. Math., 2000, vol. 102, pp. 223–243.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Koulamas, C.P., Scheduling on Two Parallel Machines for Minimizing Machine Interference, Working Paper, 1993.Google Scholar
  3. 3.
    Koulamas, C.P. and Smith, M.L., Look-ahead Scheduling for Minimizing Machine Interference, Int. J. Product. Res., 1988, vol. 26, pp. 1523–1533.CrossRefGoogle Scholar
  4. 4.
    Kravchenko, S.A. and Werner, F., Parallel Machine Scheduling Problems with a Single Server, Math. Comput. Model., 1997, vol. 26, pp. 1–11.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Brucker, P., Dhaenens-Flipo, C., Knust, S., Kravchenko, S.A., and Werner, F., Complexity Results for Parallel Machine Problems with a Single Server, J. Schedul., 2002, vol. 5, pp. 429–457.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Allahverdi, A., Ng, C.T., Cheng, T.C.E., and Kovalyov, M.Y., A Survey of Scheduling Problems with Setup Times or Costs, Eur. J. Oper. Res., 2008, vol. 187, pp. 985–1032.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Ou, J., Qi, X., and Lee, C.-Y., ParallelMachine Scheduling withMultiple Unloading Servers, J. Schedul., 2009, vol. 13, no. 3, pp. 213–226.CrossRefMathSciNetGoogle Scholar
  8. 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
  9. 9.
    Aronson, J.E., Two Heuristics for the Deterministic, Single Operator, Multiple Machine, Multiple Run Cyclic Scheduling Problem, J. Oper. Manage., 1984, vol. 4, pp. 159–773.CrossRefGoogle Scholar
  10. 10.
    Wilhelm, W.E. and Sarin, S.C., A Structure for Sequencing Robot Activities in Machine Loading Applications, Int. J. Product. Res., 1985, vol. 23, pp. 47–64.CrossRefGoogle Scholar
  11. 11.
    Hall, N.G., Kamoun, H., and Sriskandarajah, C., Scheduling in Robotic Cells: Classification, Two and Three Machine Cells, Oper. Res., 1997, vol. 45, pp. 421–439.zbMATHCrossRefGoogle Scholar
  12. 12.
    Hall, N.G., Kamoun, H., and Sriskandarajah, C., Scheduling in Robotic Cells, Complexity and Sready State Analysis, Eur. J. Oper. Res., 1998, vol. 109, pp. 43–65.zbMATHCrossRefGoogle Scholar
  13. 13.
    Kamoun, H., Hall, N.G., and Sriskandarajah, C., Scheduling in Robotic Cells: Heuristics and Cell Design, Oper. Res., 1999, vol. 47, pp. 821–835.zbMATHCrossRefGoogle Scholar
  14. 14.
    Ganesharajah, T., Hall, N.G., and Sriskandarajah, C., Design and Operational Issues in AGV-served Manufacturing Systems, Ann. Oper. Res., 1998, vol. 76, pp. 109–154.zbMATHCrossRefGoogle Scholar
  15. 15.
    Sethi, S.P., Sriskandarajah, C., Sorger, G., Blazewicz, J., and Kubiak, W., Sequencing of Parts and Robot Moves in a Robotic Cell, Int. J. Flexible Manufactur. Syst., 1992, vol. 4, pp. 331–358.CrossRefGoogle Scholar
  16. 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
  17. 17.
    Sahney, V.K., Single-server, Two-machine Sequencing with Switching Time, Oper. Res., 1972, vol. 20, pp. 24–26.zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Graham, R.L., Lawler, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G., Optimization and Approximation in Deterministic Machine Scheduling: A Survey, Ann. Discret. Math., 1979, vol. 5, pp. 287–326.zbMATHCrossRefMathSciNetGoogle Scholar
  19. 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
  20. 20.
    Tanaev, V.S., Gordon, V.S., and Shafransky, Y.M., Scheduling Theory, Single-Stage Systems, Dordrecht: Kluwer, 1994.zbMATHGoogle Scholar
  21. 21.
    Brucker, P. and Kravchenko, S.A., Scheduling Jobs with Equal Processing Times and Time Windows on Identical Parallel Machines, J. Schedul., 2008, vol. 11, pp. 229–237.zbMATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Kravchenko, S.A. and Werner, F., On a Parallel Machine Scheduling Problem with Equal Processing Times, Discret. Appl. Math., 2009, vol. 157, pp. 848–852.zbMATHCrossRefMathSciNetGoogle Scholar
  23. 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

Copyright information

© Pleiades Publishing, Ltd. 2010

Authors and Affiliations

  • F. Werner
    • 1
  • S. A. Kravchenko
    • 2
  1. 1.Otto-von-Guericke-UniversitätMagdeburgGermany
  2. 2.United Institute of Informatics ProblemsBelarussian National Academy of SciencesMinskBelarus

Personalised recommendations