✦ LIBER ✦

A new optimal algorithm for the permutation flow-shop problem and its parallel implementation

✍ Scribed by Shusuke Okamoto; Ichie Watanabe; Hajime Iizuka

Book ID: 107965797
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 326 KB
Volume: 27
Category: Article
ISSN: 0360-8352
DOI: 10.1016/0360-8352(94)90232-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 new parallel algorithm for the n-Job,

A new parallel algorithm for the n-Job, m-machine flow-shop scheduling problem

✍ Shusuke Okamoto; Ichie Watanabe; Hajime Iizuka 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 977 KB

A computational study with a new algorit

A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times

✍ Jinliang Cheng; George Steiner; Paul Stephenson 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 181 KB

A multi-restart iterated local search al

A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time

✍ Dong, Xingye; Chen, Ping; Huang, Houkuan; Nowak, Maciek 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 353 KB

A Parallel Implementation of the Push-Re

A Parallel Implementation of the Push-Relabel Algorithm for the Maximum Flow Problem

✍ R. Anderson; J.C. Setubal 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1002 KB

We describe an efficient parallel implementation of the pushrelabel maximum flow algorithm for a shared-memory multiprocessor. Our main technical innovation is a method that allows the "global relabeling" heuristic to be executed concurrently with the main algorithm; this heuristic is essential for