✦ LIBER ✦

On the complexity of scheduling problems for parallel/pipelined machines

✍ Scribed by Bernstein, D.; Rodeh, M.; Gertner, I.

Book ID: 119772216
Publisher: IEEE
Year: 1989
Tongue: English
Weight: 623 KB
Volume: 38
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.29469

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristic algorithms for a complex paral

Heuristic algorithms for a complex parallel machine scheduling problem

✍ Zoltán Blázsik; Csanád Imreh; Zoltán Kovács 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 145 KB

Scheduling Parallel Machines for the Cus

Scheduling Parallel Machines for the Customer Order Problem

✍ Jaehwan Yang; Marc E. Posner 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 219 KB

Tight bounds for the identical parallel

Tight bounds for the identical parallel machine scheduling problem

✍ Mohamed Haouari; Anis Gharbi; Mahdi Jemmali 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

On the approximate tradeoff for bicriter

On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems

✍ Eric Angel; Evripidis Bampis; Alexander Kononov 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 305 KB

We consider multiobjective scheduling problems, i.e. scheduling problems that are evaluated with respect to many cost criteria, and we are interested in determining a trade-o (Pareto curve) among these criteria. We study two types of bicriteria scheduling problems: single-machine batching problems a

Size-reduction heuristics for the unrela

Size-reduction heuristics for the unrelated parallel machines scheduling problem

✍ Luis Fanjul-Peyro; Rubén Ruiz 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 297 KB

VARIABLE NEIGHBORHOOD DESCENT FOR THE UN

VARIABLE NEIGHBORHOOD DESCENT FOR THE UNRELATED PARALLEL MACHINE SCHEDULING PROBLEM

✍ CHARALAMBOUS, CHRISTOFOROS; FLESZAR, KRZYSZTOF 📂 Article 📅 2012 🏛 World Scientific Publishing Company 🌐 English ⚖ 286 KB