Scheduling-LPs bear probabilities randomized approximations for min-sum criteria
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 416-429
- https://doi.org/10.1007/3-540-63397-9_32
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Profile-driven instruction level parallel scheduling with application to super blocksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Resource scheduling for parallel database and scientific applicationsPublished by Association for Computing Machinery (ACM) ,1996
- A supermodular relaxation for scheduling with release datesPublished by Springer Nature ,1996
- Improved scheduling algorithms for minsum criteriaPublished by Springer Nature ,1996
- Formulating the single machine sequencing problem with release dates as a mixed integer programDiscrete Applied Mathematics, 1990
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time ProblemSIAM Journal on Computing, 1986
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974
- On a combinatorial gameJournal of Combinatorial Theory, Series A, 1973