✦ LIBER ✦

Optimal Two-Machine Orderings in the 3× n Flow-Shop Problem

✍ Scribed by Wlodzimierz Szwarc

Book ID: 123686268
Publisher: INFORMS
Year: 1977
Tongue: English
Weight: 246 KB
Volume: 25
Category: Article
ISSN: 0030-364X
DOI: 10.2307/169548

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal Elimination Methods in the m× n

Optimal Elimination Methods in the m× n Flow-Shop Scheduling Problem

✍ Wlodzimierz Szwarc 📂 Article 📅 1973 🏛 INFORMS 🌐 English ⚖ 787 KB

The two-machine total completion time fl

The two-machine total completion time flow shop problem

✍ F. Della Croce; V. Narayan; R. Tadei 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 691 KB

Extreme solutions of the two machine flo

Extreme solutions of the two machine flow-shop problem

✍ Wlodzimierz Szwarc 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 465 KB

A special case of the 3 × n flow shop pr

A special case of the 3 × n flow shop problem

✍ Fennell Burns; John Rooker 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB

## Abstract Johnson [2] in 1954 solved the two machine flow shop problem by giving an argument for a sufficient condition of optimality and by stating an efficient algorithm which produces a solution via satisfaction of the sufficient condition. Moreover, Johnson solved two special cases of the cor

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

Approximations for the Two-Machine Cross

Approximations for the Two-Machine Cross-Docking Flow Shop Problem

✍ Prot, D.; Rapine, C. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 495 KB