A Framework for Scheduling with Online Availability

Abstract. 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

• Type: Conference
• Year: 2007
• Where: EUROPAR
• Authors: Florian Diedrich, Ulrich M. Schwarz
• Keywords: Completion Time, EUROPAR 2007, Large-scale Distributed Computing, Scheduling Problems