Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage

This study deals with the two-stage hybrid flow shop (HFS) problem with precedence constraints. Two versions are examined, the classical HFS where idle time between the operations of the same job is allowed and the no-wait HFS where idle time is not permitted. For solving these problems an adaptive randomized list scheduling heuristic is proposed. Two global bounds are also introduced so as to conservatively estimate the distance to optimality of the proposed heuristic. The evaluation is done on a set of randomly generated instances. The heuristic solutions for the classical HFS in average are provably situated below 2% from the optimal ones, and on the other hand, in the case of the no-wait HFS the average deviation is below 5%. Highlights? We study the hybrid flow shop problem with precedence relations. ? An adaptive randomized list scheduling heuristic is proposed. ? Two global lower bounds are examined. ? Distance to the optimum, in average, is under 5% for randomly generated instances.

[1]  Chris N. Potts,et al.  Scheduling a two-stage hybrid flow shop with parallel machines at the first stage , 1997, Ann. Oper. Res..

[2]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[3]  Philippe Baptiste,et al.  Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems , 1999, Ann. Oper. Res..

[4]  Vitaly A. Strusevich.  Shop scheduling problems under precedence constraints , 1997, Ann. Oper. Res..

[5]  Alain Guinet,et al.  Reduction of job-shop problems to flow-shop problems with precedence constraints , 1998, Eur. J. Oper. Res..

[6]  Andrew W. Shogan,et al.  Semi-greedy heuristics: An empirical study , 1987 .

[7]  Hironori Kasahara,et al.  Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing , 1984, IEEE Transactions on Computers.

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Tomás Lang,et al.  Improving the Computation of Lower Bounds for Optimal Schedules , 1977, IBM J. Res. Dev..

[10]  Valerie Botta-Genoulaz,et al.  Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness , 2000 .

[11]  Frank D. Anger,et al.  Scheduling Precedence Graphs in Systems with Interprocessor Communication Times , 1989, SIAM J. Comput..

[12]  Jose M. Framiñan,et al.  Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective , 2010, Comput. Oper. Res..

[13]  Rubén Ruiz,et al.  Modeling realistic hybrid flexible flowshop scheduling problems , 2008, Comput. Oper. Res..

[14]  J. Erschler,et al.  Ordonnancement de tâches sous contraintes: une approche énergetique , 1992 .

[15]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[16]  Moshe Dror,et al.  Three stage generalized flowshop: Scheduling civil engineering projects , 1996, J. Glob. Optim..

[17]  J. Carlier.  The one-machine sequencing problem , 1982 .

[18]  Vitaly A. Strusevich,et al.  Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints , 2004, J. Comb. Optim..

[19]  V. Botta-Genoulaz.  Considering bills of material in hybrid flow shop scheduling problems , 1997, Proceedings of the 1997 IEEE International Symposium on Assembly and Task Planning (ISATP'97) - Towards Flexible and Agile Assembly and Manufacturing -.