✦ LIBER ✦

Minimizing the weighted number of tardy task units

✍ Scribed by Joseph Y.-T. Leung; Vincent K.M. Yu; W.-D. Wei

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 694 KB
Volume: 51
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)00037-m

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

Minimizing the number of tardy job units

Minimizing the number of tardy job units under release time constraints

✍ Dorit S. Hochbaum; Ron Shamir 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 882 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

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

Minimizing the number of tardy jobs in s

Minimizing the number of tardy jobs in single machine sequencing

✍ Ahmad H. Sharary; Nejib Zaguia 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 568 KB

A set P of n jobs has to be processed without preemption, one job at a time, on a single machine. The weight and processing time of each job is one. Furthermore, the jobs are subject to precedence constraints represented by a given ordered set (P, <). In a feasible schedule a job is called a tardy j

Minimizing the number of tardy jobs for

Minimizing the number of tardy jobs for m parallel machines

✍ Johnny C. Ho; Yih-Long Chang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 794 KB