The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
La planification distribuée autonome est basée sur le optimisation décentralisée autonome et s'est récemment concentrée sur les techniques de planification flexibles qui peuvent mieux faire face à une situation changeante de manière dynamique que les techniques traditionnelles. Cet article propose un schéma d'ordonnancement distribué autonome pour le problème d'ordonnancement de machines parallèles. Grâce à la simulation informatique, nous observons que le schéma proposé peut réduire plus rapidement le délai total au fil du temps que celui de la littérature et peut s'adapter avec flexibilité à une situation inhabituelle (ajout d'emplois).
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.
Copier
Morikazu NAKAMURA, Norifumi NAKADA, Hideki KINJO, Kenji ONAGA, "An Autonomous Distributed Scheduling Scheme for Parallel Machine Problems" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 3, pp. 763-770, March 2001, doi: .
Abstract: Autonomous distributed scheduling is based on the autonomous decentralized optimization and recently focused as one of flexible scheduling techniques which can more cope with dynamically changing situation than traditional ones. This paper proposes an autonomous distributed scheduling scheme for the parallel machine scheduling problem. Through computer simulation, we observe that our proposed scheme can more quickly reduce the total deadline over-time than one in the literature and can adapt flexibly to unusual situation (addition of jobs).
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_3_763/_p
Copier
@ARTICLE{e84-a_3_763,
author={Morikazu NAKAMURA, Norifumi NAKADA, Hideki KINJO, Kenji ONAGA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Autonomous Distributed Scheduling Scheme for Parallel Machine Problems},
year={2001},
volume={E84-A},
number={3},
pages={763-770},
abstract={Autonomous distributed scheduling is based on the autonomous decentralized optimization and recently focused as one of flexible scheduling techniques which can more cope with dynamically changing situation than traditional ones. This paper proposes an autonomous distributed scheduling scheme for the parallel machine scheduling problem. Through computer simulation, we observe that our proposed scheme can more quickly reduce the total deadline over-time than one in the literature and can adapt flexibly to unusual situation (addition of jobs).},
keywords={},
doi={},
ISSN={},
month={March},}
Copier
TY - JOUR
TI - An Autonomous Distributed Scheduling Scheme for Parallel Machine Problems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 763
EP - 770
AU - Morikazu NAKAMURA
AU - Norifumi NAKADA
AU - Hideki KINJO
AU - Kenji ONAGA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2001
AB - Autonomous distributed scheduling is based on the autonomous decentralized optimization and recently focused as one of flexible scheduling techniques which can more cope with dynamically changing situation than traditional ones. This paper proposes an autonomous distributed scheduling scheme for the parallel machine scheduling problem. Through computer simulation, we observe that our proposed scheme can more quickly reduce the total deadline over-time than one in the literature and can adapt flexibly to unusual situation (addition of jobs).
ER -