✦ LIBER ✦

Evaluation of scheduling algorithms for resources with high set-up time

✍ Scribed by D.P. Bovet; M. Petrini

Book ID: 107989300
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 983 KB
Volume: 5
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(80)90088-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for problems in

Approximation algorithms for problems in scheduling with set-ups

✍ Srikrishnan Divakaran; Michael Saks 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 146 KB

A heuristic for preemptive scheduling wi

A heuristic for preemptive scheduling with set-up times

✍ G. J. Wöginger; Z. Yu 📂 Article 📅 1992 🏛 Springer Vienna 🌐 English ⚖ 450 KB

Scheduling a single fire fighting resour

Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times

✍ Costas P. Pappis; Nikolaos Panagiotis Rachaniotis 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 335 KB

A Tabu Search Algorithm for Single Machi

A Tabu Search Algorithm for Single Machine Scheduling with Release Times, Due Dates, and Sequence-Dependent Set-up Times

✍ H. J. Shin; C.-O. Kim; S. S. Kim 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 126 KB

A standard task graph set for fair evalu

A standard task graph set for fair evaluation of multiprocessor scheduling algorithms

✍ Takao Tobita; Hironori Kasahara 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 587 KB

A 'standard task graph set' is proposed for fair evaluation of multiprocessor scheduling algorithms. Developers of multiprocessor scheduling algorithms usually evaluate them using randomly generated task graphs. This makes it di cult to compare the performance of algorithms developed in di erent res

An approximation algorithm for identical

An approximation algorithm for identical parallel machine scheduling with resource dependent processing times

✍ Hans Kellerer 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 119 KB