Author:
Soper Alan J.,Strusevich Vitaly A.
Abstract
AbstractFor a scheduling problem to minimize the makespan on three uniform parallel machines we present a parametric analysis of the quality of a schedule with at most one preemption compared to the global optimal schedule with any number of preemptions. A tight bound is derived as a function of the relative speeds of the machines, provided that two of the machines have the same speed.
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference19 articles.
1. Braun, O., & Schmidt, G. (2003). Parallel processor scheduling with limited number of preemptions. SIAM Journal on Computing, 32, 671–680.
2. Brucker, P. (2007). Scheduling algorithms (5th ed.). Berlin: Springer.
3. Chen, B. (2004). Parallel machine scheduling for early completion. In J. Y.-T. Leung (Ed.), Handbook of scheduling: Algorithms, models and performance analysis (pp. 9-175–9-184). London: Chapman & Hall/CRC.
4. Correa, J. R., Skutella, M., & Verschae, J. (2012). The power of preemption on unrelated machines and applications to scheduling orders. Mathematical Operations Research, 37, 379–398.
5. Epstein, L., & Levin, A. (2016). The benefit of preemption for single machine scheduling so as to minimise total weighted completion time. Operations Research Letters, 44, 772–774.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献