✦ LIBER ✦

Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine

✍ Scribed by Prabuddha De; Jay B. Ghosh; Charles E. Wells

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 403 KB
Volume: 18
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(91)90009-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Polynomial time algorithms for minimizin

Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times

✍ Philippe Baptiste 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 102 KB 👁 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t