✦ LIBER ✦

Rescheduling to minimize makespan on a changing number of identical processors

✍ Scribed by Craig A. Tovey

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 491 KB
Volume: 33
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800330414

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

Using Lagrangean relaxation to minimize

Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine

✍ Stéphane Dauzère-Pérès; Marc Sevaux 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

Scheduling on a single machine with a si

Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs

✍ I. Adiri; E. Frostig; A. H. G. Rinnooy Kan 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 412 KB 👁 2 views