Flowshop scheduling with limited temporary storage
- 1 July 1980
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 27 (3), 533-549
- https://doi.org/10.1145/322203.322213
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- The adjacency relation on the traveling salesman polytope is NP-CompleteMathematical Programming, 1978
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- Deterministic Processor SchedulingACM Computing Surveys, 1977
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975
- Sequencing Two-Machine Flow-Shops with Finite Intermediate StorageManagement Science, 1975
- On the Flow-Shop Sequencing Problem with No Wait in Process†Journal of the Operational Research Society, 1972
- Solution of the Flowshop-Scheduling Problem with No Intermediate QueuesOperations Research, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman ProblemOperations Research, 1964
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954