✦ LIBER ✦

Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance

✍ Scribed by Ju-Yong Lee; Yeong-Dae Kim

Book ID: 113553796
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 254 KB
Volume: 39
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2011.11.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 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

Minimizing maximum earliness and number

Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint

✍ Ehsan Molaee; Ghasem Moslehi; Mohammad Reisi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 413 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

Single‐machine scheduling to minimize ma

Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs

✍ J.N.D. Gupta; A.M.A. Hariri; C.N. Potts 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 163 KB