✦ LIBER ✦

On the combinatorial structure of the permutation flow shop problem

✍ Scribed by F. Werner

Publisher: Springer
Year: 1991
Tongue: English
Weight: 638 KB
Volume: 35
Category: Article
ISSN: 0340-9422
DOI: 10.1007/bf01417515

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An adaptive branching rule for the permu

An adaptive branching rule for the permutation flow-shop problem

✍ C.N. Potts 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 820 KB

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

The permutation flow shop problem with s

The permutation flow shop problem with sum-of-completion times performance criterion

✍ Selcuk Karabati; Panagiotis Kouvelis 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 938 KB

Special cases of the flow-shop problem

✍ Wlodzimierz Szwarc 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 385 KB

## Abstract The paper examines all known special cases of the __m__X__n__ flow‐shop problem. It provides solution procedures to three new special cases along with the optimality proofs. The theory of the new special cases is based on the critical path concept.

Sequential algorithm for the solution of

Sequential algorithm for the solution of problems of combinatorial optimization on permutations

✍ A. N. Khodzinskii 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 618 KB

An approximation algorithm for the m-mac

An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times

✍ Eugeniusz Nowicki 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 423 KB