✦ LIBER ✦

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

✍ Scribed by Jinjiang Yuan

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 119 KB
Volume: 94
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(95)00168-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A moving block heuristic for minimizing

A moving block heuristic for minimizing earliness and tardiness on a single machine with unrestrictive common due dates

✍ Scott J. Mason; Song Jin; Jagadish Jampani 📂 Article 📅 2005 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 1013 KB

A moving block heuristic (MBH) is developed for earliness-tardiness scheduling problems, which are observed in just-in-time (JIT) production environments. The MBH is described for the single-machine environment under unrestrictive job due date conditions. The proposed MBH, which has polynomial compu

A note on minimizing the weighted sum of

A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date

✍ Bahram Alidaee; Irinel Dragan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 300 KB