Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion

Abstract This study investigates the flexible job shop scheduling problem (FJSP) with new job insertion. FJSP with new job insertion includes two phases: initializing schedules and rescheduling after each new job insertion. Initializing schedules is the standard FJSP problem while rescheduling is an FJSP with different job start time and different machine start time. The time to do rescheduling is the same as the time of new job insertion. Four ensembles of heuristics are proposed for scheduling FJSP with new job insertion. The objectives are to minimize maximum completion time (makespan), to minimize the average of earliness and tardiness (E/T), to minimize maximum machine workload (Mworkload) and total machine workload (Tworkload). Extensive computational experiments are carried out on eight real instances from remanufacturing enterprise. The results and comparisons show the effectiveness of the proposed heuristics for solving FJSP with new job insertion.

[1]  Min Liu,et al.  A hybrid artificial bee colony algorithm for the fuzzy flexible job-shop scheduling problem , 2013 .

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

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

[4]  Gema Calleja,et al.  A dispatching algorithm for flexible job-shop scheduling with transfer batches: an industrial application , 2014 .

[5]  Ling Wang,et al.  A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem , 2013 .

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

[7]  G. Vilcot,et al.  A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem , 2011 .

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

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

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

[11]  P. Suganthan,et al.  A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem , 2011 .

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

[13]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

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

[15]  Quan-Ke Pan,et al.  An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems , 2010, Comput. Ind. Eng..

[16]  Jian Xiong,et al.  Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns , 2013 .

[17]  V. Guide.  Production planning and control for remanufacturing: industry practice and research needs , 2000 .

[18]  M. Mousakhani,et al.  Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness , 2013 .

[19]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[20]  Yong Ming Wang,et al.  A novel genetic algorithm for flexible job shop scheduling problems with machine disruptions , 2013, The International Journal of Advanced Manufacturing Technology.

[21]  Hua Xu,et al.  An integrated search heuristic for large-scale flexible job shop scheduling problems , 2013, Comput. Oper. Res..

[22]  Tarek Y. ElMekkawy,et al.  Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm , 2011 .

[23]  Shengyao Wang,et al.  An effective artificial bee colony algorithm for the flexible job-shop scheduling problem , 2012 .