A faster algorithm for a due date assignment problem with tardy jobs

DOI10.1016/j.orl.2009.10.013zbMath1185.90135OpenAlexW2012701387MaRDI QIDQ969519

Christos P. Koulamas

Publication date: 7 May 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.10.013

zbMATH Keywords

due date assignmentweighted number of tardy jobssingle-machine sequencing

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (6)

Bicriteria scheduling for due date assignment with total weighted tardiness ⋮ A survey on offline scheduling with rejection ⋮ Due-window assignment problems with unit-time jobs ⋮ Four single-machine scheduling problems involving due date determination decisions ⋮ Proportionate flow shop: New complexity results and models with due date assignment ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

Cites Work

• Two due date assignment problems in scheduling a single machine

This page was built for publication: A faster algorithm for a due date assignment problem with tardy jobs