Parallel tabu search for the cyclic job shop scheduling problem

Abstract In this paper, we consider a cyclic job shop problem, consisting of production of a certain set of elements at fixed intervals. Optimization of the process is reduced to a minimization of a cycle time, i.e. the time, after which the next batch of the same elements may be produced. We introduce a new parallel method for the cost function calculation. The parallelization is not trivial and cannot be done automatically by the existing compilers due to the recurrent character of formulas. Since the problem is strongly NP-hard, a heuristic algorithm was designed to solve it. Computational experiments were done in a multiprocessor environment, namely – in Intel Xeon Phi.

[1]  M. Tahar Kechadi,et al.  Recurrent neural network approach for cyclic job shop scheduling problem , 2013, ArXiv.

[2]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[3]  Peter Brucker,et al.  Tabu Search Algorithms for Cyclic Machine Scheduling Problems , 2005, J. Sched..

[4]  Wojciech Bożejko,et al.  Cyclic flow shop scheduling problem with two-machine cells , 2017 .

[5]  Michael Pinedo,et al.  Planning and Scheduling in Manufacturing and Services , 2008 .

[6]  Hendrik Van Landeghem,et al.  The State of the Art of Nurse Rostering , 2004, J. Sched..

[7]  Uwe Fink,et al.  Planning And Scheduling In Manufacturing And Services , 2016 .

[8]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[9]  Wojciech Bozejko,et al.  Parallel tabu search algorithm for the hybrid flow shop problem , 2013, Comput. Ind. Eng..

[10]  Tae-Eog Lee,et al.  The complexity of cyclic shop scheduling problems , 2002 .

[11]  Wieslaw Kubiak,et al.  Solution of The Liu–Layland Problem Via Bottleneck Just-In-Time Sequencing , 2005, J. Sched..

[12]  Jaime Cerdá,et al.  State-of-the-art review of optimization methods for short-term scheduling of batch processes , 2006, Comput. Chem. Eng..

[13]  Adam Nadolski,et al.  Chromatic scheduling in a cyclic open shop , 2005, Eur. J. Oper. Res..

[14]  Wojciech Bozejko,et al.  A Neuro-tabu Search Algorithm for the Job Shop Problem , 2010, ICAISC.

[15]  Parviz Fattahi,et al.  A mathematical model and genetic algorithm to cyclic flexible job shop scheduling problem , 2015, J. Intell. Manuf..

[16]  Claire Hanen,et al.  Study of a NP-hard cyclic scheduling problem: The recurrent job-shop , 1994 .

[17]  Ilya Gertsbakh,et al.  Periodic transportation schedules with flexible departure times : An interactive approach based on the periodic event scheduling problem and the deficit function approach , 1991 .

[18]  Peter Brucker,et al.  A general model for cyclic machine scheduling problems , 2008, Discret. Appl. Math..

[19]  Thomas Kampmeyer,et al.  Cyclic Scheduling Problems , 2006 .

[20]  Manuel Laguna,et al.  Tabu Search , 1997 .

[21]  Mieczysław Wodecki,et al.  A Very Fast Tabu Search Algorithm for Job Shop Problem , 2005 .

[22]  Wojciech Bozejko,et al.  Parallel metaheuristics for the cyclic flow shop scheduling problem , 2016, Comput. Ind. Eng..

[23]  Wojciech Bozejko,et al.  Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem , 2016, ICAISC.

[24]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[25]  Augusto Q. Novais,et al.  Optimal design and retrofit of batch plants with a periodic mode of operation , 2005, Comput. Chem. Eng..

[26]  M. Dahleh.  Laboratory for Information and Decision Systems , 2005 .

[27]  Ouajdi Korbaa,et al.  Modeling and scheduling of ratio-driven FMS using unfolding time Petri nets , 2004, Comput. Ind. Eng..

[28]  Wojciech Boejko.  On single-walk parallelization of the job shop problem solving algorithms , 2012 .

[29]  Norbert Trautmann,et al.  A cyclic approach to large-scale short-term planning in chemical batch production , 2009, J. Sched..

[30]  Peter Brucker,et al.  Cyclic job shop scheduling problems with blocking , 2008, Ann. Oper. Res..

[31]  TAE-EOG LEE,et al.  Performance Measures and Schedules in Periodic Job Shops , 1997, Oper. Res..