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

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

DOI QR Code

An efficient algorithm for scheduling parallel machines with multiple servers

다중 서버를 사용하는 병렬 머신 스케줄링을 위한 효율적인 알고리즘

  • Received : 2014.04.22
  • Accepted : 2014.05.27
  • Published : 2014.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

The parallel machine scheduling is to schedule each job to exactly one parallel machine so that the total completion time is minimized. It is used in various manufacturing system areas such as steel industries, semiconductor manufacturing and plastic industries. Each job has a setup phase and a processing phase. A removal phase is needed in some application areas. 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. Most of previous researches used a single server and considered only a setup phase and a processing phase. If a single server is used for scheduling, the bottleneck in the server increases the total completion time. Even though the number of parallel machines is increased, the total completion time is not reduced significantly. In this paper, we have proposed an efficient algorithm for the parallel machine scheduling using multiple servers and considering setup, processing and removal phases. We also have investigated experimentally how the number of servers and the number of parallel machines 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 sequence- and 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. 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
  4. 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
  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. 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.
  7. 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
  8. 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
  9. F. Werner and S.A. Kravchenko, "Parallel Machine Scheduling with a Single Server," Mathematicsl and Computer Modelling, vol. 26, pp. 1-11, 1997
  10. 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
  11. 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
  12. J. Hu, Q. Jhang, J. Dong, and Y. J, "Parallel Machine Scheduling with a Single Server: Loading and Unloading," LNCS 8287, pp. 106-116, 2013
  13. 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
  14. H .S. Gan, A. A. Wirth and 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
  15. 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.
  16. C.Bussema and E. Torng, "Greedy multiprocessor server scheduling," Operations Research Letters, vol. 34, pp. 451-458, 2006. https://doi.org/10.1016/j.orl.2005.07.005
  17. C. Su, "Online LPT algorithms for parallel machines scheduling with a single server," J. Comb. Optim., 26, pp. 480-488, 2013 https://doi.org/10.1007/s10878-011-9441-z
  18. 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
  19. 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

Cited by

  1. Scheduling an automatic IoT manufacturing system with multiple servers vol.157, pp.None, 2021, https://doi.org/10.1016/j.cie.2021.107343