文献类型：期刊文献

英文题名：ON DECOMPOSITION OF THE TOTAL TARDINESS PROBLEM

作者：Chang, S.[1]; Lu, Q.[1]; Tang, G.[1]; Yu, W.[1]

机构：[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

年份：1995

卷号：17

期号：5

起止页码：221

外文期刊名：OPERATIONS RESEARCH LETTERS

收录：;EI(收录号：1995112917721);WOS:【SSCI(收录号:WOS:A1995TB68200005)，SCI-EXPANDED(收录号:WOS:A1995TB68200005)】；

语种：英文

外文关键词：SCHEDULING THEORY; ONE-MACHINE TOTAL TARDINESS PROBLEM; DECOMPOSITION THEOREM; BACKWARD SHIFT

摘要：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.