✦ LIBER ✦

Dynamic programming approach to the single-machine sequencing problem with different due-dates

✍ Scribed by T.C.E. Cheng

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 346 KB
Volume: 19
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(90)90001-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Two machine flow shop scheduling problem

Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach

✍ Burton D. Corwin; Augustine O. Esogbue 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 605 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

On sequencing with earliest starts and d

On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem

✍ Paul Bratley; Michael Florian; Pierre Robillard 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 585 KB

Bi-criteria single machine scheduling pr

Bi-criteria single machine scheduling problem with a learning effect: Aneja–Nair method to obtain the set of optimal sequences

✍ V. Mani; Pei Chann Chang; Shih Hsin Chen 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 519 KB

## a b s t r a c t In this paper, we consider the bi-criteria single machine scheduling problem of n jobs with a learning effect. The two objectives considered are the total completion time (TC ) and total absolute differences in completion times (TADC ). The objective is to find a sequence that pe