The Three-Machine No-Wait Flow Shop is NP-Complete
- 30 March 1984
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 31 (2) , 336-345
- https://doi.org/10.1145/62.65
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Unit Execution Time Shop ProblemsMathematics of Operations Research, 1982
- Ordered Flow Shop Problems with no In-Process Waiting: Further ResultsJournal of the Operational Research Society, 1980
- Local Search for the Asymmetric Traveling Salesman ProblemOperations Research, 1980
- Scheduling in a Semi-Ordered Flow-shop Without Intermediate QueuesA I I E Transactions, 1980
- Flowshop scheduling with limited temporary storageJournal of the ACM, 1980
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- The Planar Hamiltonian Circuit Problem is NP-CompleteSIAM Journal on Computing, 1976
- On the Flow-Shop Sequencing Problem with No Wait in Process†Journal of the Operational Research Society, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman ProblemOperations Research, 1964