✦ LIBER ✦

On the complexity of scheduling jobs on dedicated resources to minimize set-up costs

✍ Scribed by Alan A. Bertossi

Book ID: 113162258
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 765 KB
Volume: 10
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(80)90133-7

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

On the complexity of project scheduling

On the complexity of project scheduling to minimize exposed time

✍ Pinker, Edieal; Szmerekovsky, Joseph; Tilson, Vera 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 317 KB

A note on multiproject scheduling to min

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

✍ T. S. Glickman 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 162 KB

Scheduling jobs with release times preem

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

✍ Nodari Vakhania 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 910 KB

Note on Scheduling with General Learning

Note on Scheduling with General Learning Curves to Minimize the Number of Tardy Jobs

✍ G. Mosheiov and J. B. Sidney 📂 Article 📅 2005 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 481 KB

Cost-minimal preemptive scheduling of in

Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints

✍ Roman Słowiński 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 729 KB