Journal of the Operations Research Society of China >
Batch Scheduling with Deteriorating Jobs to Minimize the Total Completion Time
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 . DOI: 10.1007/s40305-013-0019-6
/
| 〈 |
|
〉 |
