𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Note on Scheduling Equal-Length Jobs to Maximize Throughput

✍ Scribed by Marek Chrobak; Christoph Dürr; Wojciech Jawor; Łukasz Kowalik; Maciej Kurowski

Publisher
Springer US
Year
2006
Tongue
English
Weight
53 KB
Volume
9
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the complexity of family sched
A note on the complexity of family scheduling to minimize the number of late jobs
✍ T. C. Edwin Cheng; Zhaohui Liu; Yakov M. Shafransky 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 65 KB 👁 2 views

The single-machine family scheduling problem of minimizing the number of late jobs has been known to be NP-hard, but whether it is NP-hard in the strong sense is cited as an open problem in several reviews. In this note, we prove that this problem is strongly NP-hard even if all set-up times and pro