On Scheduling a Deteriorating Rate-Modifying Activity to Minimize the Number of Tardy Jobs

On Scheduling a Deteriorating Rate-Modifying Activity to Minimize the Number of Tardy Jobs J. Oper. Res. Soc. China https://doi.org/10.1007/s40305-018-0207-5 On Scheduling a Deteriorating Rate-Modifying Activity to Minimize the Number of Tardy Jobs Wen-Chang Luo Received: 30 August 2017 / Revised: 16 December 2017 / Accepted: 16 May 2018 © Operations Research Society of China, Periodicals Agency of Shanghai University, Science Press, and Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract We investigate a single-machine scheduling problem, where a deteriorat- ing rate-modifying activity can be performed on the machine to reduce the processing times of jobs. The objective is to minimize the number of tardy jobs. Under the assump- tion that the duration of the rate-modifying activity is a nonnegative and nondecreasing function on its starting time, we propose an optimal polynomial time algorithm running in O(n ) time. Keywords Scheduling · Rate-modifying activity · Due date · Polynomial time algorithm Mathematics Subject Classification 90B35 1 Introduction Motivated by an actual production problem commonly found in electronic assembly lines, Lee and Leon [1] introduced a class of scheduling problems called as scheduling with a rate-modifying activity. In such problems, one can choose to perform a rate- modifying activity on a machine, which occupies a certain time while speeds up the production rate http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of the Operations Research Society of China Springer Journals

On Scheduling a Deteriorating Rate-Modifying Activity to Minimize the Number of Tardy Jobs

Loading next page...
 
/lp/springer_journal/on-scheduling-a-deteriorating-rate-modifying-activity-to-minimize-the-F15nE1zwgd
Publisher
Springer Journals
Copyright
Copyright © 2018 by Operations Research Society of China, Periodicals Agency of Shanghai University, Science Press, and Springer-Verlag GmbH Germany, part of Springer Nature
Subject
Mathematics; Operations Research, Management Science
ISSN
2194-668X
eISSN
2194-6698
D.O.I.
10.1007/s40305-018-0207-5
Publisher site
See Article on Publisher Site

Abstract

J. Oper. Res. Soc. China https://doi.org/10.1007/s40305-018-0207-5 On Scheduling a Deteriorating Rate-Modifying Activity to Minimize the Number of Tardy Jobs Wen-Chang Luo Received: 30 August 2017 / Revised: 16 December 2017 / Accepted: 16 May 2018 © Operations Research Society of China, Periodicals Agency of Shanghai University, Science Press, and Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract We investigate a single-machine scheduling problem, where a deteriorat- ing rate-modifying activity can be performed on the machine to reduce the processing times of jobs. The objective is to minimize the number of tardy jobs. Under the assump- tion that the duration of the rate-modifying activity is a nonnegative and nondecreasing function on its starting time, we propose an optimal polynomial time algorithm running in O(n ) time. Keywords Scheduling · Rate-modifying activity · Due date · Polynomial time algorithm Mathematics Subject Classification 90B35 1 Introduction Motivated by an actual production problem commonly found in electronic assembly lines, Lee and Leon [1] introduced a class of scheduling problems called as scheduling with a rate-modifying activity. In such problems, one can choose to perform a rate- modifying activity on a machine, which occupies a certain time while speeds up the production rate

Journal

Journal of the Operations Research Society of ChinaSpringer Journals

Published: Jun 5, 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