## Abstract

Preemptive scheduling problems on parallel machines are classic problems. Given the goal of minimizing the makespan, they are polynomially solvable even for the most general model of unrelated machines. In these problems, a set of jobs is to be assigned to be executed on a set of m machines. A job can be split into parts arbitrarily and these parts are to be assigned to time slots on the machines without parallelism, that is, for every job, at most one of its parts can be processed at each time. Motivated by sensitivity analysis and online algorithms, we investigate the problem of designing robust algorithms for constructing preemptive schedules. Robust algorithms receive one piece of input at a time. They may change a small portion of the solution as an additional part of the input is revealed. The capacity of change is based on the size of the new input. For scheduling problems, the maximum ratio between the total size of the jobs (or parts of jobs) which may be re-scheduled upon the arrival of a new job j, and the size of j, is called migration factor. We design a strongly optimal algorithm with the migration factor 1-1/m for identical machines. Such algorithms avoid idle time and create solutions where the (non-increasingly) sorted vector of completion times of the machines is minimal lexicographically. In the case of identical machines this results not only in makespan minimization, but the created solution is also optimal with respect to any ℓ_{p} norm (for p > ). We show that an algorithm of a smaller migration factor cannot be optimal with respect to makespan or any other norm, thus the result is best possible in this sense as well. We further show that neither uniformly related machines nor identical machines with restricted assignment admit an optimal algorithm with a constant migration factor. This lower bound holds both for makespan minimization and for any ℓ_{p} norm. Finally, we analyze the case of two machines and show that in this case it is still possible to maintain an optimal schedule with a small migration factor in the cases of two uniformly related machines and two identical machines with restricted assignment.

Original language | English |
---|---|

Title of host publication | Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings |

Pages | 567-578 |

Number of pages | 12 |

DOIs | |

State | Published - 2011 |

Event | 19th Annual European Symposium on Algorithms, ESA 2011 - Saarbrucken, Germany Duration: 5 Sep 2011 → 9 Sep 2011 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 6942 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 19th Annual European Symposium on Algorithms, ESA 2011 |
---|---|

Country/Territory | Germany |

City | Saarbrucken |

Period | 5/09/11 → 9/09/11 |

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science (all)