✦ LIBER ✦

A binary branch and bound algorithm to minimize maximum scheduling cost

✍ Scribed by Chandra, Charu; Liu, Zhixin; He, Jun; Ruohonen, Toni

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Project Scheduling under Time Dependent

✍ N.R. Achuthan; A. Hardjawidjaja 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 143 KB

A heuristic algorithm to minimize energy

✍ R.Meenakshi Sundaram; Lester Blair 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Bicriteria scheduling on a series-batchi

✍ Cheng He, Hao Lin, Yixun Lin, Ji Tian 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 149 KB

A branch and bound algorithm for schedul

✍ Kailiang Xu; Zuren Feng; Liangjun Ke 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 550 KB

A branch-and-bound algorithm to minimize

✍ Chengbin Chu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 945 KB

A multicriteria scheduling tool using a

✍ Raymond Bausch 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 244 KB