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

Authors:
Sergiu Carpov;Jacques Carlier;Dritan Nace;Renaud Sirdey
Affiliations:
CEA, LIST, Embedded Real Time Systems Laboratory, Point Courrier 94, 91191 Gif-sur-Yvette Cedex, France and UMR CNRS 6599 Heudiasyc, Université de Technologie de Compiègne, Centre de rec ...;UMR CNRS 6599 Heudiasyc, Université de Technologie de Compiègne, Centre de recherches de Royallieu, BP 20529, 60205 Compiègne Cedex, France;UMR CNRS 6599 Heudiasyc, Université de Technologie de Compiègne, Centre de recherches de Royallieu, BP 20529, 60205 Compiègne Cedex, France;CEA, LIST, Embedded Real Time Systems Laboratory, Point Courrier 94, 91191 Gif-sur-Yvette Cedex, France
Venue:
Computers and Operations Research
Year:
2012

Citing 7
Cited 3

Scheduling precedence graphs in systems with interprocessor communication times

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Modeling realistic hybrid flexible flowshop scheduling problems

Computers and Operations Research
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing

IEEE Transactions on Computers
Improving the computation of lower bounds for optimal schedules

IBM Journal of Research and Development
Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Computers and Operations Research
Semi-greedy heuristics: An empirical study

Operations Research Letters

A heuristic method for two-stage hybrid flow shop with dedicated machines

Computers and Operations Research
A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem

Computers and Operations Research
Dynamic Drum-Buffer-Rope approach for production planning and control in capacitated flow-shop manufacturing systems

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

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%.