✦ LIBER ✦

Lower bounds for single-machine scheduling problems

✍ Scribed by Reza H. Ahmadi; Uttarayan Bagchi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A greedy heuristic for bicriterion singl

✍ Pei Chann (michael) Chang; Han Chau (garry) Lee 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 617 KB

Lower bounds for arithmetic problems

✍ João Meidânis 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 543 KB

A new lower bound for the job-shop sched

✍ Peter Brucker; Bernd Jurisch 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 611 KB

An improved lower bound for a bi-criteri

✍ Jin Yan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 133 KB

Lower bounds for the economic lot schedu

✍ Sven Axsäter 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 341 KB

A GRASP™ for a difficult single machine

✍ Thomas A. Feo; Krishnamurthi Venkatraman; Jonathan F. Bard 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 976 KB