✦ LIBER ✦

Lower bounds for the earliness–tardiness scheduling problem on parallel machines with distinct due dates

✍ Scribed by Safia Kedad-Sidhoum; Yasmin Rios Solis; Francis Sourd

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Genetic algorithms for the optimal commo

✍ Liu Min; Wu Cheng 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 283 KB

A genetic algorithm for solving the sing

✍ Tung-I Tsai 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 151 KB

The single-machine earliness-tardiness s

✍ Dvir Shabtay; George Steiner 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 375 KB

Approximation Schemes for Scheduling Job

✍ Mikhail Y. Kovalyov; Frank Werner 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 116 KB

On Dual Based Lower Bounds for the Seque

✍ Antonio Alonso-Ayuso; Paolo Detti; Laureano F. Escudero; M. Teresa Ortuño 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 154 KB

A note on the complexity of single-machi

✍ Jinjiang Yuan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 119 KB