A note on scheduling a rate modifying activity to minimize total late work

Gur Mosheiov, Daniel Oron*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

We study a single machine scheduling problem with a rate modifying activity. In most cases, performing such an activity (e.g., a maintenance procedure) improves the system performance, as reflected by shorter processing times of the jobs processed after it. The scheduling measure assumed is total late work: each job is considered as a collection of unit-time jobs, and the late work is defined as the number of tardy units. The problem is NP-hard, and we introduce and test numerically a pseudo-polynomial dynamic programming algorithm. Our results indicate that the algorithm solves large problem instances efficiently.

Original languageAmerican English
Article number107138
Pages (from-to)107138
Number of pages1
JournalComputers and Industrial Engineering
Volume154
DOIs
StatePublished - Apr 2021

Bibliographical note

Publisher Copyright:
© 2021

Keywords

  • Dynamic programming
  • Rate-modifying activity
  • Scheduling
  • Single machine
  • Total late work

Fingerprint

Dive into the research topics of 'A note on scheduling a rate modifying activity to minimize total late work'. Together they form a unique fingerprint.

Cite this