An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem

Computers and Operations Research

Volumn 45, Issue , 2014, Pages 38-50

  Zhao, Fuqing ^a,b   Tang, Jianxin ^a   Wang, Junbiao ^b   Jonrinaldi, ^c  

^a LANZHOU UNIVERSITY OF TECHNOLOGY   (China)

^b NORTHWESTERN POLYTECHNICAL UNIVERSITY   (China)

^c UNIVERSITY OF EXETER   (United Kingdom)

Author keywords

Adaptive meta Lamarckian strategy; Decline disturbance; Expanded job shop scheduling problem; Multi objective job shop scheduling problem; Particle swarm optimization

Indexed keywords

DECLINE DISTURBANCE; EVOLUTIONAL ALGORITHM; GLOBAL OPTIMAL SOLUTIONS; JOB SHOP SCHEDULING PROBLEMS; META-LAMARCKIAN STRATEGIES; MULTI-OBJECTIVE JOB SHOP SCHEDULING; PERFORMANCE INDICES; PRE-MATURE CONVERGENCES;

ALGORITHMS; MARKOV PROCESSES; PARTICLE SWARM OPTIMIZATION (PSO); PROBABILITY;

REACTIVE POWER;

EID: 84891542046     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.11.019     Document Type: Article

References (72)

1. H. Liu, K. Xing, F. Wang, L. Han, and X. Sun A polynomial algorithm for computing elementary siphons in a class of Petri nets Asian J Control 14 4 2012 1141 1149
2. J. Fu, C. Ye, J. Xie, and W. Zhao Research of improved hybrid quantum algorithm in job shop scheduling problems Comput Eng Appl 2009 48 52
3. B. Cai, F. Mao, L. Fu, and S-h. Yang Hybrid algorithm of particle swarm optimization and stimulated annealing for job-shop scheduling Appl Res Comput 2010 856 859
4. H.B. Yu, and W. Liang Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling Comput Ind Eng 39 3-4 2001 337 356 (Pubitemid 32380886)
5. G. Chryssolouris, and V. Subramaniam Dynamic scheduling of manufacturing job shops using extreme value theory Prod Plann Control 11 2 2000 122 132 (Pubitemid 35394363)
6. J.S. Smith, B.A. Peters, and A. Srinivasan Job shop scheduling considering material handling Int J Prod Res 37 7 1999 1541 1560
7. N. Zribi, I. Kacem, A. El Kamel, and P. Borne Assignment and scheduling in flexible job-shops by hierarchical optimization IEEE Trans Syst Man Cybern C: Appl Rev 37 Compendex 2007 652 661 (Pubitemid 47061966)
8. Ghedjati F. Heuristics and a hybrid meta-heuristic for a generalized job-shop scheduling problem. In: 2010 IEEE congress on evolutionary computation; 2010. p. 8-12.
9. Gonzalez-Rodriguez I, Palacios JJ, Vela CR, Puente J. Heuristic local search for fuzzy open shop scheduling. In: 2010 IEEE international conference on fuzzy systems; 2010. p. 8-12.
10. J.L. Piovesan, and C.T. Abdallah et al. Hybrid framework for resource allocation among multiple agents moving on discrete environments Asian J Control 10 2 2008 171 186
11. J. Hu, and G. Feng Quantized tracking control fora multi-agent system with high-order leader dynamics Asian J Control 13 6 2011 988 997
12. R. Zhang, and C. Wu A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective Comput Oper Res 38 5 2011 854 867
13. C. Zhang, P. Li, Z. Guan, and Y. Rao A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem Comput Oper Res 34 Compendex 2007 3229 3242 (Pubitemid 46517853)
14. A. Baykasoglu, L. Ozbakir, and A.I. Sonmez Using multiple objective tabu search and grammars to model and solve multi-objective flexible job shop scheduling problems J Intell Manuf 15 6 2004 777 785
15. M. Sakawa, and R. Kubota Two-objective fuzzy job shop scheduling through genetic algorithm Electron Commun Jpn III: Fundam Electron Sci 84 4 2001 60 68
16. L. De Giovanni, and F. Pezzella An improved genetic algorithm for the distributed and flexible job-shop scheduling problem Eur J Oper Res 200 2 2010 395 408
17. J.A. Vazquez-Rodriguez, and S. Petrovic A new dispatching rule based genetic algorithm for the multi-objective job shop problem J Heuristics 16 6 2010 771 793
18. C. Gutie rrez, and I. Garci a-Magarino Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem Knowl Based Syst 2011 102 112
19. D.Y. Sha, and C.-Y. Hsu A hybrid particle swarm optimization for job shop scheduling problem Comput Ind Eng 51 Compendex 2006 791 808
20. D.Y. Sha, and L. Hsing-Hung A multi-objective PSO for job-shop scheduling problems Expert Systems with Applications 2010 1065 1070
21. F. Zhao, Y. Hong, D. Yu, Y. Yang, and Q. Zhang A hybrid particle swarm optimisation algorithm and fuzzy logic for process planning and production scheduling integration in holonic manufacturing systems Int J Comput Integrated Manuf 23 1 2010 20 39
22. Y.W. Guo, W.D. Li, A.R. Mileham, and GW. Owen Optimisation of integrated process planning and scheduling using a particle swarm optimisation approach Int J Prod Res 47 14 2009 3775 3796
23. G. Zhang, X. Shao, P. Li, and L. Gao An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem Comput Ind Eng 56 4 2009 1309 1318
24. A. Manikas, and Y.L. Chang A Scatter Search approach to sequence-dependent setup times job shop scheduling Int J Prod Res 47 18 2009 5217 5236
25. M. Saravanan, and A.N. Haq A Scatter Search algorithm for scheduling optimisation of job shop problems Int J Prod Dev 2010 259 272
26. C.-K. Chang, and C.-L. Hsiang An optimal maintenance policy based on generalized stochastic Petri nets and periodic inspection Asian J Control 12 3 2010 364 376
27. J. Guo, and Z. Li A deadlock prevention approach for a class of timed Petri nets using elementary siphons Asian J Control 12 3 2010 347 363
28. Y-S Huang, T-H Chung, and P-J. Su Synthesis of deadlock prevention policy using Petri nets reachability graph technique Asian J Control 12 3 2010 336 346
29. F. Lu, W. Wu, H. Su, and J. Chu Non-blocking decentralized control of discrete event systems based on Petri nets Asian J Control 12 3 2010 323 335
30. N. Wu, and M. Zhou Process vs resource-oriented Petri net modeling of automated manufacturing systems Asian J Control 12 3 2010 267 280
31. R Zhu A deadlock prevention approach for flexible manufacturing systems with uncontrollable transitions in their Petri net models Asian J Control 14 1 2012 217 229
32. A. Caumond, P. Lacomme, and N. TcherneVa A memetic algorithm for the job-shop with time-lags Comput Oper Res 35 7 2008 2331 2356 (Pubitemid 350161141)
33. M. Frutos, A.C. Olivera, and F. Tohme A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem Ann Oper Res 181 1 2010 745 765
34. T.C. Chiang, and L.C. Fu A rule-centric memetic algorithm to minimize the number of tardy jobs in the job shop Int J Prod Res 46 24 2008 6913 6931
35. B. Qian, L. Wang, D-X Huang, and X. Wang Scheduling multi-objective job shops using a memetic algorithm based on differential evolution Int J Adv Manuf Technol 35 9-10 2008 1014 1027
36. J-h Yang, L. Sun, H.P. Lee, Y. Qian, and Y-c. Liang Clonal selection based memetic algorithm for job shop scheduling problems J Bionic Eng 5 2 2008 111 119
37. Hsueh-Chien C, Tsung-Che C, Li-Chen F. Multiobjective job shop scheduling using memetic algorithm and Shifting Bottleneck procedure. In: 2009 IEEE symposium on computational intelligence in scheduling (CI-Sched); 2009. p. 15-1.
38. Peng C-y, Gao L, Shao X-y, ZHOU C. General particle swarm optimization algorithm for job-shop scheduling problem. Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS; 2006. p. 911-17+923 [12(Compendex)].
39. G.G. Yen, and B. Ivers Job shop scheduling optimization through multiple independent particle swarms Int J Intell Comput Cybern 2 Compendex 2009 5 33
40. Ivers B, Yen GG. Job shop optimization through multiple independent particle swarms. In: 2007 IEEE congress on evolutionary computation (CEC 2007), September 25-28, 2007. Singapore: Inst. of Elec. and Elec. Eng. Computer Society; 2008. p. 3361-68. (Pubitemid 351371833)
41. Gomez A, Cuevas R, De La Fuente D, Parreno J, Priore P. New metaheuristic for the job shop scheduling problem with PSO. In: 2008 international conference on artificial intelligence (ICAI 2008) and 2008 international conference on machine learning, models, technologies and applications (MLMTA 2008), July 14-17, 2008. Las Vegas, NV: CSREA Press; 2008.
42. M-R Chen, X. Li, X. Zhang, and Y-Z. Lu A novel particle swarm optimizer hybridized with extremal optimization Appl Soft Comput 10 2 2010 367 373
43. L. Dos Santos Coelho Gaussian quantum-behaved particle swarm optimization approaches for constrained engineering design problems Expert Syst Appl 2010 1676 1683
44. K. Mahadevan, and P.S. Kannan Comprehensive learning particle swarm optimization for reactive power dispatch Appl Soft Comput 10 2 2010 641 652
45. Eberhart RC, Shi Y. Comparing inertia weights and constriction factors in particle swarm optimization. In: Proceedings of the 2000 congress on evolutionary computation (CEC 00), July 16-19, 2000. California, CA, USA: IEEE; 2000.
46. Shi Y, Eberhart RC. Population diversity of particle swarms. In: 2008 IEEE congress on evolutionary computation (CEC 2008), June 1-6, 2008. Hong Kong: Inst. of Elec. and Elec. Eng. Computer Society; 2008. p. 1063-67.
47. Y.S. Ong, and A.J. Keane Meta-Lamarckian learning in memetic algorithms IEEE Trans Evol Comput 8 2 2004 99 110
48. W.J. Xia, and Z.M. Wu A hybrid particle swarm optimization approach for the job-shop scheduling problem Int J Adv Manuf Technol 29 3-4 2006 360 366
49. K. Bulbul A hybrid Shifting Bottleneck-tabu search heuristic for the job shop total weighted tardiness problem Comput Oper Res 38 6 2011 967 983
50. L. Monch, and J. Zimmermann A computational study of a Shifting Bottleneck heuristic for multi-product complex job shops Prod Plann Control 22 1 2011 25 40
51. M. Rajkumar, P. Asokan, T. Page, and S. Arunachalam A GRASP algorithm for the Integration of Process Planning and Scheduling in a flexible job-shop Int J Manuf Res 2010 230 251
52. G. Minella, R. Ruiz, and M. Ciavotta A review and evaluation of multiobjective algorithms for the flowshop scheduling problem INFORMS J Comput 20 3 2008 451 471
53. T.K. Varadharajan, and C. Rajendran A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs Eur J Oper Res 167 3 2005 772 795 (Pubitemid 40220090)
54. J.E.C. Arroyo, and V.A. Armentano Genetic local search for multi-objective flowshop scheduling problems Eur J Oper Res 167 3 2005 717 738 (Pubitemid 40220087)
55. T. Pasupathy, C. Rajendran, and R.K. Suresh. A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs Int J Adv Manuf Technol 27 7-8 2006 804 815 (Pubitemid 43004635)
56. V.A. Armentano, and J.E.C. Arroyo An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem J Heuristics 10 5 2004 463 481
57. J. Knowles, and D.W. Corne. Approximating the nondominated front using the pareto archived evolution strategy Evol Comput 8 2 2000 149 172
58. Corne DW, Knowles JD, Oates MJ. The pareto envelope-based selection algorithm for multiobjective optimization. In: Schoenauer M, Deb K, Rudolph G, Yao X, Lutton E, Merelo Guervós Juan J, Schwefel HP, editors. Parallel problem solving from nature - PPSN VI, proceedings of the 6th international conference, Paris, France, September 18-20, 2000. Lecture notes in computer science, vol. 1917. Springer; 2000. p. 839-48.
59. Corne DW, Jerram Nick R, Knowles Joshua D, Oates Martin J. PESA-II: region-based selection in evolutionary multiobjective optimization. In: Spector L, Goodman ED, Wu A, Langdon WB, Voigt HM, Gen M, Sen S, Dorigo M, Pezeshk S, Garzon Max H, Burke E, editors. Proceedings of the genetic and evolutionary computation conference (GECCO-2001). San Francisco, CA: Morgan Kaufmann; 2001. p. 283-90.
60. K.C. Tan, C.K. Goh, Y.J. Yang, and T.H. Lee Evolving better population distribution and exploration in evolutionary multi-objective optimization Eur J Oper Res 171 2 2006 463 495 (Pubitemid 41706209)
61. J.G. Shanthikumar Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number tardy jobs Comput Oper Res 10 3 1983 255 266 (Pubitemid 13573937)
62. L.N. Van Wassenhove, and L.F. Gelders Solving a bicriterion scheduling problem Eur J Oper Res 4 1980 42 48
63. M.M. Koksalan, M. Azizoglu, and S.K. Kondakci Heuristics to minimize flowtime and maximum tardiness on a single machine. CMME working paper series 9 1996 Krannert School of Management, Purdue University
64. W.J. Selen, and D. Hott A mixed integer goal programming formulation of the standard flow shop scheduling problem J Oper Res Soc 37 12 1986 1121 1126
65. J.C. Ho, and Y.L. Chang A new heuristic for n-job, m-shop problem Eur J Oper Res 1991 194 202 52 1991 194 202
66. R.T. Nelson, R.K. Sarin, and R.L. Daniels Scheduling with multiple performances measures:the one machine case Manage Sci 2 1986 464 479
67. C. Rajendran Two-stage flowshop scheduling problem with bicriteria J Oper Res Soc 43 9 1992 871 884 (Pubitemid 23557910)
68. C. Rajendran Heuristic for scheduling in a flow shop with multiple objectives Eur J Oper Res 1995 540 555 82 1995 540 555
69. H. Hoogeven Single machine bicriteria scheduling 1992 University of Eindhoven Eindhoven
70. C.J. Liao, W.C. Yu, and C.B. Joe Bicriteria scheduling in the two machines flow shop J Oper Res Soc 1997 929 935 48 1997 929 935
71. M.J. Geiger On operators and search space topology in multi-objective flow shop scheduling Eur J Oper Res 181 1 2007 195 206 (2007)
72. J.M. Framinan, R. Leisten, and R. Ruiz-Usano Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation Eur J Oper Res 141 3 2002 559 569