✦ LIBER ✦

Inapproximability results for no-wait job shop scheduling

✍ Scribed by Gerhard J. Woeginger

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two-machine flow shop scheduling problem

✍ J.-L. Bouquard; J.-C. Billaut; M.A. Kubzin; V.A. Strusevich 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 192 KB

A pseudo-polynomial algorithm for a two-

✍ Wieslaw Kubiak 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 273 KB

Job-shop scheduling to minimize total wa

✍ Chu, Chengbin ;Portmann, Marie-Claude 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 538 KB

Neural networks for job-shop scheduling

✍ T.M. Willems; J.E. Rooda 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 831 KB

Some no-wait shops scheduling problems:

✍ Chelliah Sriskandarajah; Pierre Ladet 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 911 KB

Surrogate duality relaxation for job sho

✍ M.L. Fisher; B.J. Lageweg; J.K. Lenstra; A.H.G.Rinnooy Kan 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 664 KB