✦ LIBER ✦

A note on the optimal scheduling of two parallel processors

✍ Scribed by Victor Zaloom; David Vatz

Publisher: John Wiley and Sons
Year: 1975
Tongue: English
Weight: 202 KB
Volume: 22
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800220416

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling of stochastic tasks on two pa

Scheduling of stochastic tasks on two parallel processors

✍ Michael Pinedo; Gideon Weiss 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 457 KB 👁 1 views

A note on the influence of missing opera

A note on the influence of missing operations on scheduling problems

✍ N. Hefetz; I. Adiri 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 291 KB 👁 1 views

A note on the extension of a result on s

A note on the extension of a result on scheduling with secondary criteria

✍ Horace Heck; Stephen Roberts 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB 👁 1 views

A note on the optimal replacement time o

A note on the optimal replacement time of damaged devices

✍ Dror Zuckerman 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 1 views

A Note on an Optimality Property of the

A Note on an Optimality Property of the Regression Estimator

✍ Prof. Y. P. Chaubey; M. Singh; T. D. Dwivedi 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 2 views

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