✦ LIBER ✦

The weighted common due date single machine scheduling problem revisited

✍ Scribed by Wlodzimierz Szwarc

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 509 KB
Volume: 23
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(95)o0025-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single-machine earliness-tardiness sched

Single-machine earliness-tardiness scheduling about a common due date with tolerances

✍ Michael X. Weng; Jose A. Ventura 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 823 KB

Two due date assignment problems in sche

Two due date assignment problems in scheduling a single machine

✍ Dvir Shabtay; George Steiner 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 199 KB

We study two single-machine scheduling problems: minimizing the sum of weighted earliness, tardiness and due date assignment penalties and minimizing the weighted number of tardy jobs and due date assignment costs. We prove that both problems are strongly NP-hard and give polynomial solutions for so

Determination of common due window locat

Determination of common due window location in a single machine scheduling problem

✍ Surya D. Liman; Shrikant S. Panwalkar; Sansern Thongmee 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 489 KB

Single-machine scheduling to minimize ab

Single-machine scheduling to minimize absolute deviation of completion times from a common due date

✍ Wlodzimierz Szwarc 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 518 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 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