✦ LIBER ✦

Sequence-dependent flow shop scheduling problem minimising the number of tardy jobs

✍ Scribed by Varmazyar, Mohsen; Salmasi, Nasser

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sequence-dependent setup time flexible j

✍ Mousakhani, M. 📂 Article 📅 2013 🏛 Taylor and Francis Group 🌐 English ⚖ 524 KB

Stochastic flow-shop scheduling with min

✍ Ali Elyasi… 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 208 KB

Concurrent Open Shop Scheduling to Minim

✍ C. T. Ng; T. C. E. Cheng; J. J. Yuan 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 113 KB

No-wait flowshop scheduling problem to m

✍ Aldowaisan, Tariq A.; Allahverdi, Ali 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 637 KB

Scheduling algorithms to minimize the nu

✍ Hyun-Seon Choi; Dong-Ho Lee 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 267 KB

Two-machine flow shop scheduling with co

✍ Wing-Kwan Yeung; Ceyda Oğuz; Tai-Chiu Edwin Cheng 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB