The Hybrid Flow Shop
In this chapter we organize the literature on the hybrid flow shop scheduling problem that has appeared since the late 1950’s. We see a number of interesting and diverse industrial applications of this system, and find that the majority of research focuses on the makespan objective. Our coverage of results is exhaustive and categorized along concepts such as complexity, error-bound analyses, computational experiments and choice of objective. Several new results are included that have not appeared in the literature before. Surprisingly, existing research does not focus on the deterministic version of the problem alone, but also on the case of stochastic processing times.
KeywordsCompletion Time Idle Time Flow Shop Quay Crane Flow Shop Schedule Problem
Unable to display preview. Download preview PDF.
- 3.Buten, R.E. and V.Y. Shen (1973) A Scheduling Model for Computer Systems with Two Classes of Processors, Proceedings of the Sagamore Computer Conference on Parallel Processing, 130–138.Google Scholar
- 6.Chen, B. (1994) Scheduling Multiprocessor Flow Shops, New Advances in Optimization and Approximation, D.-Z. Du and J. Sun (Editors), Kluwer, Dordrecht, 1–8.Google Scholar
- 7.Chen, B. (1995) Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage, Journal of the Operational Research Society, 46, 234–244.Google Scholar
- 10.Graham, R.L. (1966) Bounds for Certain Multiprocessing Anomalies, Bell System Technical Journal, 45, 1563–1581.Google Scholar
- 13.Gupta, J.N.D. (1988) Two-Stage, Hybrid Flowshop Scheduling Problem, Journal of the Operational Research Society, 39, 359–364.Google Scholar
- 16.Hall, L.A. (1995) Approximability of Flow Shop Scheduling, Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamos, CA, 82–91.Google Scholar
- 18.Hoogeveen, J.A., J.K. Lenstra and B. Veltman (1996) Preemptive Scheduling in a Two-stage Multiprocessor Flow Shop is NP-hard, European Journal of Operational Research, 89, 172–175.Google Scholar
- 26.Salvador, M.S. (1973) A Solution to a Special Case of Flow Shop Scheduling Problems, Symposium of the Theory of Scheduling and Applications, edited by S.E. Elmaghraby, Springer-Verlag, New York, 83–91.Google Scholar
- 29.Sevast’janov, S.V. (1997) Nonstrict Vector Summation in the plane and its Applications to Scheduling Problems, Operations Research and Discrete Analysis, A.D. Korshunov (Editor), Kluwer, Dordrecht, 241–272.Google Scholar