✦ LIBER ✦

Computational complexity of the single processor makespan minimization problem with release dates and job-dependent learning

✍ Scribed by Rudek, R

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The bounded single-machine parallel-batc

✍ Q.Q. Nong; C.T. Ng; T.C.E. Cheng 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 155 KB

On single processor scheduling problems

✍ Rudek, Radosław 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 268 KB

The computational complexity analysis of

✍ Rudek, Radosław 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 507 KB

Minimizing the maximum lateness in a sin

✍ Zhongyi Jiang; Fangfang Chen; Chunqing Wu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Properties of optimal schedules for the

✍ A. A. Lazarev; A. G. Kvaratskhelia 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 202 KB

Simulated-annealing heuristics for the s

✍ Chin-Chia Wu; Peng-Hsiang Hsu; Kunjung Lai 📂 Article 📅 2011 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 252 KB