✦ LIBER ✦

Minimizing makespan on a single batch processing machine with nonidentical job sizes

✍ Scribed by Guochuan Zhang; Xiaoqiang Cai; C.-Y Lee; C.K Wong

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 145 KB
Volume: 48
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing flow time on a single machine

Minimizing flow time on a single machine with job classes and setup times

✍ A. J. Mason; E. J. Anderson 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 949 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

Scheduling jobs with random processing t

Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties

✍ X. Cai; F. S. Tu 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 942 KB

We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time ofeach job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objec