✦ LIBER ✦

Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs

✍ Scribed by Zhi-Long Chen

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 817 KB
Volume: 93
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(95)00133-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Common due date scheduling problem with

Common due date scheduling problem with separate earliness and tardiness penalties

✍ Parthasarati Dileepan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 553 KB

A note on the complexity of single-machi

A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs

✍ Jinjiang Yuan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 119 KB

A fixed interval due-date scheduling pro

A fixed interval due-date scheduling problem with earliness and due-date costs

✍ Dilip Chhajed 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 936 KB

Minimizing absolute and squared deviatio

Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date

✍ Uttarayan Bagchi; Yih-Long Chang; Robert S. Sullivan 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 616 KB

Due-date assignment and early/tardy sche

Due-date assignment and early/tardy scheduling on identical parallel machines

✍ Prabuddha De; Jay B. Ghosh; Charles E. Wells 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 871 KB

Batch scheduling and common due date ass

Batch scheduling and common due date assignment problem: An NP-hard case

✍ Mikhail Y. Kovalyov 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 199 KB

An important special case of the problem studied in arises when there are equal set-up times and equal job processing times. Computational complexity of this case was indicated to be open, however. I prove its NP-hardness.