A novel multi-objective particle swarm optimization algorithm for no-wait flow shop scheduling problems

Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture

Volumn 222, Issue 4, 2008, Pages 519-539

  Pan, Q K ^a   Wang, L ^b   Qian, B ^b  

^a LIAOCHENG UNIVERSITY   (China)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Insert neighbourhood; Local search; Multi objective; No wait flow shop; Particle swarm optimization; Speed up

Indexed keywords

ALGORITHMS; BENCHMARKING; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; LEARNING ALGORITHMS; MACHINE SHOP PRACTICE; MACHINE SHOPS; MATHEMATICAL TRANSFORMATIONS; MULTIOBJECTIVE OPTIMIZATION; OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO); POPULATION STATISTICS; SCHEDULING; SCHEDULING ALGORITHMS; SOLUTIONS; SPEED;

COMPUTATIONAL SIMULATIONS; CONVERGENCE PROCESSES; DISCRETE DOMAINS; DIVERSITY LEVEL; GLOBAL EXPLORATION; HYBRID DIFFERENTIAL EVOLUTION; INSERT NEIGHBOURHOOD; JOB PERMUTATION; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MAKESPAN; MAXIMUM TARDINESS; MULTI OBJECTIVES; MULTI-OBJECTIVE; MULTI-OBJECTIVE PARTICLE SWARM OPTIMIZATION; NEIGHBOURHOOD; NO WAIT FLOW SHOPS; NO-WAIT FLOW SHOP; NON-DOMINATED SOLUTIONS; PARETO FRONTS; PARTICLE SWARM OPTIMIZATION; SEARCHING DIRECTION; SPEED UPS; SPEED-UP; STATISTICAL PERFORMANCES;

GLOBAL OPTIMIZATION;

EID: 45949097471     PISSN: 09544054     EISSN: None     Source Type: Journal    
DOI: 10.1243/09544054JEM989     Document Type: Article

References (59)

1. Pinedo, M. Scheduling: theory, algorithms and systems, 2002, (Prentice-Hall, New Jersey).
2. Wang, L. and Zheng, D. Z. An effective hybrid heuristic for flow shop scheduling. Int. J. Advd Mfg Technol., 2003, 21, 38-44.
3. Daniels, R. L. and Chambers, R. J. Multiobjeetive flowshop scheduling. Nov. Res. Logist., 1990, 37, 981-995.
4. Rajendran, C. Two-stage flowshop scheduling problem with bicriteria. J. Opl. Res. Soc., 1992, 43(9), 871-884.
5. Ravindran, D., Noorul, Haq, A., Selvkuar, S. J., and Sivaraman, R. Flow shop scheduling with multiple objective of minimizing makespan and total flow time. Int. J. Advd Mfg Technol., 2005, 25, 1007-1012.
6. Toktas, B., Azizoglu, M., and Koksalan, S. K. Two-machine flow shop scheduling with two criteria: maximum earliness and makespan. Eur. J. Opl. Res., 2004, 157, 286-295.
7. T'Kindt, V., Monmarche, N., Tercinet, F., and Laügt, D. An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. Eur. J. Opl. Res., 2002, 142, 250-257.
8. Loukil, T., Teghem, J., and Tuyttens, D. Solving multi-objective production scheduling problems using meta-heuristics.. Eur. J. Opl. Res., 2005, 161, 42-61.
9. Rahimi-Vahed, R. A. and Mirghorbani, S. M. A multi-objective particle swarm for a flow shop scheduling problem. J. Comb. optimization, 2007, 13, 79-102.
10. Tavakkoli-Moghaddam, R., Rahimi-Vahed, A., and Mirzaei, A. H. Solving a bi-criteria flow shop problem using immune algorithm. In Proceedings of the First IEEE Symposium on Comput. Intelligence. Honolulu, Hawaii, 2007, Vol. 1, pp. 49-56.
11. Ponnambalam, S. G., Jagannathan, H., Kataria, M., and Gadicherla, A. A TSP-GA multi-objective algorithm for flow-shop scheduling. Int. J. Advd Mfg Technol., 2004, 23(11), 909-915.
12. Murata, T., Ishibuchi, H., and Tanaka, H. Multiobjective genetic algorithm and its applications to flowshop scheduling. Comput. Ind. Engng, 1996, 30(4), 957-968.
13. Ishibuchi, H. and Murata, T. A multi-objective genetic local search algorithm and its applications to flowshop scheduling. IEEE Trans. Syst. Man, Cybernetics, C Appl. Rev., 1998, 28(3), 392-403.
14. Ishibuchi, H., Yoshida, I., and Murata, T. Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans. Evolutionary Comput., 2003, 7 (2), 204-223.
15. Arroyo, J. E. C. and Armentano, V. A. Genetic local search for multi-objective flowshop scheduling problems. Eur.J. Opl Res., 2005, 167, 717-738.
16. Li, B. B. and Wang, L. A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling. IEEE Trans System Man Cybernetics B, Cybernetics, 2007, 37, 576-591.
17. Qian, B., Wang, L., Rong, H., Wang, W. L., Huang, D. X., and Wang, X. A hybrid differential evolution for permutation flow-shop scheduling. Int. J. Advd Mfg Technol., 2007.
18. T'Kindt, V. and Billaut, J. C. Multicriteria scheduling: theory, models and algorithms, 2002, (Springer-Verlag-Berlin).
19. Rajendran, C. A no-wait flowshop scheduling heuristic to minimize makespan. J. Opl Res. Soc., 1994, 45, 472-478.
20. Hall, N. G. and Sriskandarayah, C. A survey of machine scheduling problems with blocking and no-wait in process. Opl Res., 1996, 44, 510-525.
21. Grabowski, J. and Pempera, J. Sequencing of jobs in some production system. Eur. J. Opl Res., 2003, 125, 535-550.
22. Raaymakers, W. and Hoogeveen, J. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. Eur. J. Opl Res., 2000, 126, 131-51.
23. Rock, H. The three-machine no-wait flowshop problem is NP-complete. J. Assoc. Comput. Mach., 1984, 31, 336-345.
24. Bonney, M. C. and Gundry, S. W. Solutions to the constrained flowshop sequencing problem. Opl Res. Q., 1976, 24, 869-883.
25. King, J. R. and Spachis, A. S. Heuristics for flowshop scheduling. Int. J. Prod. Res., 1980, 18, 343-357.
26. Gangadharan, R. and Rajedran, C. Heuristic algorithms for scheduling in no-wait flowshop. Int. J. Prod. Econ., 1993, 32, 285-290.
27. Rajendran, C. A no-wait flowshop scheduling heuristic to minimize makespan. J. Opl Res. Soc., 1994, 45, 472-478.
28. Rajendran, C. and Chaudhuri, D. Heuristic algorithms for continuous flow-shop problem. Nav. Res. Logistics, 1990, 37, 695-705.
29. Aldowaisan, T. and Allahverdi, A. A new heuristics for no-wait flowshops to minimize makespan. Comput. Opl Res., 2003, 30, 1219-1231.
30. Fink, A. and Voß, S. Solving the continuous flow-shop scheduling problem by metaheuristics. Eur. J. Opl Res., 2003, 151, 400-414.
31. Schuster, C. J. and Framinan, J. M. Approximative procedure for no-wait job shop scheduling. Opl Res. Lett., 2003, 31, 308-318.
32. Grabowski, J. and Pempera, J. Some local search algorithms for no-wait flow-shop problem with makespan criterion. Comput. Opl Res., 2005, 32, 2197-2212.
33. Pan, Q. K., Wang, L., and Zhao, B. H. An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion. Int. J. Advd Mfg Technol., 2007.
34. Liu, B., Wang, L., and Jin, Y. H. An effective hybrid particle swarm optimization for no-wait flow shop scheduling. Int. J. Advd Mfg Technol., 2007, 31, 1001-1011.
35. Pan, Q. K., Tasgetiren, M. F., and Liang, Y. C. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput. Ops Res., 2006.
36. Pan, Q. K., Wang, L., Tasgetirend, M. F., and Zhao, B. H. A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion. Int. J. Advd Mfg Technol., 2007.
37. Tavakkoli-Moghaddam, R., Rahimi-Vahed, A., and Mirzaei, A. H. A hybrid multi-objective immune algorithm for a flow shop scheduling problem with biobjectives: weighted mean completion time and weighted mean tardiness. Inf. Sci., 2007, 177(22), 5072-5090.
38. Spieksma, F, C. R. and Woeginger, G. J. The no-wait flow-shop paradox. Ops Res. Letts., 2005, 33(6), 603-608.
39. Kalczynski, P. J. and Kamburowski, J. On no-wait and no-idle flow shops with makespan criterion. Eur. J. Opl Res., 2007, 178, 677-685.
40. Hall, N. G. and Sriskandarayah, C. A survey of machine scheduling problems with blocking and no-wait in process. Opl Res., 1996, 44, 510-525.
41. Eberhart, R. C. and Kennedy, J. A new optimizer using particle swarm theory. Proceedings of the sixth international Symposium on Micro Mach. Human Sci. Nagoya, Japan, 1995, pp. 39-43.
42. Kennedy, J., Eberhart, R. C., and Shi, Y. Swarm intelligence, 2001, (Morgan Kaufmann, San Mateo, CA, USA).
43. Liu, D. S., Tan, K. C., Goh, C. K., and Ho, W. K. A multi-objective memetic algorithm based on particle swarm optimization. IEEE Trans Syst., Man and Cybernetics: Part B (Cybernetics), 2007, 37(1), 42-50.
44. Salman, A., Ahmad, I., and Al-Madani, S. Particle swarm optimization for task assignment problem. Microprocessors and Microsystems, 2003, 26, 363-371.
45. Tasgetiren, M. F. and Liang, Y. C. A binary particle swarm optimization algorithm for lot sizing problem. J. Econ. Soc. Res., 2003, 5, 1-20.
46. He, Q. and Wang, L. A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl. Math. Computer, 2007, 186, 1407-1422.
47. Liu, B., Wang, L., and Jin, Y. H. An effective pso-based memetic algorithm for flow shop scheduling. IEEE Trans Syst. Man and Cybernetics, B, Cybernetics, 2007, 37, 18-27.
48. Tasgetiren, M. F., Liang, Y. C., Sevkli, M., and Geneyilmaz, G. Particle swarm optimization algorithm for makespan and total flowtime minimization in permutation flowshop sequencing problem. Eur, J. Opl Res., 2007, 177, 1930-1947.
49. Onwubolu, G. C. and Clerc, M. Optimal operating path for automated drilling operations by a new heuristic approach using particle swarm optimization. Int. J. Prod. Res., 2004, 42(3), 473-491.
50. Lian, Z., Gu, X., and Jiao, B. A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Appl. Math. Comput., 2006, 183, 1008-1017.
51. Landa Silva, J. D., Burke, E. K., and Petrovic, S. An introduction to multobjective metaheuristics for scheduling and timetabling. Lecture Notes Econ. Math Syst., 2004, 535, 91-129.
52. Nawaz, M., Enscore, E. E. J., and Ham, I. A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA, 1983, 11, 91-95.
53. Tommaso, S. and Thomas, S. A review of metrics on permutations for search landscape analysis. Comput. Opl Res., 2007, 34(10), 3143-3153.
54. Knowles, J. D. and Corne, D. W. On metrics for comparing nondominated sets. In Proceedings of 2002 Congress on Evolutionary Computation. Honolulu, HI 12-17 May 2002, pp. 711-716.
55. Carlier, J. Ordonnancements a contraintes disjonctives. RAIRO Recherche Operationelle, 1978, 12, 333-351.
56. Reeves, C. A genetic algorithm for flowshop sequencing. Comput. Opl Res., 1995, 22, 5-13.
57. Heller, J. Some numerical experiments for an M × J flow shop and its decision-theoretical aspects. Opl Res., 1960, 8, 178-184.
58. Zitzler, E. and Thiele, L. Multiobjective evolutionary algorithms: a comparison case study and the strength pareto approach. IEEE Trans Evolutionary Comput., 1999, 3 (4), 257-271.
59. Knowles, J. D. and Corne, D. W. Approximating the nondominated front using the Pareto archive evolution strategy. Evolutionary Comput., 2002, 8(2), 149-217.