A note on minimizing total weighted completion time with an unexpected machine unavailable interval

A note on minimizing total weighted completion time with an unexpected machine unavailable interval Recently, Huo et al. (J Sched 17(2):161–172, 2014) addressed single-machine scheduling problems with an unexpected machine unavailable interval. In their study, both the start time and the length of the unavailable interval are unknown beforehand. Two models were considered according to the way that the machine becomes unavailable, the breakdown model and the emergent job model. In this note, we further study several single-machine scheduling problems with an unexpected machine unavailable interval. For the breakdown model to minimize the total weighted completion time, we give a better lower bound which shows that the simple LPT rule can give the best possible competitive ratio. For the emergent job model to minimize the total weighted completion time, we give a new lower bound and design a best possible algorithm with a 2 4 3 2 competitive ratio of 1+4α/(4+α ), where α ≈ 0.6109 is the root in (0, 1) of the equation 23α +24α +72α −32α −16 = 0. This improves upon the worst-case bound (11 − 2)/7 of the heuristic presented by Huo et al. (J Sched 17(2):161–172, 2014). Moreover, for minimizing the total completion time, we prove no 9/7- and 5/4-competitive online algorithm exist for the breakdown model http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Scheduling Springer Journals

A note on minimizing total weighted completion time with an unexpected machine unavailable interval

Loading next page...
 
/lp/springer_journal/a-note-on-minimizing-total-weighted-completion-time-with-an-unexpected-KY0PA0qfxz
Publisher
Springer Journals
Copyright
Copyright © 2018 by Springer Science+Business Media, LLC, part of Springer Nature
Subject
Business and Management; Operations Research/Decision Theory; Calculus of Variations and Optimal Control; Optimization; Optimization; Artificial Intelligence (incl. Robotics); Supply Chain Management
ISSN
1094-6136
eISSN
1099-1425
D.O.I.
10.1007/s10951-018-0573-1
Publisher site
See Article on Publisher Site

Abstract

Recently, Huo et al. (J Sched 17(2):161–172, 2014) addressed single-machine scheduling problems with an unexpected machine unavailable interval. In their study, both the start time and the length of the unavailable interval are unknown beforehand. Two models were considered according to the way that the machine becomes unavailable, the breakdown model and the emergent job model. In this note, we further study several single-machine scheduling problems with an unexpected machine unavailable interval. For the breakdown model to minimize the total weighted completion time, we give a better lower bound which shows that the simple LPT rule can give the best possible competitive ratio. For the emergent job model to minimize the total weighted completion time, we give a new lower bound and design a best possible algorithm with a 2 4 3 2 competitive ratio of 1+4α/(4+α ), where α ≈ 0.6109 is the root in (0, 1) of the equation 23α +24α +72α −32α −16 = 0. This improves upon the worst-case bound (11 − 2)/7 of the heuristic presented by Huo et al. (J Sched 17(2):161–172, 2014). Moreover, for minimizing the total completion time, we prove no 9/7- and 5/4-competitive online algorithm exist for the breakdown model

Journal

Journal of SchedulingSpringer Journals

Published: Jun 4, 2018

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
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.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off