Due-Date assignment with acceptable lead-times on parallel machines

Baruch Mor, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

The paper studies scheduling and due-date assignment problems on parallel machines. We consider the DIF (different due date) model, which assumes job-dependent acceptable lead-times. Thus, in addition to the classical job-earliness and job-tardiness costs, the scheduler is penalized if an assigned due-date exceeds its lead-time. First, the case of a common lead-time is studied. Then we focus on the setting of job-dependent lead-times and identical (earliness, tardiness, and lead-time) costs. Both models are examined for parallel identical, uniform, and unrelated machines. The case in which the option of job-rejection is allowed is also considered. For all these NP-hard problems, efficient pseudo-polynomial dynamic programming algorithms are introduced and tested. Our numerical tests indicate that problems containing 500 jobs are solved in less than 0.3 s.

Original languageAmerican English
Article number106617
JournalComputers and Operations Research
Volume166
DOIs
StatePublished - Jun 2024

Bibliographical note

Publisher Copyright:
© 2024 Elsevier Ltd

Keywords

  • Due-Date Assignment
  • Dynamic Programming Algorithm
  • Lead-Time
  • Parallel Machines
  • Scheduling

Fingerprint

Dive into the research topics of 'Due-Date assignment with acceptable lead-times on parallel machines'. Together they form a unique fingerprint.

Cite this