Journal of the Korea Society of Computer and Information (한국컴퓨터정보학회논문지)

Korean Society of Computer Information (한국컴퓨터정보학회)
권호 표지
DOI QR코드

DOI QR Code

Parallel Machine Scheduling Considering the Moving Time of Multiple Servers

  • Received : 2017.08.01
  • Accepted : 2017.10.11
  • Published : 2017.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we study the problem of parallel machine scheduling considering the moving time of multiple servers. The parallel machine scheduling is to assign jobs to parallel machines so that the total completion time(makespan) is minimized. Each job has a setup phase, a processing phase and a removal phase. A processing phase is performed by a parallel machine alone while a setup phase and a removal phase are performed by both a server and a parallel machine simultaneously. A server is needed to move to a parallel machine for a setup phase and a removal phase. But previous researches have been done under the assumption that the server moving time is zero. In this study we have proposed an efficient algorithm for the problem of parallel machine scheduling considering multiple server moving time. We also have investigated experimentally how the number of servers and the server moving time affect the total completion time.

Keywords

References

  1. J. H. Lee, J. M. Yu and D. H. Lee, "A tabu search algorithm for unrelated parallel machine scheduling with sequenceand machine-dependent setups: minimizing total tardiness, " Intl. J. of Adv. Manuf. Tech., 2013.
  2. K. Lee, J. Y.-T. Leung and M. L. Pinedo, " Makespan minimization in online scheduling with machine eligibility," Ann. Ope. res., vol. 204, pp. 189-222, 2013. https://doi.org/10.1007/s10479-012-1271-6
  3. X. Xie, H. Zhou, Y. Li, and Y. Zheng, "Scheduling Parallel Machines with a Single Server,"IEEE Intl. Conf. on MIC, pp. 453-456, 2012.
  4. K. Chong, "An efficient algorithm for scheduling parallel machines with multiple servers," Journal of the Korea Society of Computer Information, vol. 19, no. 6, pp. 101-108, 2014. https://doi.org/10.9708/JKSCI.2014.19.6.101
  5. A. H. Abdekhodaee and A. Wirth, "Scheduling parallel machines with a single server: some solvable cases and heuristics," Computers and Operation Research 29, pp. 295-315, 2002. https://doi.org/10.1016/S0305-0548(00)00074-5
  6. A. H. Abdekhodaee, A. Wirth and H. S. Gan, "Equal processing and equal setup time cases of scheduling parallel machines with a single server," Computers and Operation Research 31, pp. 1867-1889, 2004. https://doi.org/10.1016/S0305-0548(03)00144-8
  7. A. H. Abdekhodaee, A. Wirth and H. S. Gan, "Scheduling parallel machines with a single server: the general case," Computers and Operation Research 33, pp. 994-1009, 2006. https://doi.org/10.1016/j.cor.2004.08.013
  8. H. S. Gan, A. Wirth and A. H. Abdekhodaee, "A branch-and-price algorithm for scheduling parallel machines with a single server," Computers and Operation Research 39, pp. 2242-2247, 2012. https://doi.org/10.1016/j.cor.2011.11.007
  9. F. Werner and S. A. Kravchenko, "Parallel Machine Scheduling with a Single Server," Mathematics and Computer Modelling, vol. 26, pp. 1-11, 1997.
  10. N. G. Hall, C. N. Potts and C. Sriskandarajah, "Parallel machine scheduling with a common server,"Discrete Applied Mathematics, vol. 102, pp. 223-243, 2000. https://doi.org/10.1016/S0166-218X(99)00206-1
  11. P. Brucker, C. Dhaenens-Flipo, S. Knust, S. A. Kravchchenko, and F. Werner, "Complexity results for parallel machine problems with a single server," J. of Scheduling, vol. 5, pp. 429-457, 2002. https://doi.org/10.1002/jos.120
  12. J. Hu, Q. Jhang, J. Dong, and Y. Jiang, "Parallel Machine Scheduling with a Single Server: Loading and Unloading," LNCS 8287, pp. 106-116, 2013.
  13. X. Xie, Y. Li, and Y. Zheng, "Scheduling Parallel Machines with a Single Server: a Dedicated Case," Fifth Intl. Joint Conf. on Computational Science and Optimization, pp. 146-149, 2012.
  14. J. Ou, X. Qi, and C. Y. Lee, "Parallel Machine Scheduling with Multiple Unloading Servers," J. of Scheduling, vol. 13, no. 3 pp. 213-226, 2009. https://doi.org/10.1007/s10951-009-0104-1
  15. F. Werner and S. A. Kravchenko, "Scheduling with Multiple Servers," Automation and Remote Control, vol. 71, no. 10, pp. 2109-2121, 2010. https://doi.org/10.1134/S0005117910100103
  16. C. Wu, L. Wang and X. Zheng, "An effective estimation of distribution algorithm for solving uniform parallel machine scheduling problem with precedence constraints," 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 2626 - 2632, 2016.
  17. M.-A. Hassan, I. Kacem, S. Martin and I. M. Osman, "Valid inequalities for unrelated parallel machines scheduling with precedence constraints," International Conference on Control, Decision and Information Technologies (CoDIT) pp. 677-682, 2016.
  18. K. Abdellafou and Q. Korbaa, "Makespan minimization for two parallel machines with unavailability constraints," IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 601-606, 2016.
  19. Z. Xu, A. Liu and Q. Wang, "Mixed 0-1 programming model for three parallel machines scheduling problem with machine-dependent unavailable constraints," 13th International Conference on Service Systems and Service Management (ICSSSM), pp. 1-4, 2016.
  20. J. He, Q. Li and D. Xu, "Scheduling two parallel machines with maintenance-dependent availabilities," Computer and Operation Research 72, pp. 13-42, 2016.
  21. L. Y. Wang, X. Huang, P. Ji and E. M. Feng, "Unrelated parallel machine scheduling with deteriorating maintenance activities to minimize the total completion time ," Optim. Letters, 2012.
  22. C. W. Lin, Y. K. Lin and H. T. Hsieh, "Ant colony optimization for unrelated parallel machine scheduling," Intl. J. of Adv. Manuf. Tech., 2013.
  23. V. Kayvanfar, E. Teymourian and K. Alizadeh, " Intelligent water drops algorithm on parallel machines scheduling," International Conference on Industrial Engineering and Operations Management (IEOM) pp. 1-5, 2015.
  24. C. P. Koulamas, "Scheduling two parallel semiautomatic machines to minimize machine interference," Computers and operation Research, vol. 23, no. 10, pp.945-956, 1996. https://doi.org/10.1016/0305-0548(96)00011-1