Browse > Article
http://dx.doi.org/10.9708/jksci.2014.19.6.101

An efficient algorithm for scheduling parallel machines with multiple servers  

Chong, Kyun-Rak (Dept. of Computer Engineering, HongIk University)
Publication Information
Journal of the Korea Society of Computer and Information / v.19, no.6, 2014 , pp. 101-108 More about this Journal
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
parallel machine scheduling; the total completion time; NP-hard;
Citations & Related Records
연도 인용수 순위
  • Reference
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   DOI
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   DOI   ScienceOn
4 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   DOI   ScienceOn
5 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.
6 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   DOI   ScienceOn
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   DOI
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 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   DOI   ScienceOn
11 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
12 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   DOI   ScienceOn
13 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   DOI   ScienceOn
14 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.
15 C.Bussema and E. Torng, "Greedy multiprocessor server scheduling," Operations Research Letters, vol. 34, pp. 451-458, 2006.   DOI   ScienceOn
16 C. Su, "Online LPT algorithms for parallel machines scheduling with a single server," J. Comb. Optim., 26, pp. 480-488, 2013   DOI   ScienceOn
17 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
18 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
19 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   DOI   ScienceOn