✦ LIBER ✦

A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine

✍ Scribed by Liron Yedidsion; Dvir Shabtay; Moshe Kaspi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for scheduling

✍ C.N Potts; L.N Van Wassenhove 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 488 KB

Branch and Bound Algorithms for Single M

✍ H. A. J. Crauwels; C. N. Potts; D. Van Oudheusden; L. N. Van Wassenhove 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 395 KB

Branch and Bound Algorithms for Single M

✍ H. A. J. Crauwels; C. N. Potts; D. Van Oudheusden; L. N. Van Wassenhove 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 395 KB