✦ LIBER ✦

Parallel dedicated machines scheduling with chain precedence constraints

✍ Scribed by Alessandro Agnetis; Hans Kellerer; Gaia Nicosia; Andrea Pacifici

Book ID: 113584130
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 445 KB
Volume: 221
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2012.03.040

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling jobs with simple precedence c

Scheduling jobs with simple precedence constraints on parallel machines

✍ Hoitomt, D.J.; Luh, P.B.; Max, E.; Pattipati, K.R. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 857 KB

Scheduling of uniform parallel machines

Scheduling of uniform parallel machines with s-precedence constraints

✍ Eun-Seok Kim 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 218 KB

Scheduling preemptive jobs with preceden

Scheduling preemptive jobs with precedence constraints on parallel machines

✍ Khaled Djellab 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 223 KB

On a parallel machine scheduling problem

On a parallel machine scheduling problem with precedence constraints

✍ Isto Aho; Erkki Mäkinen 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 173 KB

UET-scheduling with chain-type precedenc

UET-scheduling with chain-type precedence constraints

✍ Klaus Jansen; Gerhard J. Woeginger; Zhongliang Yu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Scheduling problems for parallel dedicat

Scheduling problems for parallel dedicated machines under multiple resource constraints

✍ H. Kellerer; V.A. Strusevich 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 249 KB

The paper considers scheduling problems for parallel dedicated machines subject to resource constraints. A fairly complete computational complexity classiÿcation is obtained, a number of polynomial-time algorithms are designed. For the problem with a ÿxed number of machines in which a job uses at mo