Towards robustness of response times: minimising the maximum inter-completion time on parallel machines
SCIE
SCOPUS
- Title
- Towards robustness of response times: minimising the maximum inter-completion time on parallel machines
- Authors
- Zheng, Feifeng; Pinedo, Michael L.; LEE, KANGBOK; Liu, Ming; Xu, Yinfeng
- Date Issued
- 2019-01-02
- Publisher
- TAYLOR & FRANCIS LTD
- Abstract
- Motivated by scheduling practices that require a response to unplanned high-priority jobs as soon as possible without preempting any in-processing jobs, this paper considers a deterministic identical parallel machine scheduling problem to achieve robustness with regard to a worst-case response time. To the best of our knowledge, this paper is the first to study the objective of minimising the maximum inter-completion time, i.e. the maximum time difference between any two consecutive completion times of jobs. For this novel scheduling problem, we first show its NP-hardness, and then propose an integer linear programming formulation and three heuristic approaches. Numerical experiments demonstrate the efficiency of our solution methods.
- Keywords
- TOTAL ABSOLUTE DEVIATION; SINGLE-MACHINE; JOBS
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/94663
- DOI
- 10.1080/00207543.2018.1466063
- ISSN
- 0020-7543
- Article Type
- Article
- Citation
- INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, vol. 57, no. 1, page. 182 - 199, 2019-01-02
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.