Complexity results for scheduling chains on a single machine
- 30 April 1980
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 4 (4) , 270-275
- https://doi.org/10.1016/0377-2217(80)90111-3
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- Complexity of Scheduling under Precedence ConstraintsOperations Research, 1978
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence ConstraintsPublished by Elsevier ,1978
- A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total TardinessPublished by Elsevier ,1977
- A note on the complexity of the chromatic number problemInformation Processing Letters, 1976
- Scheduling Tasks with Nonuniform Deadlines on Two ProcessorsJournal of the ACM, 1976
- On cubical graphsJournal of Combinatorial Theory, Series B, 1975
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- Optimal scheduling for two-processor systemsActa Informatica, 1972