Sequencing and scheduling for non serial permutation flowshops

Most flowshop problems that have been researched have dealt with serial precedence requirements such that the flowshop has become synonymous with the serial assembly line. However, non-serial precedence requirements can also occur for which the resulting problem is still a type of flowshop. This research addresses in particular, non-serial versions of the three standard flowshop problems, namely the intermediate storage, no-intermediate storage and no-wait flowshop scenarios. The outcomes of this research include a number of new and alternative mathematical formulations for finding the optimal sequence of the products to be processed through the non-serial line. Secondly recurrence equations for scheduling purposes have also been developed.

[1]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

[2]  Rakesh Nagi,et al.  A hybrid GA - SA algorithm for Just-in-Time scheduling of multi-level assemblies , 1996 .

[3]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[4]  Liping Cheng,et al.  A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems , 1993, Oper. Res. Lett..

[5]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[6]  Avraham Shtub,et al.  An analytic framework for sequencing mixed model assembly lines , 1992 .

[7]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[8]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[9]  Gündüz Ulusoy,et al.  A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis , 1996 .

[10]  Rakesh Nagi,et al.  Integrated lot-sizing and scheduling for just-in-time production of complex assemblies with finite set-ups , 1997 .

[11]  A Bolat,et al.  Stochastic procedures for scheduling minimum job sets on mixed model assembly lines , 1997 .

[12]  Rakesh Nagi,et al.  'Just-in-time' production of large assemblies , 1996 .

[13]  Yeong-Dae Kim,et al.  Simulated annealing and genetic algorithms for scheduling products with multi-level product structure , 1996, Comput. Oper. Res..

[14]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[15]  Daesik Hur,et al.  Mixed-model assembly line sequencing at Hyundai Motor Company , 1996 .

[16]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[17]  Hanan Luss,et al.  Final assembly sequencing for just-in-time manufacturing , 1989 .

[18]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[19]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[20]  Christos Koulamas,et al.  A new constructive heuristic for the flowshop scheduling problem , 1998, Eur. J. Oper. Res..

[21]  Robert T. Sumichrast,et al.  Evaluating mixed-model assembly line sequencing heuristics for just-in-time production systems , 1990 .

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

[23]  Ahmet Bolat,et al.  Algorithms for real-time scheduling of jobs on mixed model assembly lines , 1994, Comput. Oper. Res..

[24]  Liping Cheng,et al.  AN EFFECTIVE MIXED-MODEL ASSEMBLY LINE SEQUENCING HEURISTIC FOR JUST-IN-TIME PRODUCTION SYSTEMS , 1993 .

[25]  Roman Słowiński,et al.  Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems , 1990 .