Approximation Algorithms for Multiprocessor Scheduling Problem
Summary :
In this paper, we consider the static multiprocessor scheduling problem for a class of multiprocessor systems consisting of m (
- Publication
- IEICE TRANSACTIONS on Information Vol.E83-D No.3 pp.503-509
- 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
Satoshi FUJITA, Masafumi YAMASHITA, "Approximation Algorithms for Multiprocessor Scheduling Problem" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 3, pp. 503-509, March 2000, doi: .
Abstract: In this paper, we consider the static multiprocessor scheduling problem for a class of multiprocessor systems consisting of m (
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_3_503/_p
Copy
@ARTICLE{e83-d_3_503,
author={Satoshi FUJITA, Masafumi YAMASHITA, },
journal={IEICE TRANSACTIONS on Information},
title={Approximation Algorithms for Multiprocessor Scheduling Problem},
year={2000},
volume={E83-D},
number={3},
pages={503-509},
abstract={In this paper, we consider the static multiprocessor scheduling problem for a class of multiprocessor systems consisting of m (
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Approximation Algorithms for Multiprocessor Scheduling Problem
T2 - IEICE TRANSACTIONS on Information
SP - 503
EP - 509
AU - Satoshi FUJITA
AU - Masafumi YAMASHITA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2000
AB - In this paper, we consider the static multiprocessor scheduling problem for a class of multiprocessor systems consisting of m (
ER -
English
