Worst-case performance of approximation algorithms for tool management problems

被引:0
|
作者
Crama, Y
van de Klundert, J [1 ]
机构
[1] Univ Maastricht, Fac Gen Sci, Dept Math, NL-6200 MD Maastricht, Netherlands
[2] Univ Liege, Ecole Adm Affaires, B-4000 Liege, Belgium
关键词
D O I
10.1002/(SICI)1520-6750(199908)46:5<445::AID-NAV1>3.3.CO;2-I
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Since the introduction of flexible manufacturing systems, researchers have investigated various planning and scheduling problems faced by the users of such systems, Several of these problems are not encountered in more classical production settings, and so-called tool management problems appear to be among the more fundamental ones of these problems. Most tool management problems are hard to solve, so that numerous approximate solution techniques have been proposed to tackle them. In this paper, we investigate the quality of such algorithms by means of worst-case analysis. We consider several polynomial-time approximation algorithms described in the literature, and we show that all these algorithms exhibit rather poor worst-case behavior. We also study the complexity of solving tool management problems approximately. In this respect, we investigate the interrelationships among tool management problems, as well as their relationships with other well-known combinatorial problems such as the maximum clique problem or the set covering problem, and we prove several negative results on the approximability of various tool management problems. (C) 1999 John Wiley & Sons, Inc.
引用
收藏
页码:445 / 462
页数:18
相关论文
共 50 条
  • [31] DISCRETE LOOPS AND WORST-CASE PERFORMANCE
    BLIEBERGER, J
    COMPUTER LANGUAGES, 1994, 20 (03): : 193 - 212
  • [32] Worst-Case Workflow Performance Optimization
    Eckert, Julian
    Schulte, Stefan
    Niemann, Michael
    Repp, Nicolas
    Steinmetz, Ralf
    2008 3RD INTERNATIONAL CONFERENCE ON INTERNET AND WEB APPLICATIONS AND SERVICES (ICIW 2008), 2008, : 632 - 637
  • [33] QoS routing with worst-case delay constraints: Models, algorithms and performance analysis
    Frangioni, Antonio
    Galli, Laura
    Stea, Giovanni
    COMPUTER COMMUNICATIONS, 2017, 103 : 104 - 115
  • [34] Results on worst-case performance assessment
    Packard, A
    Balas, G
    Liu, R
    Shin, JY
    PROCEEDINGS OF THE 2000 AMERICAN CONTROL CONFERENCE, VOLS 1-6, 2000, : 2425 - 2427
  • [35] How to achieve worst-case performance
    Greenstreet, MR
    de Alwis, B
    SEVENTH INTERNATIONAL SYMPOSIUM ON ASYNCHRONOUS CIRCUITS AND SYSTEMS, PROCEEDINGS, 2001, : 206 - 216
  • [36] On the worst-case error of least squares algorithms for L2-approximation with high probability
    Ullrich, Mario
    JOURNAL OF COMPLEXITY, 2020, 60
  • [37] WORST-CASE SCENARIOS OPTIMIZATION AS A FINANCIAL STRESS TESTING TOOL FOR RISK MANAGEMENT
    El Ghourabi, Mohamed
    Landolsi, Mourad
    Dridi, Amira
    Gamoudi, Imed
    6TH INTERNATIONAL DAYS OF STATISTICS AND ECONOMICS, 2012, : 372 - 383
  • [38] WORST-CASE ANALYSIS OF AN APPROXIMATION ALGORITHM FOR FLOWSHOP SCHEDULING
    NOWICKI, E
    SMUTNICKI, C
    OPERATIONS RESEARCH LETTERS, 1989, 8 (03) : 171 - 177
  • [39] Beyond Worst-Case Analysis for Root Isolation Algorithms
    Ergur, Alperen
    Tonelli-Cueto, Josue
    Tsigaridas, Elias
    PROCEEDINGS OF THE 2022 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, ISSAC 2022, 2022, : 139 - 148
  • [40] Worst-case errors of linear algorithms for identification in H∞
    Partington, JR
    INTERNATIONAL JOURNAL OF CONTROL, 1998, 69 (02) : 347 - 352