✦ LIBER ✦

Scheduling of deteriorating jobs with release dates to minimize the maximum lateness

✍ Scribed by Miao, Cuixia; Zhang, Yuzhong; Wu, Cuilian

Book ID: 118229584
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 240 KB
Volume: 462
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.08.022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note: Open-shop scheduling with release

Note: Open-shop scheduling with release dates to minimize maximum lateness

✍ Hans Kellerer; Thomas Tautenhahn; Gerhard Woeginger 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB 👁 2 views

We present the first polynomial-time algorithm for an open-shop problem with unit execution times, arbitrary release dates, and due dates. The objective is to minimize maximum lateness. 0 I995 John Wiley & Sons. Inc.

Two-agent single-machine scheduling with

Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness

✍ Yuan, J. J.; Ng, C. T.; Cheng, T. C. E. 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 215 KB

Single machine scheduling to minimize ma

Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints

✍ Zhixin Liu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 161 KB

On Scheduling with Ready Times and Due D

On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness

✍ Graham McMahon and Michael Florian 📂 Article 📅 1975 🏛 INFORMS 🌐 English ⚖ 272 KB

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

Deteriorating job scheduling to minimize

Deteriorating job scheduling to minimize the number of late jobs with setup times

✍ Wen-Chiung Lee; Jian-Bang Lin; Yau-Ren Shiau 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 193 KB