## Abstract

We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected at a certain penalty. An instance of the problem is given by m identical parallel machines and a set of n jobs, with each job characterized by a processing time and a penalty. In the on-line version the jobs become available one by one and we have to schedule or reject a job before we have any information about future jobs. The objective is to minimize the makespan of the schedule for accepted jobs plus the sum of the penalties of rejected jobs. The main result is a 1 + φ ≈ 2.618 competitive algorithm for the on-line version of the problem, where φ is the golden ratio. A matching lower bound shows that this is the best possible algorithm working for all m. For fixed m we give improved bounds; in particular, for m = 2 we give a φ ≈ 1.618 competitive algorithm, which is best possible. For the off-line problem we present a fully polynomial approximation scheme for fixed m and a polynomial approximation scheme for arbitrary m. Moreover, we present an approximation algorithm which runs in time O(n log n) for arbitrary m and guarantees a 2 - 1/m approximation ratio.

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

Pages (from-to) | 64-78 |

Number of pages | 15 |

Journal | SIAM Journal on Discrete Mathematics |

Volume | 13 |

Issue number | 1 |

DOIs | |

State | Published - Jan 2000 |

Externally published | Yes |

## Keywords

- Approximation algorithms
- Competitive analysis
- Multiprocessor scheduling
- On-line algorithms