✦ LIBER ✦

Two–machine flowshop minimum–length scheduling problem with random and bounded processing times

✍ Scribed by Ali Allahverdi; Yuri Sotskov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristics for the two-machine flowshop

✍ Ali Allahverdi; Harun Aydilek 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 870 KB

A polynomial time heuristic for the two-

✍ Aydilek, Harun; Allahverdi, Ali 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 390 KB

Two-machine flowshop scheduling with fle

✍ Uruk, Zeynep; Gultekin, Hakan; Akturk, M. Selim 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 644 KB

A single-machine scheduling problem with

✍ S. Chakravarthy 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB

Hybrid flowshop scheduling with machine

✍ J. Behnamian; S.M.T. Fatemi Ghomi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 744 KB

A two-machine flowshop scheduling proble

✍ Chin-Chia Wu; Wen-Hung Wu; Peng-Hsiang Hsu; Kunjung Lai 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 219 KB