✦ LIBER ✦

A Dynamic Programming Algorithm for Scheduling Jobs in a Two-Machine Open Shop with an Availability Constraint

✍ Scribed by T. Lorigeon, J-C Billaut and J-L Bouquard

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved heuristic for two-machine fl

✍ Hatem Hadda; Najoua Dridi; Sonia Hajri-Gabouj 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 258 KB

A note on two-machine no-wait flow shop

✍ Chuanli Zhao; Hengyong Tang 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 220 KB

A polynomial-time approximation scheme f

✍ Joachim Breit 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 202 KB

A polynomial algorithm for the two machi

✍ Peter Brucker 📂 Article 📅 1994 🏛 Springer 🌐 German ⚖ 289 KB

A best possible online algorithm for sch

✍ Yuan, Junling; Li, Wenhua; Yuan, Jinjiang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 237 KB

A({(frac 4 3) -})approximation algorithm

✍ Hatem Hadda 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 288 KB