JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Heuristic Algorithms for Parallel Machine Scheduling Problems with Dividable Jobs
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Heuristic Algorithms for Parallel Machine Scheduling Problems with Dividable Jobs
Tsai, Chi-Yang; Chen, You-Ren;
  PDF(new window)
 Abstract
This research considers scheduling problems with jobs which can be divided into sub-jobs and do not required to be processed immediately following one another. Heuristic algorithms considering how to divide jobs are proposed in an attempt to find near-optimal solutions within reasonable run time. The algorithms contain two phases which are executed recursively. Phase 1 of the algorithm determines how jobs should be divided while phase 2 solves the scheduling problem given the sub-jobs established in phase 1. Simulated annealing and genetic algorithms are applied for the two phases and four heuristic algorithms are established. Numerical experiment is conducted to determine the best parameter values for the heuristic algorithms. Examples with different sizes and levels of complexity are generated. Performance of the proposed algorithms is evaluated. It is shown that the proposed algorithms are able to efficiently and effectively solve the considered problems.
 Keywords
Parallel Machine Scheduling;Dividable Jobs;Simulated Annealing;Genetic Algorithm;
 Language
English
 Cited by
 References
1.
Anagnostopoulos, G. C. and Rabadi, G. (2002). A simulated annealing algorithm for the unrelated parallel machine scheduling problem, Proceedings of the 5th Biannual World Automation Congress, 14, 115-120.

2.
Armentano, V. A. and de França Filho, M. F. (2007), Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approach, European Journal of Operational Research, 183(1), 100-114. crossref(new window)

3.
Azizoglu, M. and Kirca, O. (1998), Tardiness minimization on parallel machines, International Journal of Production Economics, 55(2), 163-168. crossref(new window)

4.
Azizoglu, M. and Kirca, O. (1999), On the minimization of total weighted flow time with identical and uniform parallel machines, European Journal of Operational Research, 113(1), 91-100. crossref(new window)

5.
Bilge, U., Kırac, F., Kurtulan, M., and Pekgün, P. (2004), A tabu search algorithm for parallel machine total tardiness problem, Computers and Operations Research, 31(3), 397-414. crossref(new window)

6.
Cheng, R., Gen, M., and Tozawa, T. (1995), Minmax earliness/ tardiness scheduling in identical parallel machine system using genetic algorithms, Computers and Industrial Engineering, 29(1-4), 397-414.

7.
Dessouky, M. M., Dessouky, M. I., and Verma, S. K. (1998), Flowshop scheduling with identical jobs and uniform parallel machines, European Journal of Operational Research, 109(3), 620-631. crossref(new window)

8.
Guo, Y., Lim, A., Rodrigues, B., and Liang, Y. (2007), Minimizing the makespan for unrelated parallel machines, International Journal on Artificial Intelligence Tools, 16(3), 309-415.

9.
Kim, D., Kim, K., Jang, W., and Chen, F. F. (2002), Unrelated parallel machine scheduling with setup times using simulated annealing, Robotics and Computer-Integrated Manufacturing, 18(3-4), 223-231. crossref(new window)

10.
Kim, D., Na, D., and Chen, F. F. (2003), Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective, Robotics and Computer-Integrated Manufacturing, 19(1-2), 173-181. crossref(new window)

11.
Kim, D., Na, D., Jang, W., and Chen, F. F. (2006), Simulated annealing and genetic algorithm for unrelated parallel machine scheduling considering setup times, International Journal of Computer Applications in Technology, 26(1-2), 28-36. crossref(new window)

12.
Liao, C., and Lin, C. (2003), Makespan minimization for two uniform parallel machines, International Journal of Production Economics, 84(2), 205-213. crossref(new window)

13.
Low, C. (2005), Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines, Computers and Operations Research, 32(8), 2013-2025. crossref(new window)

14.
Mason, A. J. (1992), Genetic algorithm and scheduling problems, Ph.D. thesis, Department of Management Sciences, University of Cambridge, UK.

15.
Min, L. and Cheng, W. (1999), A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines, Artificial Intelligence in Engineering, 13(4), 399-403. crossref(new window)

16.
Piersma, N. and Van Dijk, W. (1996), A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search, Mathematical and Computer Modelling, 24(9), 11-19.

17.
Rubin, P. A. and Ragatz, G. L. (1994), Scheduling in a sequence dependent setup environment with genetic search, Computers and Operations Research, 22(1), 85-99.

18.
Tan, K., Narasimhan, R., Rubin, P. A., and Ragatz, G. L. (2000), A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times, Omega, 28(3), 313-326. crossref(new window)

19.
Tsai, C.-Y. and Tseng, C.-J. (2007), Unrelated parallelmachines scheduling with constrained resources and sequence-dependent setup time, Proceedings of the 37th International Conference on Computers and Industrial Engineering, Alexandria, Egypt, 20-23.

20.
Tsai, C.-Y. and Wu, S.-N. (2006), Application of simulated annealing algorithm on the unrelated parallel machine scheduling problem with limited resources, Proceedings of the 36th International Conference on Computers and Industrial Engineering, Taipei, Taiwan, 20-26.

21.
Yalaoui, F., and Chu, C. (2002), Parallel machine scheduling to minimize total tardiness, International Journal of Production Economics, 76(3), 265-279. crossref(new window)