✦ LIBER ✦

Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs

✍ Scribed by C. T. Ng; T. C. E. Cheng; J. J. Yuan

Book ID: 111540545
Publisher: Springer US
Year: 2003
Tongue: English
Weight: 113 KB
Volume: 6
Category: Article
ISSN: 1094-6136
DOI: 10.1023/a:1024284828374

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Open shop scheduling to minimize the num

Open shop scheduling to minimize the number of late jobs

✍ Christos Koulamas; George J. Kyparisis 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 63 KB 👁 2 views

We develop polynomial algorithms for several cases of the NP-hard open shop scheduling problem of minimizing the number of late jobs by utilizing some recent results for the open shop makespan problem. For the two machine common due date problem, we assume that either the machines or the jobs are or

Scheduling linear deteriorating jobs to

Scheduling linear deteriorating jobs to minimize the number of tardy jobs

✍ Abbasali Jafari, Ghasem Moslehi 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 255 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

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

Two-machine flow shop scheduling with co

Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

✍ Wing-Kwan Yeung; Ceyda Oğuz; Tai-Chiu Edwin Cheng 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

Scheduling unit time open shops to minim

Scheduling unit time open shops to minimize the weighted number of late jobs

✍ Peter Brucker; Bernd Jurisch; Thomas Tautenhahn; Frank Werner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 365 KB