An improved earliness-tardiness timing algorithm

被引：37

作者：

Hendel, Yann ^{[1
]}

Sourd, Francis ^{[1
]}

机构：

[1] LIP6, UMR7606, F-75015 Paris, France

来源：

COMPUTERS & OPERATIONS RESEARCH | 2007年 / 34卷 / 10期

关键词：

scheduling; earliness-tardiness; timing algorithm;

D O I：

10.1016/j.cor.2005.11.004

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Earliness-tardiness criteria with distinct due dates usually induce NP-complete problems. Researchers have focused on particular cases like the timing problem, which is to look for the optimal schedule when the jobs sequence is already known. These timing algorithms are very useful since they can be used in more complex procedures. In the first part of this paper we provide the most efficient and fairly general algorithm to solve the one-machine timing problem. It is then adapted to a permutation flow shop problem. (c) 2005 Elsevier Ltd. All rights reserved.

引用

页码：2931 / 2938

页数：8

共 19 条

[1] A fast scaling algorithm for minimizing separable convex functions subject to chain constraints [J].