On Some Variants of the Bandwidth Minimization Problem
- 1 August 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (3) , 650-667
- https://doi.org/10.1137/0213040
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Scheduling Unit–Time Tasks with Arbitrary Release Times and DeadlinesSIAM Journal on Computing, 1981
- Scheduling Interval-Ordered TasksSIAM Journal on Computing, 1979
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978
- Two-Processor Scheduling with Start-Times and DeadlinesSIAM Journal on Computing, 1977
- The NP-Completeness of the bandwidth minimization problemComputing, 1976
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975
- Optimal scheduling for two-processor systemsActa Informatica, 1972
- The Transitive Reduction of a Directed GraphSIAM Journal on Computing, 1972
- Parallel Sequencing and Assembly Line ProblemsOperations Research, 1961