✦ LIBER ✦

A heuristic for a batch processing machine scheduled to minimise total completion time with non-identical job sizes

✍ Scribed by Pei-Chann Chang; Hui-Mei Wang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing makespan and total completion

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

Minimizing total completion time on a ba

✍ Vijaya Chandru; Chung-Yee Lee; Reha Uzsoy 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 420 KB

A constraint programming approach for a

✍ Arnaud Malapert; Christelle Guéret; Louis-Martin Rousseau 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 902 KB

GRASP with path-relinking for the non-id

✍ F. J. Rodriguez, C. Blum, C. García-Martínez, M. Lozano 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 597 KB

On-Line Scheduling a Batch Processing Sy

✍ Bo Chen; Xiaotie Deng; Wenan Zang 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 97 KB

Local search heuristics for single machi

✍ H.A.J. Crauwels; C.N. Potts; L.N. Van Wassenhove 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 75 KB