Scheduling Jobs with Temporal Distance Constraints
- 1 October 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (5) , 1104-1121
- https://doi.org/10.1137/s0097539791218081
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Scheduling real-time computations with separation constraintsInformation Processing Letters, 1992
- Recent Developments in Deterministic Sequencing and Scheduling: A SurveyPublished by Springer Nature ,1982
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- A fast algorithm for single processor schedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- 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
- Optimal Linear OrderingSIAM Journal on Applied Mathematics, 1973