✦ LIBER ✦

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

✍ Scribed by Christos Koulamas

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 517 KB
Volume: 38
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2009.10.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A genetic algorithm for job sequencing p

A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights

✍ C.Y. Lee; J.Y. Choi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 749 KB

A faster algorithm for the maximum weigh

A faster algorithm for the maximum weighted tardiness problem

✍ Malcolm C. Fields; Greg N. Frederickson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 503 KB

A simpler and faster algorithm for optim

A simpler and faster algorithm for optimal total-work-content-power due date determination

✍ S.L. van de Velde 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 259 KB

A note on a partial search algorithm for

A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem

✍ T.C.E. Cheng 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 292 KB

A study of due-date assignment rules wit

A study of due-date assignment rules with constrained tightness in a dynamic job shop

✍ Feng-Chang R. Chang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 327 KB

Two due date assignment problems with po

Two due date assignment problems with position-dependent processing time on a single-machine

✍ Chou-Jung Hsu; Suh-Jenq Yang; Dar-Li Yang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 193 KB

The focus of this study is to analyze single-machine scheduling and due date assignment problems with position-dependent processing time. Two generally positional deterioration models and two frequent due date assignment methods are investigated. The objective functions include the cost of changing