✦ LIBER ✦

A dynamic programming formulation for the one machine sequencing problem

✍ Scribed by P.J. Weeda

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 222 KB
Volume: 2
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(78)90045-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic programming approach to the sing

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

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

A procedure for the one-machine sequenci

A procedure for the one-machine sequencing problem with dependent jobs

✍ Stéphane Dauzère-Pérès 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 650 KB

A hybrid algorithm for the one machine s

A hybrid algorithm for the one machine sequencing problem to minimize total tardiness

✍ V. Srinivasan 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 568 KB

In a recent paper, Hamilton Emmons has established theorems relating to the order in which pairs of jobs are to be processed in an optimal schedule to minimize the total tardiness of performing n jobs on one machine. Using these theorems, the algorithm of this paper determines the precedence relatio

A new integer programming formulation fo

A new integer programming formulation for the permutation flowshop problem

✍ A.M. Frieze; J. Yadegar 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 447 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 dynamic programming algorithm for the

A dynamic programming algorithm for the bilevel knapsack problem

✍ Luce Brotcorne; Saïd Hanafi; Raïd Mansi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 940 KB