Parallel machine scheduling with general sum of processing time based models

被引:9
|
作者
Rudek, Radoslaw [1 ]
机构
[1] Wroclaw Univ Econ, Komandorska 118-120, PL-53345 Wroclaw, Poland
关键词
Scheduling; Parallel machine; Learning effect; Aging effect; Dynamic programming; TOTAL COMPLETION-TIME; SINGLE-MACHINE; FLOWSHOP;
D O I
10.1007/s10898-017-0509-x
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we analyse the parallel machine makespan minimization problem with the general sum of processing time based learning or aging effects. First, we prove that an optimal solution to the single machine case can be found by priority rules. Next, for the considered parallel machine problem, we construct the exact dynamic programming algorithm that can operate on real-valued job processing times, which is the only exact algorithm for the analysed problem. The computational analysis confirms that it can solve optimally moderate problem instances.
引用
收藏
页码:799 / 814
页数:16
相关论文
共 50 条