✦ LIBER ✦

Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs

✍ Scribed by Peter Brucker; Svetlana A. Kravchenko

Publisher: Springer Netherlands
Year: 2006
Tongue: English
Weight: 705 KB
Volume: 5
Category: Article
ISSN: 1570-1166
DOI: 10.1007/s10852-005-9011-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling unit time open shops to minim

Scheduling unit time open shops to minimize the weighted number of late jobs

✍ Peter Brucker; Bernd Jurisch; Thomas Tautenhahn; Frank Werner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Single machine batch scheduling to minim

Single machine batch scheduling to minimize the weighted number of late jobs

✍ Peter Brucker; Mikhail Y. Kovalyov 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 419 KB

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

Single machine scheduling to minimize th

Single machine scheduling to minimize the number of late jobs under uncertainty

✍ Shao Chin Sung; Milan Vlach 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 227 KB

In this paper, we deal with the problem of sequencing a ÿnite number of jobs for processing by a single machine with the objective of minimizing the number of jobs that are not completed by their due dates. We propose a rather general model based on an algebraic approach. By specifying suitable bina

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

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