An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time

Improved ABC algorithm is proposed for FJSP with fuzzy processing time.A heuristic, named MInEnd, is proposed to initialize population.New strategies are proposed to generate new solutions.The objectives are fuzzy maximum completion time and maximum machine workload.Benchmarks and realistic remanufacturing instances are solved by IABC. This study addresses flexible job-shop scheduling problem (FJSP) with fuzzy processing time. An improved artificial bee colony (IABC) algorithm is proposed for FJSP cases defined in existing literature and realistic instances in remanufacturing where the uncertainty of the processing time is modeled as fuzzy processing time. The objectives are to minimize the maximum fuzzy completion time and the maximum fuzzy machine workload, respectively. The goal is to make the scheduling algorithm as part of expert and intelligent scheduling system for remanufacturing decision support. A simple and effective heuristic rule is developed to initialize population. Extensive computational experiments are carried out using five benchmark cases and eight realistic instances in remanufacturing. The proposed heuristic rule is evaluated using five benchmark cases for minimizing the maximum fuzzy completion time and the maximum fuzzy machine workload objectives, respectively. IABC algorithm is compared to six meta-heuristics for maximum fuzzy completion time criterion. For maximum fuzzy machine workload, IABC algorithm is compared to six heuristics. The results and comparisons show that IABC algorithm can solve FJSP with fuzzy processing time effectively, both benchmark cases and real-life remanufacturing instances. For practical remanufacturing problem, the schedules by IABC algorithm can satisfy the requirement in real-life shop floor. The IABC algorithm can be as part of expert and intelligent scheduling system to supply decision support for remanufacturing scheduling and management.

[1]  Peter Brucker,et al.  Job-shop scheduling with multi-purpose machines , 1991, Computing.

[2]  Deming Lei,et al.  Fuzzy job shop scheduling problem with availability constraints , 2010, Comput. Ind. Eng..

[3]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..

[4]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[5]  Yunus Demir,et al.  An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations , 2014 .

[6]  Arit Thammano,et al.  A Hybrid Artificial Bee Colony Algorithm with Local Search for Flexible Job-shop Scheduling Problem , 2013, Complex Adaptive Systems.

[7]  Muris Lage Junior,et al.  Production planning and control for remanufacturing: literature review and analysis , 2012 .

[8]  Mostafa Zandieh,et al.  Flexible job-shop scheduling with parallel variable neighborhood search algorithm , 2010, Expert Syst. Appl..

[9]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives , 2016, J. Intell. Manuf..

[10]  Shengyao Wang,et al.  An effective estimation of distribution algorithm for the flexible job-shop scheduling problem with fuzzy processing time , 2013 .

[11]  Deming Lei,et al.  Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling , 2012, Appl. Soft Comput..

[12]  Dervis Karaboga,et al.  A comparative study of Artificial Bee Colony algorithm , 2009, Appl. Math. Comput..

[13]  Dervis Karaboga,et al.  A modified Artificial Bee Colony algorithm for real-parameter optimization , 2012, Inf. Sci..

[14]  Liang Gao,et al.  An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..

[15]  Quan-Ke Pan,et al.  Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling , 2014, Inf. Sci..

[16]  Quan-Ke Pan,et al.  A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion , 2015, Expert Syst. Appl..

[17]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[18]  Quan-Ke Pan,et al.  Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems , 2011 .

[19]  Mark Ferguson,et al.  The Value of Quality Grading in Remanufacturing , 2009 .

[20]  F. Pezzella,et al.  A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..

[21]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[22]  Deming Lei,et al.  A genetic algorithm for flexible job shop scheduling with fuzzy processing time , 2010 .

[23]  Tiranee Achalakul,et al.  Job Shop Scheduling with the Best-so-far ABC , 2012, Eng. Appl. Artif. Intell..

[24]  Rui Zhang,et al.  An Artificial Bee Colony Algorithm for the Job Shop Scheduling Problem with Random Processing Times , 2011, Entropy.

[25]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[26]  S. Karthikeyan,et al.  A hybrid discrete firefly algorithm for multi-objective flexible job shop scheduling problem with limited resource constraints , 2014, The International Journal of Advanced Manufacturing Technology.

[27]  E Mingcheng,et al.  Study on multi-objective flexible job-shop scheduling problem considering energy consumption , 2014 .

[28]  Jianbo Yu,et al.  An effective heuristic for flexible job-shop scheduling problem with maintenance activities , 2010, Comput. Ind. Eng..

[29]  Andrea Rossi,et al.  Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships , 2014 .