Abstract
This paper considered fuzzy flexible job scheduling problems with makespan and maximum machine workload and proposed a multi-objective swarm-based neighborhood search (MOSNS). In MOSNS, ordered operation-based doublet string and three-dimension array are used to indicate the solution of two subproblems, two swaps and an insertion are applied to produce new solutions, simple weighted objective-based methods are used to update swarm and external archive to obtain a set of nondominated solutions. Some numerical experiments are conducted by using some instances and computational results show that MOSNS performs better than the existing methods from literature.
Similar content being viewed by others
References
Baykasoğlu A (2002) Linguistic-based meta-heuristic optimization model for flexible job shop scheduling. Int J Prod Res 40:4523–4543
Kacem I, Hammadi S, Borne P (2002) Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math Comput Simul 60:245–276
Kacem I, Hammadi S, Borne P (2002) Approach by localization and multi-objective evolutionary optimization for flexible job shop scheduling problems. IEEE Trans Syst Man Cybern C 32:1–13
Xia W, Wu Z (2005) An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 48:409–425
Gao J, Gen M, Sun LY, Zhao X (2007) A hybrid of genetic algorithm and bottleneck shifting for multi-objective flexible job shop scheduling problems. Comput Ind Eng 53:149–162
Gao J, Sun LY, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35:2892–2907
Loukil T, Teghem J, Fortemps P (2007) A multi-objective production scheduling case study solved by simulated annealing. Eur J Oper Res 179:709–722
Tay JC, Ho NB (2008) Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput Ind Eng 54:453–473
Zhang GH, Shao XY, Li PG, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput Ind Eng 56:1309–1318
Liu HB, Abraham A, Wang ZW (2009) A multi-swarm approach to multi-objective flexible job-shop scheduling problems. Fundam Inform 95:465–489
Li JQ, Pan QK, Liang YC (2010) An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 59:647–662
Moslehi G, Mahnam M (2011) A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. Int J Prod Econ 129:14–22
Sakawa M, Mori T (1999) An efficient genetic algorithm for job shop scheduling problems with fuzzy processing time and fuzzy due date. Comput Ind Eng 36:325–341
Sakawa M, Kubota R (2000) Fuzzy programming for multi-objective job shop scheduling with fuzzy processing time and fuzzy due date through genetic algorithm. Eur J Oper Res 120:393–407
Lei DM (2008) Pareto archive particle swarm optimization for multi-objective fuzzy job shop scheduling problems. Int J Adv Manuf Technol 37:157–165
González-Rodríguez I, Vela CR, Puente J (2010) A genetic solution based on lexicographical goal programming for a multi-objective job shop with uncertainty. J Intell Manuf 21:65–73
Hu YM, Yin MH, Li XT (2011) A novel objective function for job-shop scheduling problem with fuzzy processing time and fuzzy due date using differential evolution algorithm. Int J Adv Manuf Technol. doi:10.1007/s00170-011-3244-3
Lei DM (2010) Fuzzy job shop scheduling problem with availability constraints. Comput Ind Eng 58:610–617
Lei DM (2011) Scheduling fuzzy job shop with preventive maintenance through swarm-based neighborhood search. Int J Adv Manuf Technol 54:1121–1128
Lei DM, Guo XP (2008) Solving fuzzy flexible job shop scheduling problems using genetic algorithm. Proc Int Conf Mach Learn Cyber 2:1014–1019
Lei DM (2010) A genetic algorithm for flexible job shop scheduling with fuzzy processing time. Int J Prod Res 48(10):2995–3013
Thomalla CS (2001) Job shop scheduling with alternative process plans. Int J Prod Econ 74:125–134
Brandimarte P (1999) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41:157–183
Zitzler E, Thiele L (1999) Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3:257–271
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zheng, Yl., Li, Yx. & Lei, Dm. Multi-objective swarm-based neighborhood search for fuzzy flexible job shop scheduling. Int J Adv Manuf Technol 60, 1063–1069 (2012). https://doi.org/10.1007/s00170-011-3646-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-011-3646-2