✦ LIBER ✦

Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes

✍ Scribed by Chung, S.H.; Tai, Y.T.; Pearn, W.L.

Book ID: 120435517
Publisher: Taylor and Francis Group
Year: 2009
Tongue: English
Weight: 208 KB
Volume: 47
Category: Article
ISSN: 0020-7543
DOI: 10.1080/00207540802010807

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Makespan minimisation on parallel batch

Makespan minimisation on parallel batch processing machines with non-identical job sizes and release dates

✍ Ozturk, Onur; Espinouse, Marie-Laure; Mascolo, Maria Di; Gouin, Alexia 📂 Article 📅 2012 🏛 Taylor and Francis Group 🌐 English ⚖ 175 KB

Minimizing makespan and total completion

Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes

✍ Bayi Cheng; Shanlin Yang; Xiaoxuan Hu; Bo Chen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Scheduling unrelated parallel batch proc

✍ Li, XiaoLin; Huang, YanLi; Tan, Qi; Chen, HuaPing 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 569 KB

Heuristics for makespan minimization on

Heuristics for makespan minimization on parallel batch processing machines with unequal job ready times

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

Scheduling parallel batch processing mac

Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families

✍ Koh *, Shie-Gheun; Koo, Pyung-Hoi; Ha, Jae-Won; Lee, Woon-Seek 📂 Article 📅 2004 🏛 Taylor and Francis Group 🌐 English ⚖ 173 KB

Minimizing makespan on a single batching

Minimizing makespan on a single batching machine with release times and non-identical job sizes

✍ Shuguang Li; Guojun Li; Xiaoli Wang; Qiming Liu 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 214 KB

We consider the problem of scheduling jobs with release times and non-identical job sizes on a single batching machine; our objective is to minimize makespan. We present an approximation algorithm with worst-case ratio 2 + , where ¿ 0 can be made arbitrarily small.