𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on the scheduling with two families of jobs

✍ Scribed by J. J. Yuan; W. P. Shang; Q. Feng

Publisher
Springer US
Year
2005
Tongue
English
Weight
179 KB
Volume
8
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