✦ LIBER ✦

Scheduling with batching: minimizing the weighted number of tardy jobs

✍ Scribed by Dorit S. Hochbaum; Dan Landy

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 521 KB
Volume: 16
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(94)90063-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 number of tardy jobs in i

Minimizing the number of tardy jobs in identical machine scheduling

✍ Gürsel A. Süer; Eduardo Báez; Zbigniew Czajkiewicz 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 285 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

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

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