Critical Path Method for Lot Streaming Problem in Flexible Job Shop Environment

This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique that has been used widely to reduce completion time of a production system. Due to the complexity of the problem; exact optimization techniques such as branch and bound algorithm will lose their efficiency at medium and large dimensions. Thus, metaheuristic techniques are good options in order to obtain high quality solutions within a reasonable computational time. In this study, firstly, the considered problems are solved in both permitted and not permitted of lot streaming by means of memetic algorithm and then the obtained solutions will be improved by using the critical path method heuristic. The numerical results indicate the high efficiency of the memetic algorithm in comparison with the previous methods; in addition, adding preemption and using allowable idle machines have led to a considerable improvement in the objective function. doi: 10.5829/idosi.ije.2017.30.02b.13

[1]  Ramón Alvarez-Valdés,et al.  A heuristic to schedule flexible job-shop in a glass factory , 2005, Eur. J. Oper. Res..

[2]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[3]  Xin Wang,et al.  A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions , 2009, Discret. Optim..

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

[5]  S. C. Liu.  A heuristic method for discrete lot streaming with variable sublots in a flow shop , 2003 .

[6]  Jamal Arkat,et al.  Flexible job shop scheduling with overlapping in operations , 2009 .

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

[8]  Francis Sourd,et al.  A new model for the preemptive earliness-tardiness scheduling problem , 2009, Comput. Oper. Res..

[9]  Jin-Kao Hao,et al.  A tabu search based memetic algorithm for the max-mean dispersion problem , 2016, Comput. Oper. Res..

[10]  D. Gong,et al.  An improved NSGA-II algorithm for multi-objective lot-streaming flow shop scheduling problem , 2014 .

[11]  M. Jabbari,et al.  Lot Streaming in No-wait Multi Product Flowshop Considering Sequence Dependent Setup Times and Position Based Learning Factors , 2015 .

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

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

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

[15]  Mohammad Saidi-Mehrabad,et al.  Flexible job shop scheduling with tabu search algorithms , 2007 .

[16]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .

[17]  Rahime Sancar Edis,et al.  A tabu search-based heuristic for single-product lot streaming problems in flow shops , 2008 .

[18]  Mohammad Fathian,et al.  A new critical path method and a memetic algorithm for flexible job shop scheduling with overlapping operations , 2013, Simul..

[19]  W. Yeh.  A Memetic Algorithm for the n/2/Flowshop/αF + βCmax Scheduling Problem , 2002 .

[20]  Francis Sourd,et al.  The one-machine just-in-time scheduling problem with preemption , 2009, Discret. Optim..

[21]  Quan-Ke Pan,et al.  Evolutionary multi-objective blocking lot-streaming flow shop scheduling with interval processing time , 2016, Appl. Soft Comput..

[22]  Ferda Can Çetinkaya,et al.  Lot streaming in a two-machine mixed shop , 2010 .

[23]  Luca Maria Gambardella,et al.  Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .

[24]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[25]  Minghao Yin,et al.  A novel objective function for job-shop scheduling problem with fuzzy processing time and fuzzy due date using differential evolution algorithm , 2011 .

[26]  I. Mahdavi,et al.  SOLVING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM BY A GENETIC ALGORITHM , 2008 .