✦ LIBER ✦

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

✍ Scribed by T.C.E. Cheng

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 292 KB
Volume: 17
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(90)90009-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a single-machine optimal constant due

On a single-machine optimal constant due-date assignment and sequencing problem

✍ TCE Cheng 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 164 KB

This paper considers the problem of optimal constant due-date assignment and sequencing of jobs in a single-machine shop. We formulate the problem as a general constrained optimization problem and apply the Kuhn-Tucker conditions to find the optimal solution which is shown to be independent of the j

Optimal assignment of slack due-dates an

Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine

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

An improved dynamic programming algorith

An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date

✍ Jose A. Ventura; Michael X. Weng 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 195 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 the optimality of index priori

A note on the optimality of index priority rules for search and sequencing problems

✍ George J. Kyparisis; Christos Koulamas 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB