✦ LIBER ✦

The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard

✍ Scribed by T.C.E. Cheng; C.T. Ng; J.J. Yuan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the single machine serial batc

✍ C.T Ng; T.C.E Cheng; J.J Yuan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 73 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

A hybrid genetic algorithm for the singl

✍ Veronique Sels; Mario Vanhoucke 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 343 KB