𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs

✍ Scribed by Nodari Vakhania


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
910 KB
Volume
37
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A note on the complexity of family sched
✍ 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