✦ LIBER ✦

Level scheduling to minimize schedule length on lots of unit-time jobs

✍ Scribed by Michael B. Richey

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 148 KB
Volume: 53
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(91)90097-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling lots of dependent unit-time o

Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length

✍ Tadeusz J. Sawik 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 646 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

Schedule of n jobs on two identical mach

Schedule of n jobs on two identical machines to minimize weighted mean flow time

✍ Bahram Alidaee 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Scheduling with two job classes and setu

Scheduling with two job classes and setup times to minimize the number of tardy jobs

✍ Jatinder N.D. Gupta; Johnny C. Ho 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 969 KB

This paper considers the problem of minimizing the number of tardy jobs to be processed on a single machine with two job classes where a job's setup time depends on its job class. This is an increasinbly important problem due to the growing popularity of group technology manufacturing techniques, wh

Scheduling jobs with release times preem

Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs

✍ Nodari Vakhania 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 910 KB

On the complexity of scheduling unit-tim

On the complexity of scheduling unit-time jobs with OR-precedence constraints

✍ Berit Johannes 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 204 KB