Abstract
The general flow — shop problem indicated by n|m|F|Cmax, can be formulated as follows. Each of n jobs J,…,Jn has to be processed on m machines M1,…,Mm in that order. Job Jj, j=1,…,n, thus consists of a sequence of m operations oj1..,,…,0. jm0jk corresponds to the processing of Jj on Mk during a processing time Pjk We want to find a processing order on each machine Mk such that the time required to complete all jobs is minimized. If the processing order is assumed to be the same on each machine, the resulting problem is called the permutation flow — shop problem, and indicated by n|m|F|Cmax.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A.P.G. Brown and Z.A. Lomnicki, “Some Applications of the Branch-and-Bound Algorithm to the Machine Scheduling Problem”, Opl. Res. Quart. 17, 173–186 (1966).
J. Grabowski, “On two-machine scheduling with release and due dates to minimize maximum lateness”, Opsearch 17, No. 4, 133–154 C 1980).
S. Johnson, “Optimal Two-and-Three-Stage Production Scheduls with Setup Times Included”, Naval Res. Logist. Quart. 61–68 CI 1954).
J.R. Jackson, “Scheduling a Production Line to Minimize Maximum Tardines”, Research Report 43, Management Science Research Project, University of California, Los Angeles, 1955.
B.J. Lageweg, J.K. Lenstra, and A.H.G. Rinnooy Kan, “Minimizing Maximum Lateness on One Machine: Computational Experience and Some Applications”, Statistics Neerlandica 30, 24–41 (1976).
B.J. Lageweg, J.K. Lenstra, and A.H.G. Rinnooy Kan, “A General Bounding Scheme for the Permutation Plow-Shop Problem”, Opns. Res. 26, 53–67 (1978).
J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker, “Complexity of Machine Scheduling Problems”, Ann. Discrete Math. 1, 343–362 (1977).
A.H.G. Rinnooy Kan, “Machine Scheduling Problems: Classification, Complexity and Computations”, Nijhoff, The Hague (1976).
W. Szwarc, “Johnson’s Approximate Method for the 3xn Job Shop Problem”, Naval Res. Logist. Quart. 24, 153–157 (1977).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 D. Reidel Publishing Company
About this chapter
Cite this chapter
Grabowski, J. (1982). A New Algorithm of Solving the Flow — Shop Problem. In: Feichtinger, G., Kall, P. (eds) Operations Research in Progress. Theory and Decision Library, vol 32. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7901-7_6
Download citation
DOI: https://doi.org/10.1007/978-94-009-7901-7_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-7903-1
Online ISBN: 978-94-009-7901-7
eBook Packages: Springer Book Archive