✦ LIBER ✦

Bilevel programming applied to the flow shop scheduling problem

✍ Scribed by John K. Karlof; Wei Wang

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sevast'yanov's algorithm for the flow-sh

Sevast'yanov's algorithm for the flow-shop scheduling problem

✍ Helena Ramalhinho Lourenço 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 825 KB

A bilevel programming approach to the tr

A bilevel programming approach to the travelling salesman problem

✍ Patrice Marcotte; Gilles Savard; Frédéric Semet 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Counterexamples to optimal permutation s

Counterexamples to optimal permutation schedules for certain flow shop problems

✍ S. S. Panwalkar; M. L. Smith; C. R. Woollam 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

## Abstract It is well known that a minimal makespan permutation sequence exists for the __n__ × __3__ flow shop problem and for the __n__ × __m__ flow shop problem with no inprocess waiting when processing times for both types of problems are positive. It is shown in this paper that when the assum

Characterizing an optimal solution to th

Characterizing an optimal solution to the linear bilevel programming problem

✍ Yi-Hsin Liu; Stephen M. Hart 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 155 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

The connection between the bump number p

The connection between the bump number problem and flow-shop scheduling with precedence constraints

✍ G. Steiner 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 361 KB