✦ LIBER ✦

Elimination conditions and lower bounds for the permutation flow-shop sequencing problem

✍ Scribed by Yue Minyi; Han Jiye; Chen Yongmao

Book ID: 112586126
Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 1985
Tongue: English
Weight: 600 KB
Volume: 2
Category: Article
ISSN: 0168-9673
DOI: 10.1007/bf01665847

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two branch and bound algorithms for the

✍ Jacques Carlier; Ismaïl Rebaï 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 957 KB

A computational study of the permutation

✍ Talel Ladhari; Mohamed Haouari 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 262 KB

A branch and bound procedure for the ree

✍ Jen-Shiang Chen 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 184 KB

A branch-and-bound algorithm for permuta

✍ ROGER Z. RÍOS-MERCADO; JONATHAN F. Bard 📂 Article 📅 1999 🏛 Taylor and Francis Group 🌐 English ⚖ 172 KB

A new optimal algorithm for the permutat

✍ Shusuke Okamoto; Ichie Watanabe; Hajime Iizuka 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 326 KB

A hybrid cuckoo search via Lévy flights

✍ Li, Xiangtao; Yin, Minghao 📂 Article 📅 2013 🏛 Taylor and Francis Group 🌐 English ⚖ 547 KB