No-wait flow shop scheduling with large lot sizes

Annals of Operations Research

Volumn 70, Issue , 1997, Pages 415-438

  Agnetis, Alessandro ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Approximation algorithms; Heuristics; No wait scheduling

Indexed keywords

EID: 0031491251     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018942709213     Document Type: Article

References (27)

1. A. Agnetis, M. Lucertini and F. Nicolò, Just-in-time scheduling in a pipeline manufacturing system, Proceedings of IFAC Workshop "Decisional Structures in Automated Manufacturing", Genoa, Italy, Pergamon Press, 1989.
2. A. Agnetis, D. Pacciarelli and F. Rossi, Batch scheduling in a two machine flow shop with limited buffer, in: Operations Research Proceedings 1994, selected papers of the International Conference in Operations Research, U. Derigs, A. Bachem and A. Drexl, eds., Springer, Berlin, 1994.
3. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, New York, 1993.
4. J. Blazewicz, R.E. Burkard, G. Finke and G.J. Woeginger, Vehicle scheduling in two-cycle flexible manufacturing systems, Mathematical and Computer Modelling 20(1994)19-31.
5. S.S. Cosmadakis and C.H. Papadimitriou, The traveling salesman problem with many visits to few cities, SIAM Journal on Computing 13(1984)99-108.
6. P.C. Gilmore and R.E. Gomory, Sequencing a one-state variable machine: A solvable case of the traveling salesman problem, Operations Research 12(1964)655-679.
7. P.C. Gilmore, E.L. Lawler and D.B. Shmoys, Well-solved special cases, in: The Traveling Sales-man Problem, E.L. Lawler, J.K . Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds., Wiley, 1985, pp. 87-143.
8. A.V. Goldberg and R.E. Tarjan, Finding minimum-cost circulations by successive approximation, Mathematics of Operations Research 15(1990)430-466.
9. A.V. Goldberg and M. Kharitanov, On implementing scaling push-relabel algorithms for the minimum-cost flow froblem, in: Network Flows and Matching, D.S. Johnson and C.S. McGeoch, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 12, 1993, pp. 157-198.
10. N.G. Hall and C. Sriskandarajah, A survey of machine scheduling problems with blocking and no-wait in process, Operations Research 44(1996)510-525.
11. R. Hall, Zero Inventories, DowJones-Irving, Homewood, IL, 1983.
12. D.S. Hochbaum and R. Shamir, Strongly polynomial algorithms for the high multiplicity scheduling problem, Operations Research 39(1991)648-653.
13. S.M. Johnson, Optimal two- and three-stage production schedules with set-up times included, Naval Research Logistics Quarterly 1(1954)61-68.
14. P.C. Kanellakis and C.H. Papadimitriou, Local search for the asymmetric Traveling Salesman Problem, Operations Research 28(1980)1086-1099.
15. R.M. Karp and J.M. Steele, Probabilistic analysis of heuristics, in: The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B.Shmoys, eds., Wiley, 1985, pp. 181-205.
16. J.R. King and A.S. Spachis, Heuristics for flowshop scheduling, International Journal of Produc-tion Research 18(1980)345-357.
17. W. Kubiak, A pseudo-polynomial algorithm for a two-machine no-wait jobshop scheduling problem, European Journal of Operational Research 43(1989)267-270.
18. J.Y.-T. Leung, On scheduling independent tasks with restricted execution times, Operations Research 30(1982)1.
19. H. Matsuo, Cyclic sequencing problems in a two machine permutation flowshop: Complexity, worst case and average case analysis, Naval Research Logistics 37(1990)925-935.
20. S.T. McCormick, S.R. Smallwood and F.C.R. Spieksma, Polynomial algorithms for multiprocessor scheduling problems with a small number of job lengths, University of British Columbia, Faculty of Commerce, Working Paper 93-MSC-008, 1993.
21. Y. Monden, Toyota Production System: Practical Approach to Production Management, Industrial Engineering and Management Press, Atlanta, GA, 1983.
22. C.H. Papadimitriou and P.C. Kanellakis, Flowshop scheduling with limited temporary storage, Journal of the ACM 27(1980)533-549.
23. H. Röck, Three machine no-wait flow shop is NP complete, Journal of the ACM 31(1984)335-345.
24. H. Röck, Flowshop scheduling with no wait in process on three machines, Fachbereich Informatik, Technical University of Berlin, Rep. 82-07, Berlin, Germany, 1982.
25. H. Röck and G. Schmidt, Machine aggregation heuristics in shop scheduling, Methods of Operation Research 45(1983)303-314.
26. J.A.A. van der Veen and R. van Dal, Solvable case of the no-wait flow shop scheduling problem, Journal of the Operational Research Society 42(1991)971-980.
27. R. Wittrock, Scheduling algorithms for flexible flow lines, IBM Journal of Research and Development 29(1985)401-412.