A divide-and-conquer strategy with particle swarm optimization for the job shop scheduling problem

Engineering Optimization

Volumn 42, Issue 7, 2010, Pages 641-670

  Zhang, Rui ^a   Wu, Cheng ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

divide and conquer; job shop scheduling problem; particle swarm optimization; simulated annealing

Indexed keywords

COMPUTATIONAL EXPERIMENT; COMPUTATIONAL TIME; DIVIDE AND CONQUER; FEASIBLE SOLUTION; FINAL OBJECTIVE; JOB SHOP SCHEDULING PROBLEM; JOB SHOP SCHEDULING PROBLEMS; LOWER BOUNDS; NON-ITERATIVE; OPTIMIZATION ALGORITHMS; PARTICLE SWARM OPTIMIZATION ALGORITHM; PRODUCTION DATA; REAL-WORLD; SCHEDULING PROBLEM; SOLUTION QUALITY; SUB-PROBLEMS; TEST PROBLEM; TOTAL-WEIGHTED TARDINESS; UPPER BOUND;

ALGORITHMS; ANNEALING; MACHINE SHOPS; PARTICLE SWARM OPTIMIZATION (PSO);

SIMULATED ANNEALING;

EID: 77954040522     PISSN: 0305215X     EISSN: 10290273     Source Type: Journal    
DOI: 10.1080/03052150903369845     Document Type: Article

References (74)

1. Adams, J., Balas, E., and Zawack, D., 1988. The shifting bottleneck procedure for job shop scheduling. Management Science, 34 (3), 391-401. (Pubitemid 18580052)
2. Amaral Armentano, V. and Rigão Scrich, C., 2000. Tabu search for minimizing total tardiness in a job shop. International Journal of Production Economics, 63 (2), 131-140. (Pubitemid 32082410)
3. Anderson, E.J. and Nyirenda, J.C., 1990. Two new rules to minimize tardiness in a job shop. International Journal of Production Research, 28 (12), 2277-2292.
4. Banks, A., Vincent, J., and Anyakoha, C., 2007. A review of particle swarm optimization - Part I: Background and development. Natural Computing, 6 (4), 467-484. (Pubitemid 47629392)
5. Banks, A., Vincent, J., and Anyakoha, C., 2008. A review of particle swarm optimization - Part II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Natural Computing, 7 (1), 109-124. (Pubitemid 351234459)
6. Barnes, J.W. and Chambers, J.B., 1995. Solving the job shop scheduling problem with tabu search. Transactions of the Institute of Industrial Engineers, 27 (2), 257-263.
7. Bassett, M.H., et al., 1996a. Perspectives on model based integration of process operations. Computers & Chemical Engineering, 20 (6-7), 821-844. (Pubitemid 126666071)
8. Bassett, M.H., Pekny, J.F., and Reklaitis, G.V., 1996b. Decomposition techniques for the solution of large-scale scheduling problems. AIChE Journal, 42 (12), 3373-3387. (Pubitemid 126452043)
9. Bitran, G.R., Haas, E.A., and Hax, A.C., 1981. Hierarchical production planning: a single system. Operations Research, 29 (4), 717-743. (Pubitemid 12471860)
10. Bożejko,W. and Makuchowski, M., 2008. A fast hybrid tabu search algorithm for the no-wait job shop problem. Computers & Industrial Engineering, 56 (4), 1502-1509.
11. Braune, R., Wagner, S., and Affenzeller, M., 2007. Optimization methods for large-scale production scheduling problems. In: R. Moreno-Díaz, F. Pichler, and A. Quesada-Arencibia, eds. Proceedings of the 11th international conference on computer aided systems theory (EUROCAST 2007), Las Palmas de Gran Canaria, Spain, 12-16 February 2007, Lecture Notes in Computer Science 4739. Berlin: Springer-Verlag, 812-819.
12. Brucker, P., 2004. Scheduling algorithms. Berlin: Springer-Verlag.
13. Byeon, E.S., Wu, S.D., and Storer, R.H., 1998. Decomposition heuristics forrobust job-shop scheduling. IEEE Transactions on Robotics and Automation, 14 (2), 303-313.
14. Chen, Z.L. and Powell, W.B., 1999. Acolumn generation based decomposition algorithm for a parallel machine just-in-time scheduling problem. European Journal of Operational Research, 116 (1), 220-232.
15. Chong, C.S., et al., 2006. A bee colony optimization algorithm to job shop scheduling. In: L.F. Perrone, et al., eds. Proceedings of the 38th conference on winter simulation (WSC'06), Monterey, 3-6 December 2006. Monterey, CA: Monterey Press, 1954-1961.
16. Chu, C., Portmann, M.C., and Proth, J.M., 1992. Splitting-up approach to simplify job-shop scheduling problems. International Journal of Production Research, 30 (4), 859-870.
17. Dell'Amico, M. and Trubian, M., 1993. Applying tabu search to the job-shop scheduling problem. Annals of Operations Research, 41 (3), 231-252.
18. Demirkol, E., Mehta, S., and Uzsoy, R., 1997. A computational study of shifting bottleneck procedures for shop scheduling problems. Journal of Heuristics, 3 (2), 111-137. (Pubitemid 127505777)
19. Eberhart, R. and Kennedy, J., 1995. A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science (MHS'95), Nagoya, Aichi, Japan, 4-6 October 1995. New York: IEEE Press, 39-43.
20. Essafi, I., Mati,Y., and Dauzère-Pérès, S., 2008. A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Computers & Operational Research, 35 (8), 2599-2616. (Pubitemid 350245426)
21. Fox, B., Xiang, W., and Lee, H.P., 2007. Industrial applications of the ant colony optimization algorithm. International Journal of Advanced Manufacturing Technology, 31 (7-8), 805-814. (Pubitemid 46005353)
22. Gao, J., Sun, L., and Gen, M., 2008. A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers & Operations Research, 35 (9), 2892-2907. (Pubitemid 351186807)
23. Gélinas, S. and Soumis, F., 2005. Dantzig-Wolfe decomposition for job shop scheduling. In: Column generation. New York: Springer Science, 271-302.
24. Glover, F., 1986. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 13 (5), 533-549. (Pubitemid 17480188)
25. Glover, F., 1989. Tabu search - Part I. ORSA Journal on Computing, 1 (3), 190-206.
26. Glover, F., 1990. Tabu search - Part II. ORSA Journal on Computing, 2 (1), 4-32.
27. Grabowski, J. and Wodecki, M., 2005. A very fast tabu search algorithm for job shop problem. In: Metaheuristic optimization via memory and evolution: tabu search and scatter search. New York: Springer-Verlag, 117-144.
28. Graham, R.L., et al., 1979. Optimisation and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287-326.
29. Harjunkoski, I. and Grossmann, I.E., 2001. A decomposition approach for the scheduling of a steel plant production. Computers & Chemical Engineering, 25 (11-12), 1647-1660. (Pubitemid 33086119)
30. Harjunkoski, I. and Grossmann, I.E., 2002. Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Computers & Chemical Engineering, 26 (11), 1533-1552. (Pubitemid 35192175)
31. Huang, K.L. and Liao, C.J., 2008. Ant colony optimization combined with taboo search for the job shop scheduling problem. Computers & Operations Research, 35 (4), 1030-1046. (Pubitemid 47404760)
32. Jensen, J.B., Philipoom, P.R., and Malhotra, M.K., 1995. Evaluation of scheduling rules with commensurate customer priorities in job shops. Journal of Operations Management, 13 (3), 213-228.
33. Kennedy, J. and Eberhart, R., 1995. Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks (ICNN'95), Perth, Australia, 27 November - 1 December 1995, Vol. 4. New York: IEEE Press, 1942-1948.
34. Kolonko, M., 1999. Some new results on simulated annealing applied to the job shop scheduling problem. European Journal of Operational Research, 113 (1), 123-136.
35. Krishna, K., Ganeshan, K., and Ram, D.J., 1995. Distributed simulated annealing algorithms for job shop scheduling. IEEE Transactions on Systems, Man and Cybernetics, 25 (7), 1102-1109.
36. Krüger, K., et al., 1995. A heuristic decomposition algorithm for scheduling problems on mixed graphs. Journal of the Operational Research Society, 46 (12), 1481-1497.
37. Lenstra, J.K., Kan, A.H.G.R., and Brucker, P., 1977. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343-362.
38. Lian, Z., Jiao, B., and Gu, X., 2006.A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Applied Mathematics and Computation, 183 (2), 1008-1017. (Pubitemid 46014650)
39. Liu, B., Wang, L., and Jin, Y.H., 2007. An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Transactions on Systems, Man and Cybernetics - Part B: Cybernetics, 37 (1), 18-27. (Pubitemid 46358476)
40. Luh, P.B., et al., 1998. Job shop scheduling with group-dependent setups, finite buffers and long time horizon. Annals of Operations Research, 76, 233-259. (Pubitemid 128405205)
41. Luh, P.B. and Hoitomt, D.J., 1993. Scheduling of manufacturing systems using the Lagrangian relaxation technique. IEEE Transactions on Automatic Control, 38 (7), 1066-1080.
42. Manikas, A. and Chang, Y.L., 2009. A scatter search approach to sequence-dependent setup times job shop scheduling. International Journal of Production Research, 47 (18), 5217-5236.
43. Mason, S.J., Fowler, J.W., and Carlyle, W.M., 2002.A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. Journal of Scheduling, 5 (3), 247-262. (Pubitemid 135712634)
44. Mönch,L. and Drießel, R., 2005.A distributed shifting bottleneck heuristic for complex job shops. Computers & Industrial Engineering, 49 (3), 363-380. (Pubitemid 41436335)
45. Mönch, L., et al., 2007. Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops. European Journal of Operational Research, 177 (3), 2100-2118. (Pubitemid 44709466)
46. Nowicki, E. and Smutnicki, C., 1996. A fast taboo search algorithm for the job shop problem. Management Science, 42 (6), 797-813. (Pubitemid 126577322)
47. Nowicki, E. and Smutnicki, C., 2005. An advanced tabu search algorithm for the job shop problem. Journal of Scheduling, 8 (2), 145-159. (Pubitemid 40536998)
48. Ovacik, I.M. and Uzsoy, R., 1997. Decomposition methods for complex factory scheduling problems. Boston, MA: Kluwer Academic.
49. Panwalkar, S.S. and Iskander, W., 1977. A survey of scheduling rules. Operations Research, 25 (1), 45-61.
50. Park, M.W. and Kim, Y.D., 1998. A systematic procedure for setting parameters in simulated annealing algorithms. Computers & Operations Research, 25 (3), 207-217. (Pubitemid 128393358)
51. Pinedo, M. and Singer, M., 1999.A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics, 46 (1), 1-17. (Pubitemid 129700845)
52. Ponnambalam, S.G., Jawahar, N., and Aravindan, P., 1999. A simulated annealing algorithm for job shop scheduling. Production Planning & Control, 10 (8), 767-777. (Pubitemid 30512782)
53. Rigão Scrich, C., Amaral Armentano, V., and Laguna, M., 2004. Tardiness minimization in a flexible job shop: a tabu search approach. Journal of Intelligent Manufacturing, 15 (1), 103-115.
54. Rivera, D.C., Becerra, R.L., and Coello, C.A.C., 2007. Cultural algorithms, an alternative heuristic to solve the job shop scheduling problem. Engineering Optimization, 39 (1), 69-85. (Pubitemid 44956296)
55. Sannomiya, N. and Iima, H., 1999. Genetic algorithm approach to an optimal scheduling problem for a large-scale complex manufacturing system. In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics (SMC'99), Tokyo, Japan, 12-15 October 1999, Vol. 3. New York: IEEE Press, 622-627. (Pubitemid 30595708)
56. Sha, D.Y. and Hsu, C.Y., 2006. A hybrid particle swarm optimization for job shop scheduling problem. Computers & Industrial Engineering, 51 (4), 791-808.
57. Singer, M., 2001. Decomposition methods for large job shops. Computers & Operations Research, 28 (3), 193-207.
58. Sun, D. and Batta, R., 1996. Scheduling larger job shops: a decomposition approach. International Journal of Production Research, 34 (7), 2019-2033. (Pubitemid 126525283)
59. Taillard, E.D., 1994. Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing, 6 (2), 108-117.
60. Tang, L., et al., 2002. Steel-making process scheduling using Lagrangian relaxation. International Journal of Production Research, 40 (1), 55-70. (Pubitemid 34593845)
61. Tasgetiren, M.F., et al., 2006. Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem. International Journal of Production Research, 44 (22), 4737-4754. (Pubitemid 44536480)
62. Tasgetiren, M.F., et al., 2007. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research, 177 (3), 1930-1947.
63. Upasani, A.A., Uzsoy, R., and Sourirajan, K., 2006. A problem reduction approach for scheduling semiconductor wafer fabrication facilities. IEEE Transactions on Semiconductor Manufacturing, 19 (2), 216-225. (Pubitemid 43746093)
64. Van Den Akker, M., Hoogeveen, H., and Van de Velde, S., 2005. Applying column generation to machine scheduling. In: Column generation. New York: Springer Science, 303-330.
65. Van Laarhoven, P.J.M., Aarts, E.H.L., and Lenstra, J.K., 1992. Job shop scheduling by simulated annealing. Operations Research, 40 (1), 113-125.
66. Vepsalainen, A.P. and Morton, T.E., 1987. Priority rules for job shops with weighted tardy costs. Management Science, 33 (8), 95-103.
67. Wang, T.Y. and Wu, K.B., 2000. A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems. International Journal of Systems Science, 31 (4), 537-542.
68. Wu, D. and Ierapetritou, M.G., 2003. Decomposition approaches for the efficient solution of short-term scheduling problems. Computers & Chemical Engineering, 27 (8-9), 1261-1276. (Pubitemid 36897200)
69. Wu, S.D., Byeon, E.S., and Storer, R.H., 1999. A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness. Operations Research, 47 (1), 113-124. (Pubitemid 129700862)
70. Xi,Y. and Fang, J., 1997. A rolling horizon job shop rescheduling strategy in the dynamic environment. The International Journal of Advanced Manufacturing Technology, 13 (3), 227-232. (Pubitemid 127549067)
71. Xia, W. and Wu, Z., 2006. A hybrid particle swarm optimization approach for the job-shop scheduling problem. International Journal of Advanced Manufacturing Technology, 29 (3-4), 360-366. (Pubitemid 43814109)
72. Zhang, C.Y., et al., 2008. A very fast TS/SA algorithm for the job shop scheduling problem. Computers & Operations Research, 35 (1), 282-294. (Pubitemid 46899361)
73. Zhang, R. and Wu, C., 2009.A hybrid approach to large-scale job shop scheduling. Applied Intelligence. Available online, DOI 10.1007/s10489-008-0134- y.
74. Zhou, H., Cheung, W., and Leung, L.C., 2009. Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm. European Journal of Operational Research, 194 (3), 637-649.