✦ LIBER ✦

A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times

✍ Scribed by Bibo Yang; Joseph Geunes

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single machine scheduling problem with c

✍ Byung-Cheon Choi; Suk-Hun Yoon; Sung-Jin Chung 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 181 KB

Single machine scheduling with controlla

✍ L. R. Foulds; Tang Guochun 📂 Article 📅 1999 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 434 KB

Single machine scheduling with controlla

✍ Tang Guochun; L. R. Foulds 📂 Article 📅 1998 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 507 KB

The single-machine earliness-tardiness s

✍ Dvir Shabtay; George Steiner 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 375 KB

An approximation algorithm for a single-

✍ Eugeniusz Nowicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Scheduling jobs on a single machine with

✍ Stanisław Zdrzałka 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 294 KB