Journal of the Operations Research Society of China ›› 2013, Vol. 1 ›› Issue (3): 377-384.doi: 10.1007/s40305-013-0019-6
Previous Articles Next Articles
Online:
Published:
Abstract:
We consider bounded parallel-batch scheduling with proportional-linear deteriorating jobs and the objective to minimize the total completion time. We give some properties of optimal schedules for the problem and present for it a dynamic programming algorithm running in O(b2m22m) time, where b is the size of a batch and m is the number of distinct deterioration rates.
Key words: Batch scheduling , Deteriorating jobs , Dynamic programming algorithm
Cu-Xia Miao · Yun-Jie Xia · Yu-Zhong Zhang · Juan Zou. Batch Scheduling with Deteriorating Jobs to Minimize the Total Completion Time[J]. Journal of the Operations Research Society of China, 2013, 1(3): 377-384.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jorsc.shu.edu.cn/EN/10.1007/s40305-013-0019-6
https://www.jorsc.shu.edu.cn/EN/Y2013/V1/I3/377
