✦ LIBER ✦

On the minimization of the weighted number of tardy jobs with random processing times and deadline

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

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling with batching: minimizing the

Scheduling with batching: minimizing the weighted number of tardy jobs

✍ Dorit S. Hochbaum; Dan Landy 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 521 KB

Heterogeneous-criteria scheduling: Minim

Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time

✍ Jon M. Peha 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 981 KB

Scheduling with two job classes and setu

Scheduling with two job classes and setup times to minimize the number of tardy jobs

✍ Jatinder N.D. Gupta; Johnny C. Ho 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 969 KB

This paper considers the problem of minimizing the number of tardy jobs to be processed on a single machine with two job classes where a job's setup time depends on its job class. This is an increasinbly important problem due to the growing popularity of group technology manufacturing techniques, wh

Minimizing the expected weighted number

Minimizing the expected weighted number of tardy jobs in stochastic flow shops

✍ O.J. Boxma; F.G. Forst 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 492 KB

Single-machine scheduling to minimize th

Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs

✍ Chung-Lun Li; T.C.E. Cheng; Z.-L. Chen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 866 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