Lot sizing in a no-wait flow shop
Authors:
- 1 May 1995
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 17 (4) , 159-164
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The Three-Machine No-Wait Flow Shop is NP-CompleteJournal of the ACM, 1984
- Counterexamples to optimal permutation schedules for certain flow shop problemsNaval Research Logistics Quarterly, 1981
- Complexity of Scheduling Shops with No Wait in ProcessMathematics of Operations Research, 1979
- Complexity of Machine Scheduling Problems1977
- Solution of the Flowshop-Scheduling Problem with No Intermediate QueuesOperations Research, 1972
- Letter to the Editor—The Traveling Salesman Problem: On the Reduction of Certain Large Problems to Smaller OnesOperations Research, 1966
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman ProblemOperations Research, 1964
- Ein Beitrag zum ReihenfolgeproblemMathematical Methods of Operations Research, 1960