✦ LIBER ✦

Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness

✍ Scribed by Mikhail Y. Kovalyov; Frank Werner

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for common due

✍ Wen-qiang Xiao; Chung-Lun Li 📂 Article 📅 2002 🏛 Taylor and Francis Group 🌐 English ⚖ 199 KB

Two meta-heuristics for parallel machine

✍ İnci Sarıçiçek; Cenk Çelik 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 220 KB

Error bound for common due date assignme

✍ Jeffrey E. Diamond; T.C.E. Cheng 📂 Article 📅 2000 🏛 Taylor and Francis Group 🌐 English ⚖ 93 KB

A heuristic for parallel machine schedul

✍ Chung-Lun Li 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 418 KB

Note on Shim and Kim’s lower bounds for

✍ Jeffrey Schaller 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 186 KB

Lower bounds for the earliness–tardiness

✍ Safia Kedad-Sidhoum; Yasmin Rios Solis; Francis Sourd 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 217 KB