On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops

Gur Mosheiov*, Sharon Pruwer

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

A classical single machine minmax common due-date assignment (CON) problem is studied. The problem is extended (independently) to the following settings: (1) general position-dependent job processing times are assumed, and an efficient O(n 4) solution procedure is introduced; (2) the option of job rejection is allowed, and this case is shown to be solved in O(n 5); (3) a deterioration effect is considered, and an O(n 2) solution algorithm is proposed; (4) parallel uniform machines are considered; and (5) the machine setting is that of a permutation flowshop. The last two settings are known to be NP hard, and efficient heuristic procedures are introduced and shown numerically to produce very small optimality gaps.

Original languageAmerican English
Pages (from-to)408-424
Number of pages17
JournalEngineering Optimization
Volume53
Issue number3
DOIs
StatePublished - 2021

Bibliographical note

Publisher Copyright:
© 2020 Informa UK Limited, trading as Taylor & Francis Group.

Keywords

  • Scheduling
  • flowshop
  • job rejection
  • position-dependent processing times
  • uniform machines

Fingerprint

Dive into the research topics of 'On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops'. Together they form a unique fingerprint.

Cite this