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