Algorithms for scheduling and network problems. Doctoral thesis
Technical Report
·
OSTI ID:6098008
In this thesis we develop algorithms for two basic classes of problems in combinatorial optimization: deterministic machine scheduling and network optimization. In the first part of the thesis we consider approximation algorithms for two basic scheduling environments: shop scheduling and parallel machine scheduling. The authors give approximation algorithms for shop scheduling that significantly improve upon the performance of previous algorithms. They then study on-line approximation algorithms for parallel machine scheduling. In the second part of the thesis they present several theoretical and practical results about parallel algorithms for network optimization problems.
- Research Organization:
- Massachusetts Inst. of Tech., Cambridge, MA (United States). Lab. for Computer Science
- OSTI ID:
- 6098008
- Report Number(s):
- AD-A-241225/2/XAB; MIT/LCS/TR--514; CNN: N00014-89-J-1988
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel approximate algorithms for combinatorially hard problems
Integrated network design and scheduling problems :
Theoretical and experimental analyses of parallel combinatorial algorithms. Doctoral thesis
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:5180559
Integrated network design and scheduling problems :
Technical Report
·
Tue Dec 31 23:00:00 EST 2013
·
OSTI ID:1147479
Theoretical and experimental analyses of parallel combinatorial algorithms. Doctoral thesis
Technical Report
·
Sun Oct 01 00:00:00 EDT 1989
·
OSTI ID:6963697