Modelling and solving a practical flexible job-shop scheduling problem with blocking constraints

This paper presents a study of a practical job-shop scheduling problem modelled and solved when helping a company to design a new production workshop. The main characteristics of the problem are that some resources are flexible, and blocking constraints have to be taken into account. The problem and the motivation for solving it are detailed. The modelling of the problem and the proposed resolution approach, a genetic algorithm, are described. Numerical experiments using real data are presented and analysed. We also show how these results were used to support choices in the design of the workshop.

[1]  Felix T.S. Chan,et al.  Flexible job-shop scheduling problem under resource constraints , 2006 .

[2]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[3]  M.C. Gomes *,et al.  Optimal scheduling for flexible job shop operation , 2005 .

[4]  J. Grabowski,et al.  The permutation flow shop problem with blocking. A tabu search approach , 2007 .

[5]  Nidhal Rezg,et al.  Geometric approach and taboo search for scheduling flexible manufacturing systems , 2001, IEEE Trans. Robotics Autom..

[6]  Xiaolan Xie,et al.  The complexity of two-job shop problems with multi-purpose unrelated machines , 2004, Eur. J. Oper. Res..

[7]  Hoda A. ElMaraghy,et al.  Deadlock-free scheduling in flexible manufacturing systems using Petri nets , 2002 .

[8]  S. Akers.  Letter to the Editor—A Graphical Approach to Production Scheduling Problems , 1956 .

[9]  Jan Paulli,et al.  A hierarchical approach for the FMS scheduling problem , 1995 .

[10]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[11]  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..

[12]  Nidhal Rezg,et al.  A taboo search approach for deadlock-free scheduling of automated manufacturing systems , 2001, J. Intell. Manuf..

[13]  Tadeusz Sawik,et al.  Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers , 2000 .

[14]  Yahya Fathi,et al.  Abstract Discrete Optimization , 2000 .

[15]  Xianpeng Wang,et al.  A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers , 2009, Comput. Oper. Res..

[16]  M. Chen.  A heuristic for solving manufacturing process and equipment selection problems , 1999 .

[17]  Yazid Mati,et al.  A genetic-search-guided greedy algorithm for multi-resource shop scheduling with resource flexibility , 2008 .

[18]  Tapan P. Bagchi,et al.  Minimizing makespan in a blocking flowshop using genetic algorithms , 2001 .

[19]  Frank DiCesare,et al.  Scheduling flexible manufacturing systems using Petri nets and heuristic search , 1994, IEEE Trans. Robotics Autom..

[20]  Yazid Mati,et al.  Complexity of flowshop scheduling problems with a new blocking constraint , 2003, Eur. J. Oper. Res..

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

[22]  Feng Chu,et al.  Deadlock analysis of Petri nets using siphons and mathematical programming , 1997, IEEE Trans. Robotics Autom..

[23]  Stéphane Dauzère-Pérès,et al.  Multi-resource shop scheduling with resource flexibility , 1998, Eur. J. Oper. Res..

[24]  Tarek Y. ElMekkawy,et al.  A generic deadlock-free reactive scheduling approach , 2009 .

[25]  Tadeusz Sawik,et al.  Scheduling flexible flow lines with no in-process buffers , 1995 .

[26]  Débora P. Ronconi,et al.  A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking , 2005, Ann. Oper. Res..