Online Optimization of Busy Time on Parallel Machines
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 11993
- Type
- D - Journal article
- DOI
-
10.1016/j.tcs.2014.07.017
- Title of journal
- Theoretical Computer Science
- Article number
- -
- First page
- 190
- Volume
- 560
- Issue
- Part 2
- ISSN
- 0304-3975
- Open access status
- Out of scope for open access requirements
- Month of publication
- July
- Year of publication
- 2014
- 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
-
4
- Research group(s)
-
-
- Citation count
- 7
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper was selected for the TCS special issue for TAMC'12. It initiated the study of online busy time scheduling, and is discussed at length in the chapter of Chau and Li in the compilation "Complexity and Approximation" (editors Du and Wang '20). Several works have built on this paper, for example: improving its results and extending the model (Ren and Tang SPAA'16) and using its lower bound (Azar and Vainstein (SPAA'17), Tan et al (IEEE-TPDS'19), Tian et al (Journal of Supercomputing'13)). The paper also influenced research on cloud computing by Ren and Tang (IPDPS'20).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -