Common due date assignment with generalized earliness/tardiness penalties

被引:18
|
作者
Koulamas, Christos [1 ]
机构
[1] Florida Int Univ, Dept Informat Syst & Business Analyt, Miami, FL 33199 USA
关键词
Scheduling; Single-machine; Common due date; Earliness/tardiness; Dynamic programming; MACHINE SCHEDULING PROBLEM; TARDY JOBS; DEVIATION; EARLINESS; WINDOW; TIMES;
D O I
10.1016/j.cie.2017.04.040
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider the single-machine common due date assignment problem with generalized earliness/tardiness penalties and show that the problem can be solved optimally in polynomial time by dynamic programming. We also present a faster linear time algorithm for a special case of the problem. A number of extensions with compressible job processing times, two assigned due dates and additional terms in the objective function are also analyzed and solved optimally in polynomial time. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:79 / 83
页数:5
相关论文
共 50 条