Multiprocessor scheduling with rejection
Conference
·
OSTI ID:416790
- Tel-Aviv Univ. (Israel)
- Universita di Roma (Italy)
- Mathematical Inst., Zitna (Czechoslovakia); and others
We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected for a certain penalty. An instance of the problem is given by m identical parallel machines and a set of n jobs, each job characterized by a processing time and a penalty. In the on-line version the jobs arrive 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 + {phi} {approx} 2.618 competitive algorithm for the on-line version of the problem, where 0 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 an optimal {phi} {approx} 1.618 competitive algorithm. For the off-line problem we present a fully polynomial approximation scheme for fixed m and an approximation algorithm which runs in time O(n log n) for arbitrary m and guarantees 2 - 1/m approximation ratio.
- OSTI ID:
- 416790
- Report Number(s):
- CONF-960121--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Algorithms for parallel processor scheduling
Tighter bounds for the multifit processor scheduling algorithm
Polynomial algorithms for multiprocessor scheduling with a small number of job lengths
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5897371
Tighter bounds for the multifit processor scheduling algorithm
Journal Article
·
Tue Jan 31 23:00:00 EST 1984
· SIAM J. Comput.; (United States)
·
OSTI ID:5108217
Polynomial algorithms for multiprocessor scheduling with a small number of job lengths
Conference
·
Sun Jun 01 00:00:00 EDT 1997
·
OSTI ID:471708