Power of preemption for minimizing total completion time for uniform parallel machines
- Submitting institution
-
University of Greenwich
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 16762
- Type
- D - Journal article
- DOI
-
10.1137/16M1066610
- Title of journal
- SIAM Journal on Discrete Mathematics
- Article number
- -
- First page
- 101
- Volume
- 31
- Issue
- 1
- ISSN
- 0895-4801
- Open access status
- Compliant
- Month of publication
- January
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- 4
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper answers the general question of how much better a job allocation optimizing the sum of job completion times can become if preemptions are allowed. The answer is shown to be less than 5/7 and an exact tight instance is given. This type of result is regarded as valuable in the parallel computing community because of its scope: the bound covers any combination of machine speeds and job processing times. The proof uses a sequence of transformations on machine speeds and jobs which modify an arbitrary instance to increase the ratio and identifies the shape of tight instances.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
