A hybrid Pareto-based local search algorithm for multi-objective flexible job shop scheduling problems

International Journal of Production Research

Volumn 50, Issue 4, 2012, Pages 1063-1078

  Li, Jun Qing ^a   Pan, Quan Ke ^a,b   Chen, Jing ^a  

^a LIAOCHENG UNIVERSITY   (China)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

flexible job shop scheduling problem; local search; multi objective optimisation; Pareto archive set; variable neighbourhood search

Indexed keywords

COMPLETION TIME; CRITICAL MACHINE; FAST CONVERGENCE; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; HYBRID ALGORITHMS; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MAKESPAN; MULTI OBJECTIVE; NONDOMINATED SOLUTIONS; PARETO ARCHIVE; PARETO ARCHIVE SETS; SEARCH QUALITY; SELF-ADAPTIVE STRATEGY; SPEED-UP METHOD; VARIABLE NEIGHBOURHOOD SEARCH;

IMAGE RETRIEVAL; MACHINE SHOPS; MULTIOBJECTIVE OPTIMIZATION; SCHEDULING ALGORITHMS;

PARETO PRINCIPLE;

EID: 84860470398     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2011.555427     Document Type: Article

References (41)

1. Bagheri., A., et al. 2010. An artificial immune algorithm for the flexible job-shop scheduling problem. Future Generation Computer Systems 26 533-541
2. Balas, E. and Vazacopoulos, A., 1998. Guided local search with shifting bottleneck for job shop scheduling. Management Science, 44, 262-275. (Pubitemid 128596865)
3. Bruker, P. and Schlie, R., 1990. Job-shop scheduling with multi-purpose machines. Computing, 45, 369-375.
4. Brandimarte, P., 1993. Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 22, 158-183.
5. Dauzere-Peres, S. and Paulli, J., 1997. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Annals of Operations Research, 70, 281-306.
6. Deb, K., et al., 2002. A fast and elitist multiobjective genetic algorithm: NSGA-α;. IEEE Transactions on Evolutionary Computation, 6, 182-197. (Pubitemid 34555372)
7. Ennigrou, M. and Ghedira, K., 2008. New local diversification techniques for flexible job shop scheduling problem with a multiagent approach. Autonomous Agents and Multi-Agent Systems, 17, 270-287.
8. Gagné, C., Gravel, M., and Price, W.L., 2005. Using metaheuristic compromise programming for the solution of multipleobjective scheduling problems. Journal of the Operations Research Society, 56, 687-698. (Pubitemid 40703469)
9. Gao, L., et al., 2006, Solving flexible job shop scheduling problem using general particle swarm optimisation. Proceedings of the 36th CIE conference on computers and industrial engineering, 20-23 June 2006, Taipei, Taiwan, IEEE Computer Society Press, 3018-3027.
10. Garey, M.R., Johnson, D.S., and Sethi, R., 1996. The complexity of flowshop and job shop scheduling. Mathematics of Operations Research, 1, 117-129.
11. Geiger, M.J., 2004. Randomised variable neighbourhood search for multi objective optimisation. Proceedings of EU/ME workshop: Design and evaluation of advanced hybrid meta-heuristics, 4-5 November 2004, Nottingham, UK, University of Nottingham, 34-42.
12. Ho, N.B., Tay, J.C., and Lai, E.M.K., 2007. An effective architecture for learning and evolving flexible job-shop schedules. European Journal of Operational Research, 179, 316-333. (Pubitemid 44821629)
13. Ho, N.B. and Tay, J.C., 2008. Solving multiple-objective flexible job shop problems by evolution and local search. IEEE Transactions on Systems Man and Cybernetics. Part C, 38, 674-685.
14. Hurink, E., Jurisch, B., and Thole, M., 1994. Tabu search for the job shop scheduling problem with multi-purpose machines. Operations Research Spektrum, 15, 205-215.
15. Kacem, I., Hammadi, S., and Borne, P., 2002a. Pareto-optimality approach for flexible job-shop scheduling problems: hybridisation of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation, 60, 245-276.
16. Kacem, I., Hammadi, S., and Borne, P., 2002b. Approach by localisation and multi-objective evolutionary optimisation for flexible job-shop scheduling problems. IEEE Transactions on Systems Man and Cybernetics, Part C, 32, 408-419.
17. Lei, D.M., 2010. A genetic algorithm for flexible job shop scheduling with fuzzy processing time. International Journal of Production Research, 48, 2995-3013.
18. Li, J.Q., Pan, Q.K., and Liang, Y.C., 2010. An effective hybrid tabu search algorithm for multi-objective flexible job shop scheduling problems. Computers & Industrial Engineering, 59, 647-662.
19. Li, J.Q., et al., 2011. A hybrid tabu search algorithm with an efficient neighbourhood structure for the flexible job shop scheduling problem. International Journal of Advanced Manufacturing Technology, 52, 683-697.
20. Pan, Q.K., Wang, L., and Qian, B., 2009. A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. Computers & Operations Research, 36, 2498-2511.
21. Pan, Q.K., et al., 2011a. A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information Sciences, 181, 2455-2468.
22. Pan, Q.K., et al., 2011b. A differential evolution algorithm with self-adapting strategy and control parameters. Computers & Operations Research, 38, 394-408.
23. Pezzella, F., Morganti, G., and Ciaschetti, G., 2008. A genetic algorithm for the flexible job-shop scheduling problem. Computers & Operations Research, 35, 3202-3212. (Pubitemid 351335142)
24. Mastrolilli, M. and Gambardella, L.M., 2000. Effective neighbourhood functions for the flexible job shop problem. Journal of Scheduling, 3, 3-20.
25. Mati, Y. and Xie, X., 2004. The complexity of two-job shop problems with multi-purpose unrelated machines. European Journal of Operational Research, 152, 159-169.
26. Mladenovic, N. and Hansen, P., 1997. Variable neighbourhood search. Computers & Operations Research, 24, 1097-1100.
27. Moon, I., Lee, S., and Bae, H., 2008. Genetic algorithms for job shop scheduling problems with alternative routings. International Journal of Production Research, 46, 2695-2705. (Pubitemid 351394248)
28. Naverniouk, I., 2005. Multi-objective graph clustering with variable neighbourhood descent. Thesis (Masters), Faculty of Graduate Studies, Computer Science, University of British Columbia.
29. Rajkumara, M., et al., 2011. A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints. International Journal of Production Research, 49, 2409-2423.
30. Roshanaei, V., et al., 2009. A variable neighbourhood search for job shop scheduling with setup times to minimise makespan. Future Generation Computer Systems, 25, 654-661.
31. Saidi-mehrabad, M and Fattahi, P., 2007. Flexible job shop scheduling with tabu search algorithms. International Journal of Advanced Manufacturing Technology, 32, 563-570. (Pubitemid 46375270)
32. Stummer, C. and Sun, M., 2005. New multi-objective metaheuristic solution procedures for capital investment planning. Journal of Heuristics, 11, 183-199. (Pubitemid 41271345)
33. Xia, W.J. and Wu, Z.M., 2005. An effective hybrid optimisation approach for multi-objective flexible job-shop scheduling problems. Computers & Industrial Engineering, 48, 409-425.
34. Xing, L.N., Chen, Y.W., and Yang, K.W., 2009a. Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling. Applied Soft Computing, 9, 362-376.
35. Xing, L.N., Chen, Y.W., and Yang, K.W., 2009b. An efficient search method for multi-objective flexible job shop scheduling problems. Journal of Intelligent Manufacturing, 20, 283-293.
36. Xing, L.N., et al., 2010. A knowledge-based ant colony optimisation for flexible job shop scheduling problems. Applied Soft Computing, 10, 888-896.
37. Yazdani, M., Amiri, M., and Zandieh, M., 2010. Flexible job-shop scheduling with parallel variable neighbourhood search algorithm. Expert Systems with Applications, 37, 678-687.
38. Zandieh, M. and Adibi, M.A., 2010. Dynamic job shop scheduling using variable neighbourhood search. International Journal of Production Research, 48, 2449-2458.
39. Zhang, C.Y., et al., 2007. A tabu search algorithm with a new neighbourhood structure for the job shop scheduling problem. Computers & Operations Research, 34, 3229-3242.
40. Zhang, G.H., et al., 2009. An effective hybrid swarm optimisation algorithm for multi-objective flexible job-shop scheduling problem. Computers & Industrial Engineering, 56, 1309-1318.
41. Zhou, R., Nee, A.Y.C., and Lee, H.P., 2009. Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems. International Journal of Production Research, 47, 2903-2920.