Author:
Megow Nicole,Schulz Andreas S
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference18 articles.
1. F.N. Afrati, E. Bampis, C. Chekuri, D.R. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, M. Sviridenko, Approximation schemes for minimizing average weighted completion time with release dates, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), New York, 1999, pp. 32–43.
2. E.J. Anderson, C.N. Potts, On-line scheduling of a single machine to minimize total weighted completion time, in: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, 2002, pp. 548–557.
3. Approximation techniques for average completion time scheduling;Chekuri;SIAM J. Comput.,2001
4. Bounds for the optimal scheduling of n jobs on m processors;Eastman;Management Sci.,1964
5. Single machine scheduling with release dates;Goemans;SIAM J. Discrete Math.,2002
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Call Centre Optimization Based on Personalized Requests Distribution;Communications in Computer and Information Science;2024
2. An improved greedy algorithm for stochastic online scheduling on unrelated machines;Discrete Optimization;2023-02
3. Accounting for large jobs for a single-processor online model;2022 8th International Conference on Optimization and Applications (ICOA);2022-10-06
4. A conceptual framework for personality-sensitive scheduling models;2022 8th International Conference on Optimization and Applications (ICOA);2022-10-06
5. Permutation Predictions for Non-Clairvoyant Scheduling;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11