Approximation algorithms for scheduling problems

被引：0
|
作者：
Ishii, H. [1 ]
Tada, M. [2 ]
机构：
[1] Osaka Univ., Suita-shi, Japan
[2] Ryukoku Univ., Kyoto-shi, Japan
来源：
IEICE Transactions on Information and Systems | 2000年 / E83-D卷 / 03期
关键词：
Approximation theory - Computational complexity - Decision making - Heuristic methods - Mathematical models - Optimization - Scheduling;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
There are no efficient algorithms for almost of all scheduling problems, especially when practical scheduling models are considered. Further there may be none for multi-objective scheduling problems. So we should take efforts to develop efficient approximate algorithms for multi-objective scheduling problems. The main purpose of this paper is to survey approaches to some scheduling problems from the algorithmic view points till now and investigate some hopeful approximate approaches to multiobjective scheduling problems.
引用
收藏
页码：496 / 502
相关论文
共 50 条
  • [41] Approximation algorithms for scheduling on multiple machines
    Kumar, VSA
    Marathe, MV
    Parthasarathy, S
    Srinivasan, A
    46TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2005, : 254 - 263
  • [42] Approximation Algorithms for Scheduling with Class Constraints
    Jansen, Klaus
    Lassota, Alexandra
    Maack, Marten
    PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 349 - 357
  • [43] Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
    Bao, Xiaoguang
    Liu, Zhaohui
    THEORETICAL COMPUTER SCIENCE, 2012, 434 : 1 - 10
  • [44] Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms
    Nip, Kameng
    Wang, Zhenbo
    Xing, Wenxun
    COMPUTING AND COMBINATORICS, 2015, 9198 : 97 - 108
  • [45] Approximation algorithms for dispersion problems
    Chandra, B
    Halldórsson, MM
    JOURNAL OF ALGORITHMS, 2001, 38 (02) : 438 - 465
  • [46] APPROXIMATION ALGORITHMS FOR BICLUSTERING PROBLEMS
    Wang, Lusheng
    Lin, Yu
    Liu, Xiaowen
    SIAM JOURNAL ON COMPUTING, 2008, 38 (04) : 1504 - 1518
  • [47] APPROXIMATION ALGORITHMS FOR COMBINATORIAL PROBLEMS
    JOHNSON, DS
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (03) : 256 - 278
  • [48] Algorithms for minclique scheduling problems
    Jurisch, B
    Kubiak, W
    Jozefowska, J
    DISCRETE APPLIED MATHEMATICS, 1997, 72 (1-2) : 115 - 139
  • [49] Algorithms for minclique scheduling problems
    Discrete Appl Math, 1-29998 (115-139):
  • [50] Algorithms for packing and scheduling problems
    Monaci, Michele
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2003, 1 (01): : 85 - 87
12345