Scheduling to Minimize Average Completion Time Revisited: Deterministic On-line Algorithms
Download full text from publisher
References listed on IDEAS
- W. L. Eastman & S. Even & I. M. Isaacs, 1964. "Bounds for the Optimal Scheduling of n Jobs on m Processors," Management Science, INFORMS, vol. 11(2), pages 268-279, November.
More about this item
KeywordsScheduling; Sequencing; Approximation Algorithms; On-line Algorithms; Competitive Ratio;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mit:sloanp:4048. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christian Zimmermann). General contact details of provider: http://edirc.repec.org/data/ssmitus.html .