Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- 1 November 1978
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 7 (4), 393-404
- https://doi.org/10.1137/0207031
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- Optimum Production Scheduling of Multicommodity in Flow LineIEEE Transactions on Systems, Man, and Cybernetics, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972
- Minimum Change-Over Scheduling of Several Products on One MachineOperations Research, 1968