Online C-benevolent job scheduling on multiple machines

Online C-benevolent job scheduling on multiple machines We consider scheduling a sequence of C-benevolent jobs on multiple homogeneous machines. For two machines, we propose a 2-competitive Cooperative Greedy algorithm and provide a lower bound of 2 for the competitive ratio of any deterministic online scheduling algorithms on two machines. For multiple machines, we propose a Pairing-m Greedy algorithm, which is deterministic 2-competitive for even number of machines and randomized $$(2+2/{\hbox {m}})$$ ( 2 + 2 / m ) -competitive for odd number of machines. We provide a lower bound of 1.436 for the competitive ratio of any deterministic online scheduling algorithms on three machines, which is the best known lower bound for competitive ratios of deterministic scheduling algorithms on three machines. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Optimization Letters Springer Journals

Online C-benevolent job scheduling on multiple machines

, Volume 12 (2) – Sep 8, 2017
13 pages

/lp/springer_journal/online-c-benevolent-job-scheduling-on-multiple-machines-VgrMKWi1fT
Publisher
Springer Berlin Heidelberg
Subject
Mathematics; Optimization; Operations Research/Decision Theory; Computational Intelligence; Numerical and Computational Physics, Simulation
ISSN
1862-4472
eISSN
1862-4480
D.O.I.
10.1007/s11590-017-1191-0
Publisher site
See Article on Publisher Site

Abstract

We consider scheduling a sequence of C-benevolent jobs on multiple homogeneous machines. For two machines, we propose a 2-competitive Cooperative Greedy algorithm and provide a lower bound of 2 for the competitive ratio of any deterministic online scheduling algorithms on two machines. For multiple machines, we propose a Pairing-m Greedy algorithm, which is deterministic 2-competitive for even number of machines and randomized $$(2+2/{\hbox {m}})$$ ( 2 + 2 / m ) -competitive for odd number of machines. We provide a lower bound of 1.436 for the competitive ratio of any deterministic online scheduling algorithms on three machines, which is the best known lower bound for competitive ratios of deterministic scheduling algorithms on three machines.

Journal

Published: Sep 8, 2017

DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month Explore the DeepDyve Library Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve Freelancer DeepDyve Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations