A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
With the increasing popularity of large-scale distributed computing networks, a new aspect has to be considered for scheduling problems: machines may not be available permanently, but may be withdrawn and reappear later. We give several results for completion time based objectives: 1. we show that scheduling independent jobs on identical machines with online failures to minimize the sum of completion times is (8/7 − )-inapproximable, 2. we give a nontrivial sufficient condition on machinedoi:10.1007/978-3-540-74466-5_23 fatcat:ucqqax3g4zel3bmv6psxpv6nhq