✦ LIBER ✦

Scheduling of coupled tasks with unit processing times

✍ Scribed by J. Blazewicz; K. Ecker; T. Kis; C. N. Potts; M. Tanas; J. Whitehead

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 496 KB
Volume: 13
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-010-0167-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling tasks with sequence-dependent

Scheduling tasks with sequence-dependent processing times

✍ Lucio Bianco; Salvatore Ricciardelli; Giovanni Rinaldi; Antonio Sassano 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 400 KB

Two-machine shop scheduling with zero an

Two-machine shop scheduling with zero and unit processing times

✍ Irene N Lushchakova; Svetlana A Kravchenko 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 206 KB

A note on “scheduling unit-time tasks wi

A note on “scheduling unit-time tasks with integer release times and deadlines”

✍ George Steiner; Scott Yeomans 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 119 KB

Real-time task scheduling with fuzzy dea

Real-time task scheduling with fuzzy deadlines and processing times

✍ Marin Litoiu; Roberto Tadei 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 116 KB

A set of n independent and periodical tasks are considered. The processing times and the deadlines are described by fuzzy numbers. We try to ÿnd the optimal assignment of priorities not to miss deadlines. We manage the problem in two ways: ÿrst, we solve the problem by introducing the new cost funct

Scheduling with step-improving processin

Scheduling with step-improving processing times

✍ T.C. Edwin Cheng; Yong He; Han Hoogeveen; Min Ji; Gerhard J. Woeginger 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 135 KB

On the complexity of scheduling tasks wi

On the complexity of scheduling tasks with discrete starting times

✍ J Mark Keil 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 210 KB