Task scheduling in networks
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 290-301
- https://doi.org/10.1007/3-540-58218-5_27
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Scheduling Parallel Machines On-LineSIAM Journal on Computing, 1995
- Chapter 9 Sequencing and scheduling: Algorithms and complexityPublished by Elsevier ,1993
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation ApproachSIAM Journal on Computing, 1988
- Randomized rounding: A technique for provably good algorithms and algorithmic proofsCombinatorica, 1987
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- Bounds for naive multiple machine scheduling with release times and deadlinesJournal of Algorithms, 1984
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974