✦ LIBER ✦

Precedence Relations of the Flow-Shop Problem

✍ Scribed by Wlodzimierz Szwarc

Book ID: 123686671
Publisher: INFORMS
Year: 1981
Tongue: English
Weight: 319 KB
Volume: 29
Category: Article
ISSN: 0030-364X
DOI: 10.2307/170028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The two-machine flow shop problem with a

The two-machine flow shop problem with arbitrary precedence relations

✍ Graham B. McMahon; Chong-John Lim 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 542 KB

The three-machine flow-shop problem with

The three-machine flow-shop problem with arbitrary precedence relations

✍ Chong John Lim; Graham B. McMahon 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 440 KB

Flow Shop Scheduling Problems Under Mach

Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints

✍ A.A. Gladky; Y.M. Shafransky; V.A. Strusevich 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 138 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

The clustered flow-shop problem

✍ W. Szwarc 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 226 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.