A common due-date assignment problem with job rejection on parallel uniform machines

Gur Mosheiov, Assaf Sarig*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

We study a common due-date assignment problem on two parallel uniform machines. The jobs are assumed to have identical processing times, and job-dependent and asymmetric earliness and tardiness unit costs. The scheduler may process only a subset of the jobs, i.e. the option of job-rejection is allowed. The objective function consists of three cost components: the total earliness-tardiness cost of all scheduled jobs, the cost of the common due-date, and total rejection cost. For a given number of rejected jobs and a given due-date, the problem is reduced to a non-standard linear assignment problem. Consequently, the optimal solution is shown to be obtained in polynomial time in the number of jobs. The case of a given (possibly restrictive) due-date, the extension to a setting of more than two machines, and a number of special cases, are also discussed.

Original languageAmerican English
Pages (from-to)2083-2092
Number of pages10
JournalInternational Journal of Production Research
Volume62
Issue number6
DOIs
StatePublished - 2024

Bibliographical note

Publisher Copyright:
© 2023 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group.

Keywords

  • Scheduling
  • due-date assignment
  • job-rejection
  • linear assignment problem
  • uniform machines

Fingerprint

Dive into the research topics of 'A common due-date assignment problem with job rejection on parallel uniform machines'. Together they form a unique fingerprint.

Cite this