Abstract
In scheduling problem with uncertainty, flexible preventive maintenance (PM) and multiple objectives are seldom investigated. In this study, interval job shop scheduling problem with non-resumable jobs and flexible maintenance is considered and an effective multi-objective artificial bee colony (MOABC) is proposed, in which an effective decoding procedure is used to build the schedule and handle PM operation. The objective is to minimize interval makespan and a newly defined objective called total interval tardiness. In each cycle, a dominance-based greedy principle is adopted, a dominance-based tournament is utilized to choose solution for onlooker bee, and the non-dominated ranking is applied to update the non-dominated set. A solution with the highest rank is replaced with a non-dominated solution every certain cycle. Computational results show the good performance of MOABC on the considered problem.
Similar content being viewed by others
References
Matsveichuk NM, Sotskov YN, Egorova NG, Lai T-C (2009) Schedule execution for two-machine flow-shop with interval processing time. Math Compu Model 49:991–1011
Lei DM (2011) Population-based neighborhood search for job shop scheduling with interval processing time. Comput Ind Eng 61:1200–1208
Lei DM (2012) Interval job shop scheduling problems. Int J Adv Manuf Technol 60:291–301
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 (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
Jin YL, Jiang ZH, Hou WR (2008) Multi-objective integrated optimization research on preventive maintenance and production scheduling for a single machine. Int J Adv Manuf Technol 39:954–964
Chen W-J (2009) Minimizing number of tardy jobs on a single machine subject to periodic maintenance. Omega 37:591–599
Liao C-J, Shyur D-L, Lin C-H (2005) Makespan minimization for two parallel machines with an availability constraint. Euro J Oper Res 160:445–456
Allaoui H, Lamouri S, Artiba A, Aghezzaf E (2008) Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan. Int J Prod Econ 112:161–167
Gao J, Gen M, Sun LY (2006) Scheduling jobs and maintenance in flexible job shop with a hybrid genetic algorithm. J Intell Manuf 17:493–507
Moradi E, Fatemi Ghomi SMT, Zandieh M (2011) Bi-objective optimization research on integrated fixed time interval preventive maintenance and production for scheduling flexible job-shop problem. Exp Sys Appl 38:7169–7178
González-Rodríguez I, Vela CR, Puente J (2010) A genetic solution based on lexicographical goal programming for a multiobjective job shop with uncertainty. J Intell Manuf 21:65–73
Adibi MA, Zandieh M, Amiri M (2010) Multi-objective scheduling of dynamic job shop using variable neighborhood search. Exp Sys Appl 37:282–287
Lei DM (2011) Simplified multi-objective genetic algorithm for stochastic job shop scheduling. Appl Soft Comput 11:4991–4996
Karaboga D (2005) An idea based on honeybee swarm for numerical optimization Technical Report TR06, Erciyes University, Engineering Faculty, Computer Engineering Department
Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214:108–132
Pan QK, Tasgetiren MF, Suganthan PN, Chua TJ (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inform Sci 181:2455–2468
Li JQ, Pan QK, Gao KZ (2011) Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problem. Int J Adv Manuf Technol 55:1159–1169
Moore RE (1979) Methods and applications of interval analysis. Prentice-Hall Inc., London
Hao PY (2009) Interval regression analysis using support vector networks. Fuzz Set Sys 160:2466–2485
Jiang C, Han X, Liu GR, Liu GP (2008) A nonlinear interval number programming method for uncertain optimization problems. Euro J Oper Res 188:1–13
Zheng YL, Li YX, Lei DM (2012) Multi-objective swarm-based neighborhood search for fuzzy flexible job shop scheduling. Int J Adv Manuf Technol 60:1063–1069
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
Lei, D. Multi-objective artificial bee colony for interval job shop scheduling with flexible maintenance. Int J Adv Manuf Technol 66, 1835–1843 (2013). https://doi.org/10.1007/s00170-012-4463-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-012-4463-y