Approximation Algorithms for Scheduling Problems
Summary :
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 develope 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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E83-D No.3 pp.496-502
- Publication Date
- 2000/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- INVITED SURVEY PAPER
- Category
- Approximate Algorithms for Combinatorial Problems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiroaki ISHII, Minoru TADA, "Approximation Algorithms for Scheduling Problems" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 3, pp. 496-502, March 2000, doi: .
Abstract: 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 develope 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_3_496/_p
Copy
@ARTICLE{e83-d_3_496,
author={Hiroaki ISHII, Minoru TADA, },
journal={IEICE TRANSACTIONS on Information},
title={Approximation Algorithms for Scheduling Problems},
year={2000},
volume={E83-D},
number={3},
pages={496-502},
abstract={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 develope 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.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Approximation Algorithms for Scheduling Problems
T2 - IEICE TRANSACTIONS on Information
SP - 496
EP - 502
AU - Hiroaki ISHII
AU - Minoru TADA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2000
AB - 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 develope 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.
ER -
English
