Minmax scheduling and due-window assignment with position-dependent processing times and job rejection

Gur Mosheiov*, Assaf Sarig, Vitaly Strusevich

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

We study scheduling and due-window assignment problems with the objective function of a minmax type, i.e., the goal is to minimize the largest cost among all scheduled jobs. We assume that the processing times of jobs are position-dependent in the most general way. For a single machine and for a proportionate flow shop environment we present polynomial time solution procedures that are based on solving a linear assignment problem as a subroutine. We further extend the single machine model by allowing job-rejection, provided that the processing times deteriorate, i.e., the position-dependent processing times are non-decreasing functions of the job position. For this setting, the scheduler may decide not to process certain jobs, and each rejected job is penalized accordingly. The problem with the objective that additionally involves a maximum rejection cost component is also shown to be solvable in polynomial time.

Original languageAmerican English
Pages (from-to)439-456
Number of pages18
Journal4OR
Volume18
Issue number4
DOIs
StatePublished - Dec 2020

Bibliographical note

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

Keywords

  • Due-window assignment
  • Job-rejection
  • Position-dependent processing times
  • Proportionate flow shop
  • Scheduling
  • Sequencing

Fingerprint

Dive into the research topics of 'Minmax scheduling and due-window assignment with position-dependent processing times and job rejection'. Together they form a unique fingerprint.

Cite this