Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
- 31 January 1981
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 6 (1) , 75-79
- https://doi.org/10.1016/0377-2217(81)90331-3
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Deadline scheduling of tasks with ready times and resource constraintsInformation Processing Letters, 1979
- Simple algorithms for multiprocessor scheduling to meet deadlinesInformation Processing Letters, 1977
- Two-Processor Scheduling with Start-Times and DeadlinesSIAM Journal on Computing, 1977
- Scheduling Tasks with Nonuniform Deadlines on Two ProcessorsJournal of the ACM, 1976
- Minimizing maximum lateness on one machine: computational experience and some applicationsStatistica Neerlandica, 1976
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- Maximal Flow with Gains through a Special NetworkOperations Research, 1972
- New Methods in Mathematical Programming—Optimal Flow Through Networks with GainsOperations Research, 1962