WORST-CASE ANALYSIS OF LOCAL SEARCH HEURISTICS FOR THE ONE-MACHINE TOTAL TARDINESS PROBLEM

被引：0
|
作者：
CHANG, SW
MATSUO, H
TANG, GC
机构：
[1] UNIV TEXAS, GRAD SCH BUSINESS, DEPT MANAGEMENT, AUSTIN, TX 78712 USA
[2] SHANGHAI POLYTECH UNIV 2, DEPT MANAGEMENT, SHANGHAI, PEOPLES R CHINA
来源：
NAVAL RESEARCH LOGISTICS | 1990年 / 37卷 / 01期
关键词：
D O I：
10.1002/1520-6750(199002)37:1<111::AID-NAV3220370107>3.0.CO;2-V
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this article the worst‐case performance of four local search heuristics for the total tardiness problem is investigated. Since the denominator of the error ratio, which is the optimal objective value, may become zero, the derivation of the worst‐case relative error requires a careful mathematical treatment. After necessary definitions and notations are introduced, the worst‐case relative errors of two heuristics are shown to be infinite for a given number of jobs, while those of the other two are shown to be finite. Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company
引用
收藏
页码：111 / 121
页数：11
相关论文
共 50 条
12345