✦ LIBER ✦

Theory Series || An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

✍ Scribed by J. Michael Moore

Book ID: 121363589
Publisher: INFORMS
Year: 1968
Tongue: English
Weight: 911 KB
Volume: 15
Category: Article
ISSN: 0025-1909
DOI: 10.2307/2628449

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing the number of late jobs on un

Minimizing the number of late jobs on unrelated machines

✍ Jianzhong Du; Joseph Y.-T Leung 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 413 KB

Application Series || A Heuristic Algori

Application Series || A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

✍ Herbert G. Campbell, Richard A. Dudek and Milton L. Smith 📂 Article 📅 1970 🏛 INFORMS 🌐 English ⚖ 341 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

Branch and Bound Algorithms for Single M

Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs

✍ H. A. J. Crauwels; C. N. Potts; D. Van Oudheusden; L. N. Van Wassenhove 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 395 KB

Branch and Bound Algorithms for Single M

Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs

✍ H. A. J. Crauwels; C. N. Potts; D. Van Oudheusden; L. N. Van Wassenhove 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 395 KB

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