✦ LIBER ✦

Minimizing the weighted number of tardy jobs on a single machine with release dates

✍ Scribed by Rym M’Hallah; R.L. Bulfin

Book ID: 108117040
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 210 KB
Volume: 176
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2005.08.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 weighted number of early

Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem

✍ H.M. Soroush 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 352 KB

Minimum number of tardy jobs in single m

Minimum number of tardy jobs in single machine scheduling with release dates—an improved algorithm

✍ Thuruthickara C. John; Yih-Bor Wu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 352 KB

Minimizing number of tardy jobs on a sin

Minimizing number of tardy jobs on a single machine subject to periodic maintenance

✍ Wen-Jinn Chen 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Single-machine parallel-batching schedul

Single-machine parallel-batching scheduling with family jobs to minimize weighted number of tardy jobs

✍ Li, Shi-Sheng; Chen, Ren-Xia 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 347 KB