Author:
Jabbari Arman,Kaminsky Philip M.
Funder
Project Production Institute
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference6 articles.
1. Anderson, E. J. and Potts, C. N. (2004), ‘Online scheduling of a single machine to minimize total weighted completion time’, Mathematics of Operations Research 29(3), 686–697. https://doi.org/10.1287/moor.1040.0092.
2. Kolliopoulos, S. G. and Steiner, G. (2007), ‘Approximation algorithms for scheduling problems with a modified total weighted tardiness objective’, Operations Research Letters 35(5), 685–692. https://doi.org/10.1016/j.orl.2006.12.002.
3. Liu, M., Xu, Y., Chu, C. and Zheng, F. (2009), ‘Online scheduling to minimize modified total tardiness with an availability constraint’, Theoretical Computer Science 410(47), 5039–5046. https://doi.org/10.1016/j.tcs.2009.07.055.
4. Pruhs, K., Sgall, J. and Torng, E. ( 2004), Online scheduling, in J. Y. Leung, ed., ‘Handbook of Scheduling - Algorithms, Models, and Performance Analysis’, Chapman and Hall/CRC.
5. Sleator, D. D. and Tarjan, R. E. (1985), ‘Amortized efficiency of list update and paging rules’, Commun. ACM 28(2), 202–208. https://doi.org/10.1145/2786.2793.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献