✦ LIBER ✦

Permutation vs. non-permutation flow shop schedules

✍ Scribed by Chris N. Potts; David B. Shmoys; David P. Williamson

Book ID: 107918197
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 202 KB
Volume: 10
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(91)90014-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Simulated annealing for permutation flow

Simulated annealing for permutation flow-shop scheduling

✍ IH Osman; CN Potts 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 542 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

Permutation flow-shop theory revisited

✍ Wlodzimierz Szwarc 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 565 KB

On non-permutation solutions to some two

On non-permutation solutions to some two machine flow shop scheduling problems

✍ Vitaly A. Strusevich; Carin M. Zwaneveld 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 664 KB

Scheduling permutation flow shops using

Scheduling permutation flow shops using the Lagrangian relaxation technique

✍ Guandong Liu; Peter B. Luh; Richard Resch 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 97 KB

Flowshop sequencing with non-permutation

Flowshop sequencing with non-permutation schedules

✍ M. Tandon; P.T. Cummings; M.D. LeVan 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 680 KB