✦ LIBER ✦

The Bounded Single-Machine Parallel-batching Scheduling Problem with Family Jobs for Minimizing Makespan

✍ Scribed by Jintao Meng; Xiaoxu Lu

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

Single machine batch scheduling problem

✍ J. J. Yuan; Z. H. Liu; C. T. Ng; T. C. E. Cheng 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 315 KB

Heuristics for makespan minimization on

✍ Purushothaman Damodaran; Mario C. Velez-Gallego 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 537 KB

A hybrid genetic algorithm to minimize m

✍ Fuh-Der Chou; Pei-Chann Chang; Hui-Mei Wang 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 206 KB

Single-machine scheduling with deteriora

✍ Xiuli Wang; T.C. Edwin Cheng 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 226 KB

On-line problems of minimizing makespan

✍ Shi Yongqiang; Yao Enyu 📂 Article 📅 2005 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 348 KB