The benefit of preemption for single machine scheduling so as to minimize total weighted completion time-Reference-Cited by-同舟云学术

The benefit of preemption for single machine scheduling so as to minimize total weighted completion time

Published:2016-11 Issue:6 Volume:44 Page:772-774
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Epstein Leah,Levin Asaf

Publisher

Elsevier BV

Subject

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

Reference6 articles.

1. Approximation techniques for average completion time scheduling;Chekuri;SIAM J. Comput.,2001

2. The power of preemption on unrelated machines and applications to scheduling orders;Correa;Math. Oper. Res.,2012

3. L. Epstein, A. Levin, A.J. Soper, V.A. Strusevich, Power of preemption for minimizing total completion time on uniform parallel machines, manuscript, 2015.

4. Single parameter analysis of power of preemption on two and three uniform machines;Soper;Discrete Optim.,2014

5. A tight lower bound for the best-alpha algorithm;Torng;Inform. Process. Lett.,1999

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

1. Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling;Mathematical Programming;2024-07-22

2. Comparison study of dispatching rules and heuristics for online scheduling of single machine scheduling problem with predicted release time jobs;Expert Systems with Applications;2024-06

3. Preemptive and non-preemptive scheduling on two unrelated parallel machines;Journal of Scheduling;2022-09-21

4. An exact algorithm for the preemptive single machine scheduling of equal-length jobs;Computers & Operations Research;2022-06

5. Parallel batch scheduling: Impact of increasing machine capacity;Omega;2022-04