✦ LIBER ✦

Nondominated Schedules for a Job-Shop with Two Competing Users

✍ Scribed by A. Agnetis; P.B. Mirchandani; D. Pacciarelli; A. Pacifici

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling batches with simultaneous job

✍ C. N. Potts; V. A. Strusevich; T. Tautenhahn 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 210 KB 👁 2 views

A polynomial algorithm for the two machi

✍ Peter Brucker 📂 Article 📅 1994 🏛 Springer 🌐 German ⚖ 289 KB

A two-machine flow shop scheduling probl

✍ Eugeniusz Nowicki; Stanisław Zdrzałka 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 639 KB

A two-stage genetic algorithm for large

✍ Yong Ming Wang; Nan Feng Xiao; Hong Li Yin; En Liang Hu; Cheng Gui Zhao; Yan Ron 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 251 KB

A two-stage genetic algorithm for multi-

✍ Voratas Kachitvichyanukul; Siriwan Sitthitham 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 295 KB

A polynomial algorithm for a two-machine

✍ Svetlana A. Kravchenko 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 462 KB