𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on multiproject scheduling to minimize the cost of supplemental external resources

✍ Scribed by T. S. Glickman

Book ID
105399830
Publisher
Springer
Year
1978
Tongue
English
Weight
162 KB
Volume
22
Category
Article
ISSN
0340-9422

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

A note on the equivalence of two heurist
A note on the equivalence of two heuristics to minimize total tardiness
✍ Bahram Alidaee; Suresh Gopalan πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 272 KB

Over the last thirty years, many researchers have studied single machine static and deterministic scheduling with the objective of minimizing total tardiness. It has been established that the tardiness problem is NP-hard. So it is unlikely that a polynomial time algorithm can be found for developing