✦ LIBER ✦

Network flow approaches to pre-emptive open-shop scheduling problems with time-windows

✍ Scribed by A. Sedeño-Noda; D. Alcaide; C. González-Martín

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A decomposition approach to job-shop sch

✍ GangGang Niu; ShuDong Sun; Pascal Lafon; HongAn Yang 📂 Article 📅 2011 🏛 SP Science China Press 🌐 English ⚖ 602 KB

Two machine flow shop scheduling problem

✍ Burton D. Corwin; Augustine O. Esogbue 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 605 KB

A new approach to two-machine flow shop

✍ Sanja Petrovic; Xueyan Song 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 293 KB

A simulated annealing algorithm approach

✍ H. S. Mirsanei; M. Zandieh; M. J. Moayed; M. R. Khabbazi 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 624 KB

A discrete time exact solution approach

✍ C. Gicquel; L. Hege; M. Minoux; W. van Canneyt 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 191 KB