Minimizing total load on parallel machines with linear deterioration

Baruch Mor, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

We study a scheduling problem with linear deterioration of job processing times. We consider parallel identical machines. The objective is minimum total load, i.e., minimum total processing times on all the machines. We propose a simple heuristic of a greedy type for this NP-hard problem. A lower bound based on the geometric mean of the job deterioration factors is also introduced. The greedy heuristic is shown to guarantee an optimal solution for small size problems, and our numerical tests indicate that in general it produces very close-to-optimal schedules.

Original languageAmerican English
Pages (from-to)771-779
Number of pages9
JournalOptimization Letters
Volume14
Issue number3
DOIs
StatePublished - 1 Apr 2020

Bibliographical note

Publisher Copyright:
© 2020, Springer-Verlag GmbH Germany, part of Springer Nature.

Keywords

  • Greedy heuristic
  • Linear deterioration
  • Parallel machines
  • Scheduling
  • Total load

Fingerprint

Dive into the research topics of 'Minimizing total load on parallel machines with linear deterioration'. Together they form a unique fingerprint.

Cite this