Abstract
The problem analyzed in this paper is No Wait Flow Shop. It consists of minimizing the completion time of a set of jobs that must undergo a series of machines in the same order, with the constraint that each job, once started, can spend in the system only the time strictly necessary to its completion, i.e. no waits are allowed between the machines. The jobs that must be scheduled in a shop floor, may be grouped in different lots, each lot consisting of a set of identical jobs (workparts). In this paper, it is shown that this "lot hypothesis" leads to an asymptotically exact (with respect to lot sizes) algorithm. In the case of single-part lots (that is, without the lot assumption), it performs nearly to the best approximate algorithm known so far for No-Wait Flow Shop ([RS]). Lot sizes need not be identical.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Agnetis A.: "No-Wait Flow Shop scheduling with large lot size", Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", Rap. n. 16.89
Gilmore P.C., Gomory R.E.: "Sequencing a one-state variable machine: A solvable case of the traveling salesman problem", Oper. Res. 12 (1964), 655–679.
Gilmore P.C., Lawler E.L., Shmoys D.B.: "Well-solved special cases", fromThe Traveling Salesman Problem, edited by E.L.Lawler, J.K.Lenstra, A.H.G.Rinnooy Kan, D.B.Shmoys, 1985 John Wiley and Sons.
Kanellakis P.C., Papadimitriou C.H.: "Local search for the Asymmetric Traveling Salesman Problem", Oper. Res. 28 (1980), 1086–1099.
Orlin J.B.: "On the simplex algorithm for networks and generalized networks", Sloan School of Management, MIT, working paper 1467-83, May 1984.
Papadimitriou C.H., Kanellakis P.C.: "Flowshop scheduling with limited temporary storage", Journal of ACM 27, 3 (July 1980), 533–549.
Panwalkar S.S., Woollam C.R., "Flow Shop Scheduling Problems with no In-process Waiting: A Special Case", Journal Oper. Res. Soc. 30 (1979), 661–664.
Panwalkar S.S., Woollam C.R., "Ordered Flow Shop Problems with no In-process Waiting: Further Results", Journal Oper. Res. Soc. 31 (1980), 1039–1043.
Röck H.: "Three machine no-wait flow shop is NP complete", Journal of ACM 31, 2 (August 1984),335–345.
Röck H.: "Flowshop Scheduling with no Wait in Process on Three Machines", Rep. 82-07, Fachbereich Informatik, Technical University of Berlin, Berlin, West Germany, 1982.
Reddi S.S., Ramamoorthy C.V.: "On the flow shop sequencing problem with no wait in process", J. Oper. Res. Society 23 (1972), 323–331.
Röck H., Schmidt G.: "Machine aggregation heuristics in shop scheduling", Methods of Operation Research 45 (1983), 303–314.
Wismer D.A.: "Solution of the flowshop scheduling problem with no intermediate queues", Oper. Res.20 (1972), 689–697.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 International Federation for Information Processing
About this paper
Cite this paper
Agnetis, A. (1990). New results on No-Wait Flow Shop scheduling. In: Sebastian, H.J., Tammer, K. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0008396
Download citation
DOI: https://doi.org/10.1007/BFb0008396
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52659-9
Online ISBN: 978-3-540-47095-3
eBook Packages: Springer Book Archive