ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Algorithms for total weighted completion time scheduling
Full text PdfPdf (234 KB)
Source Symposium on Discrete Algorithms archive
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms table of contents
Baltimore, Maryland, United States
Pages: 852 - 853  
Year of Publication: 1999
ISBN:0-89871-434-6
Authors
Ivan D. Baev  Department of ECE, Northeastern University, Boston, MA
Waleed M. Meleis  Department of ECE, Northeastern University, Boston, MA
Alexandre E. Eichenberger  Department of ECE, NC State University, EGRC, Box 7914, Raleigh, NC
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics
Publisher
Society for Industrial and Applied Mathematics  Philadelphia, PA, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 27,   Citation Count: 3
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Martin W. P. Savelsbergh , R. N. Uma , Joel Wein, An experimental study of LP-based approximation algorithms for scheduling problems, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.453-462, January 25-27, 1998, San Francisco, California, United States
 
2
J. B. Sidney. Decomposition algorithms for singlemachine sequencing with precedence relations and deferral costs. Operations Research, 23:283-298, 1975.

CITED BY  3
Alexandre E. Eichenberger , Waleed M. Meleis, Balance scheduling: weighting branch tradeoffs in superblocks, Proceedings of the 32nd annual ACM/IEEE international symposium on Microarchitecture, p.272-283, November 16-18, 1999, Haifa, Israel
Ivan D. Baev , Waleed M. Meleis , Alexandre E. Eichenberger, Lower bounds on precedence-constrained scheduling for parallel processors, Information Processing Letters, v.83 n.1, p.27-32, 16 July 2002
Arezou Mohammadi , Selim G. Akl, Heuristic scheduling algorithms designed based on properties of optimal algorithm for soft real-time tasks, Proceedings of the 2007 summer computer simulation conference, July 16-19, 2007, San Diego, California

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sequencing and scheduling

Additional Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.2 Approximation
          Subjects: Linear approximation


General Terms:
Algorithms, Experimentation, Performance, Reliability

Collaborative Colleagues:
Ivan D. Baev: colleagues
Waleed M. Meleis: colleagues
Alexandre E. Eichenberger: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player