ON DECOMPOSITION OF THE TOTAL TARDINESS PROBLEM

被引：24

作者：

CHANG, S

LU, Q

TANG, G

YU, W

机构：

[1] E CHINA UNIV SCI & TECHNOL, INST APPL MATH, SHANGHAI 200237, PEOPLES R CHINA

[2] WUHAN UNIV, DEPT MATH, WUHAN 430072, PEOPLES R CHINA

[3] SHANGHAI SECOND POLYTECH UNIV, DEPT MANAGEMENT, SHANGHAI 200002, PEOPLES R CHINA

来源：

OPERATIONS RESEARCH LETTERS | 1995年 / 17卷 / 05期

基金：

中国国家自然科学基金;

关键词：

SCHEDULING THEORY; ONE-MACHINE TOTAL TARDINESS PROBLEM; DECOMPOSITION THEOREM; BACKWARD SHIFT;

D O I：

10.1016/0167-6377(95)00027-H

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

As an improvement of the famous Lawler Decomposition Theorem for the one-machine total tardiness problem, some conditions on decomposition positions are obtained by Potts and Wassenhove, and are used by them to make the decomposition algorithm more efficient. In this paper, more conditions on the leftmost decomposition position are proved. Additional computational tests are described.

引用

页码：221 / 229

页数：9

共 5 条

[1]

Baker K., 1974, INTRO SEQUENCING SCH

[2] MINIMIZING TOTAL TARDINESS ON ONE MACHINE IS NP-HARD [J].