✦ LIBER ✦

Scheduling || A General Bounding Scheme for the Permutation Flow-Shop Problem

✍ Scribed by B. J. Lageweg, J. K. Lenstra and A. H. G. Rinnooy Kan

Book ID: 123686557
Publisher: INFORMS
Year: 1978
Tongue: English
Weight: 474 KB
Volume: 26
Category: Article
ISSN: 0030-364X
DOI: 10.2307/169891

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound procedure for the ree

A branch and bound procedure for the reentrant permutation flow-shop scheduling problem

✍ Jen-Shiang Chen 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 184 KB

A two-machine permutation flow shop sche

A two-machine permutation flow shop scheduling problem with buffers

✍ Czesław Smutnicki 📂 Article 📅 1998 🏛 Springer 🌐 German ⚖ 761 KB

A hybrid harmony search algorithm for th

A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem

✍ Ling Wang; Quan-Ke Pan; M. Fatih Tasgetiren 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 547 KB

A hybrid algorithm to minimize makespan

A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem

✍ Ahmadizar, Fardin; Barzinpour, Farnaz 📂 Article 📅 2010 🏛 Atlantis Press 🌐 English ⚖ 332 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

Two branch and bound algorithms for the

Two branch and bound algorithms for the permutation flow shop problem

✍ Jacques Carlier; Ismaïl Rebaï 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 957 KB