Abstract
We define the types of transfer lags, positive and negative, between stages of a flow shop, and discuss applications (transport times, nonbottleneck machines, manufacturing cells, batch transfers, setup and teardown times, master-slave systems, etc.). We show that the twomachine makespan problem is NP-hard, but that a variety of models can be efficiently solved using the Modified Johnson’s Rule and its extensions when our search is restricted to permutation schedules. We extend the analysis to the two-stage hybrid shop, and then to the m machine shop, for which bounds and heuristics are given. Further results involving transfer lags are given in Chap. 4.
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
Akl, S.G. (1989) The Design and Analysis of Parallel Algorithms, Prentice Hall, Englewood Cliffs, New Jersey.
Baker, K.R. (2005) Elements of Sequencing and Scheduling, Amos Tuck School of Business Administration, Dartmouth College, Hanover, NH.
Coffman, E. (1976) Computer & Job/Shop Scheduling Theory, John Wiley, New York.
Dell’Amico, M. (1996) Shop Problems with Two Machines and Time Lags, Operations Research, 44, 777–787.
Garey, M. and D. Johnson (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., New York.
Graham, R.L., E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan (1979) Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey, Annals of Discrete Mathematics, 5, 287–326.
Hariri, A.M.A. and C.N. Potts (1984) Algorithms for Two-Machine Flow-Shop Sequencing with Precedence Constraints, European Journal of Operational Research 17, 238–248.
Johnson, S.M. (1954) Optimal Two- and Three-Stage Production Schedules with Setup Times Included, Naval Research Logistics Quarterly 1, 61–68.
Johnson, S.M. (1959) Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags, Management Science, 5, 299–303.
Kogan, K. and E. Levner (1998) A polynomial Algorithm for Scheduling Small-Scale Manufacturing Cells Served by Multiple Robots, Computers and Operations Research, 25, 53–62.
Kurisu, T. (1976) Two-Machine Scheduling under Required Precedence among Jobs, J. Operations Research Society of Japan, 19, 1–11.
Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (1993) Sequencing and Scheduling: Algorithms and Complexity, Handbooks in OR and MS, Vol. 4, S.C. Graves, P.H. Zipkin, and A.H.G. Rinnooy Kan (eds), North Holland Publishing Co., Amsterdam.
Levner, E., K. Kogan and I. Levin (1995) Scheduling a Two-Machine Robotic Cell: a Solvable Case, Annals of Operations Research, 57, 217–232.
Martello, S. and P. Toth (1990) Knapsack Problems: Algorithms and Computer Implementations, John Wiley, Chichester, West Sussex, England.
Mitten, L.G. (1959a) Sequencing n Jobs on Two Machines with Arbitrary Time lags, Management Science, 5, 293–298.
Mitten, L.G. (1959b) A Scheduling Problem, Journal of Industrial Engineering, X, 131–135.
Monma, C.L. (1979) The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: an Algorithm and Extensions, Operations Research, 27, 792–798.
Monma, C.L. (1980) Sequencing to Minimize the Maximum Job Cost, Operations Research, 28, 942–951.
Monma, C.L. and J.B. Sidney (1979) Sequencing with Series-Parallel Precedence Constraints, Mathematics of Operations Research, 4, 215–224.
Pinedo, M. (1995) Scheduling: Theory, Algorithms, and Systems, Prentice Hall, Englewood Cliffs, New Jersey.
Sahni, S. (1995) Scheduling Master-slave Multiprocessor Systems, Proceedings, First International EURO-PAR Conference, Lecture Notes In Computer Science, Springer, 966, 611–622.
Sahni, S. and G.L. Vairaktarakis (1996) The Master-slave Paradigm in Parallel Computer and Industrial Settings, Journal of Global Optimization, 9, 357–377.
Sidney, J.B. (1979) The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations, Operations Research, 27, 782–791.
Vairaktarakis G. (1997) Analysis of Algorithms for Master-Slave Systems, IIE Transactions, 29, 939–949.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Emmons, H., Vairaktarakis, G. (2013). Transfer Lags in the Flow Shop. In: Flow Shop Scheduling. International Series in Operations Research & Management Science, vol 182. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-5152-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4614-5152-5_3
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-5151-8
Online ISBN: 978-1-4614-5152-5
eBook Packages: Business and EconomicsBusiness and Management (R0)