On-line scheduling on a single machine: maximizing the number of early jobs-Reference-Cited by-同舟云学术

On-line scheduling on a single machine: maximizing the number of early jobs

Published:2000-12 Issue:5 Volume:27 Page:193-197
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Hoogeveen Han,Potts Chris N.,Woeginger Gerhard J.

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference9 articles.

1. An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs;Baptiste;Oper. Res. Lett.,1999

2. S. Baruah, J. Haritsa, N. Sharma, On-line scheduling to maximize task completions, Proceedings of the 15th IEEE Real-time Systems Symposium (RSS’96), 1994, pp. 228–237.

3. B. Kalyanasundaram, K. Pruhs, Maximizing job completions on-line, Proceedings of the Sixth European Symposium on Algorithms (ESA’98), Springer Lecture Notes in Computer Science, vol. 1461, 1998, pp. 235–246.

4. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs;Lawler;Ann. Oper. Res.,1990

5. Complexity of machine scheduling problems;Lenstra;Ann. Oper. Res.,1977

Cited by 44 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Scheduling Dependent Batching Tasks;Proceedings of the 52nd International Conference on Parallel Processing;2023-08-07

2. Online scheduling on a single machine with one restart for all jobs to minimize the weighted makespan;AIMS Mathematics;2023

3. Exact reoptimisation under gradual look-ahead for operational control in production and logistics;International Journal of Systems Science: Operations & Logistics;2022-11-21

4. From Spectrum Bonding to Contiguous-Resource Batching Task Scheduling;IEEE/ACM Transactions on Networking;2022-06

5. Downlink Transmission Scheduling With Data Sharing;IEEE/ACM Transactions on Networking;2022-06