The optimality box in uncertain data for minimising the sum of the weighted job completion times
Tsung-Chyan Lai,
Yuri N. Sotskov,
Natalja G. Egorova and
Frank Werner
International Journal of Production Research, 2018, vol. 56, issue 19, 6336-6362
Abstract:
An uncertain single-machine scheduling problem is considered, where the processing time of a job can take any real value from a given segment. The criterion is to minimise the total weighted completion time of the n jobs, a weight being associated with each given job. We use the optimality box as a stability measure of the optimal schedule and derive an O(n)-algorithm for calculating the optimality box for a fixed permutation of the given jobs. We investigate properties of the optimality box using blocks of the jobs. If each job belongs to a single block, then the largest optimality box may be constructed in O(nlogn) $ O(n \log n) $ time. For the general case, we apply dynamic programming for constructing a job permutation with the largest optimality box. The computational results for finding a permutation with the largest optimality box show that such a permutation is close to an optimal one, which can be determined after completing the jobs when their processing times became known.
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (4)
Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2017.1398426 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:56:y:2018:i:19:p:6336-6362
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20
DOI: 10.1080/00207543.2017.1398426
Access Statistics for this article
International Journal of Production Research is currently edited by Professor A. Dolgui
More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().