𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing the weighted number of late jobs in UET open shops

✍ Scribed by Gábor Galambos; Gerhard J. Woeginger

Publisher
Springer
Year
1995
Tongue
English
Weight
310 KB
Volume
41
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On complexity of minimizing weighted num
On complexity of minimizing weighted number of late jobs in unit time open shops
✍ A.A. Gladky 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 295 KB

We show that the problem of minimizing the weighted number of late jobs in open shop with given release dates and unit time operations is strongly .I '?-hard. The complexity status of this problem was unknown.

Open shop scheduling to minimize the num
Open shop scheduling to minimize the number of late jobs
✍ Christos Koulamas; George J. Kyparisis 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 63 KB 👁 2 views

We develop polynomial algorithms for several cases of the NP-hard open shop scheduling problem of minimizing the number of late jobs by utilizing some recent results for the open shop makespan problem. For the two machine common due date problem, we assume that either the machines or the jobs are or