✦ LIBER ✦

Complexity of scheduling problems with multi-purpose machines

✍ Scribed by Peter Brucker; Bernd Jurisch; Andreas Krämer

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Job-shop scheduling with multi-purpose m

✍ P. Brucker; R. Schlie 📂 Article 📅 1990 🏛 Springer Vienna 🌐 English ⚖ 314 KB

Complexity of single machine, multi-crit

✍ Chuen-Lung Chen; Robert L. Bulfin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 688 KB

Lower bounds for the job-shop scheduling

✍ Bernd Jurisch 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 765 KB

On the complexity of scheduling problems

✍ Bernstein, D.; Rodeh, M.; Gertner, I. 📂 Article 📅 1989 🏛 IEEE 🌐 English ⚖ 623 KB

A special purpose multi-criteria heurist

✍ Guzin Ozdagoglu, Sabri Erdem, Latif Salum 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 225 KB

Multi-product unrelated parallel machine

✍ Ramezanian, R.; Saidi-Mehrabad, M. 📂 Article 📅 2012 🏛 Elsevier 🌐 English ⚖ 888 KB