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

•We study scheduling and due-date assignment problems with acceptable lead times.•The machines settings are: parallel identical, uniform and unrelated machines.•A common lead-time is assumed in the first set of problems.•Then, job-dependent lead-times and identical earliness and tardiness costs are...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 166; s. 106617
Hlavní autoři: Mor, Baruch, Mosheiov, Gur
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.06.2024
Témata:
Due-Date Assignment
Dynamic Programming Algorithm
Lead-Time
Parallel Machines
Scheduling
Parallel Machines
Scheduling
Lead-Time
Dynamic Programming Algorithm
Due-Date Assignment
ISSN:0305-0548, 1873-765X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•We study scheduling and due-date assignment problems with acceptable lead times.•The machines settings are: parallel identical, uniform and unrelated machines.•A common lead-time is assumed in the first set of problems.•Then, job-dependent lead-times and identical earliness and tardiness costs are assumed.•Pseudo-polynomial dynamic programming algorithms are introduced for all problems. 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.
ISSN:0305-0548
1873-765X
DOI:10.1016/j.cor.2024.106617