✦ LIBER ✦

Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs

✍ Scribed by Wenjie Li; Zhenkun Zhang; Hailing Liu; Jinjiang Yuan

Book ID: 113663359
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 183 KB
Volume: 112
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2012.03.015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved online algorithms for the batch

Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs

✍ Wenjie Li, Jinjiang Yuan 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 250 KB

Scheduling jobs on a single batch proces

Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective

✍ Dauzère-Pérès, Stéphane; Mönch, Lars 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 305 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

Online scheduling of equal length jobs o

Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart

✍ Liu, Hailing; Yuan, Jinjiang 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 869 KB

Genetic algorithm based scheduling of pa

Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness

✍ Balasubramanian, Hari; Mönch, Lars; Fowler, John; Pfund, Michele 📂 Article 📅 2004 🏛 Taylor and Francis Group 🌐 English ⚖ 190 KB

Maximizing the weighted number of on-tim

Maximizing the weighted number of on-time jobs in single machine scheduling with time windows

✍ C. Koulamas 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 541 KB

The problem of maximizing the weighted number of on-time jobs on a single machine with time windows (STW) is shown to be strongly NP-hard. An efficient. heuristic is presented for STW. Computational experiments indicate that the performance of the heuristic is quite good.