✦ LIBER ✦

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

✍ Scribed by Jen-Shiang Chen

Publisher: Springer
Year: 2005
Tongue: English
Weight: 184 KB
Volume: 29
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-005-0017-x

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

On the connection between a cyclic job s

On the connection between a cyclic job shop and a reentrant flow shop scheduling problem

✍ George Steiner; Zhihui Xue 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 234 KB

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

A branch-and-bound algorithm with fuzzy

A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem

✍ Jinliang Cheng; Hiroshi Kise; Hironori Matsumoto 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 697 KB

This paper considers an m-machine permutation flowshop scheduling problem of minimizing the makespan. This classical scheduling problem is still important in modem manufacturing systems, and is well known to be intractable (i.e., NP-hard). In fact branch-and-bound algorithms developed so far for thi

An improved branch and bound procedure f

An improved branch and bound procedure for n × m flow shop problems

✍ S. S. Panwalkar; A. W. Khan 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

A new lower bound for the job-shop sched

A new lower bound for the job-shop scheduling problem

✍ Peter Brucker; Bernd Jurisch 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 611 KB