The search functionality is under construction.

The search functionality is under construction.

Most scheduling applications have been classified into NP-complete problems. This fact implies that an optimal solution for a large scheduling problem is extremely time-consuming. A number of schemes are introduced to solve NP-complete scheduling applications, such as linear programming, neural network, and fuzzy logic. In this paper, we demonstrate a new approach, fuzzy Hopfield neural network, to solve the scheduling problems. This fuzzy Hopfield neural network approach integrates fuzzy c-means clustering strategies into a Hopfield neural network. In this investigation, we utilizes this new approach to demonstrate the feasibility of resolving a multiprocessor scheduling problem with no process migration, limited resources and constrained times (execution time and deadline). In the approach, the process and processor of the scheduling problem can be regarded as a data sample and a cluster, respectively. Then, an appropriate Lyapunov energy function is derived correspondingly. The scheduling results can be obtained using a fuzzy Hopfield neural network clustering technique by iteratively updating fuzzy state until the energy function gets minimized. To validate our approach, three scheduling cases for different initial neuron states as well as fuzzification parameters are taken as testbed. Simulation results reveal that imposing the fuzzy Hopfield neural network on the proposed energy function provides a sound approach in solving this class of scheduling problems.

- Publication
- IEICE TRANSACTIONS on Information Vol.E84-D No.3 pp.384-393

- Publication Date
- 2001/03/01

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- PAPER

- Category
- Biocybernetics, Neurocomputing

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.

Copy

Ruey-Maw CHEN, Yueh-Min HUANG, "Multi-Constraint Job Scheduling by Clustering Scheme of Fuzzy Neural Network" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 3, pp. 384-393, March 2001, doi: .

Abstract: Most scheduling applications have been classified into NP-complete problems. This fact implies that an optimal solution for a large scheduling problem is extremely time-consuming. A number of schemes are introduced to solve NP-complete scheduling applications, such as linear programming, neural network, and fuzzy logic. In this paper, we demonstrate a new approach, fuzzy Hopfield neural network, to solve the scheduling problems. This fuzzy Hopfield neural network approach integrates fuzzy c-means clustering strategies into a Hopfield neural network. In this investigation, we utilizes this new approach to demonstrate the feasibility of resolving a multiprocessor scheduling problem with no process migration, limited resources and constrained times (execution time and deadline). In the approach, the process and processor of the scheduling problem can be regarded as a data sample and a cluster, respectively. Then, an appropriate Lyapunov energy function is derived correspondingly. The scheduling results can be obtained using a fuzzy Hopfield neural network clustering technique by iteratively updating fuzzy state until the energy function gets minimized. To validate our approach, three scheduling cases for different initial neuron states as well as fuzzification parameters are taken as testbed. Simulation results reveal that imposing the fuzzy Hopfield neural network on the proposed energy function provides a sound approach in solving this class of scheduling problems.

URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_3_384/_p

Copy

@ARTICLE{e84-d_3_384,

author={Ruey-Maw CHEN, Yueh-Min HUANG, },

journal={IEICE TRANSACTIONS on Information},

title={Multi-Constraint Job Scheduling by Clustering Scheme of Fuzzy Neural Network},

year={2001},

volume={E84-D},

number={3},

pages={384-393},

abstract={Most scheduling applications have been classified into NP-complete problems. This fact implies that an optimal solution for a large scheduling problem is extremely time-consuming. A number of schemes are introduced to solve NP-complete scheduling applications, such as linear programming, neural network, and fuzzy logic. In this paper, we demonstrate a new approach, fuzzy Hopfield neural network, to solve the scheduling problems. This fuzzy Hopfield neural network approach integrates fuzzy c-means clustering strategies into a Hopfield neural network. In this investigation, we utilizes this new approach to demonstrate the feasibility of resolving a multiprocessor scheduling problem with no process migration, limited resources and constrained times (execution time and deadline). In the approach, the process and processor of the scheduling problem can be regarded as a data sample and a cluster, respectively. Then, an appropriate Lyapunov energy function is derived correspondingly. The scheduling results can be obtained using a fuzzy Hopfield neural network clustering technique by iteratively updating fuzzy state until the energy function gets minimized. To validate our approach, three scheduling cases for different initial neuron states as well as fuzzification parameters are taken as testbed. Simulation results reveal that imposing the fuzzy Hopfield neural network on the proposed energy function provides a sound approach in solving this class of scheduling problems.},

keywords={},

doi={},

ISSN={},

month={March},}

Copy

TY - JOUR

TI - Multi-Constraint Job Scheduling by Clustering Scheme of Fuzzy Neural Network

T2 - IEICE TRANSACTIONS on Information

SP - 384

EP - 393

AU - Ruey-Maw CHEN

AU - Yueh-Min HUANG

PY - 2001

DO -

JO - IEICE TRANSACTIONS on Information

SN -

VL - E84-D

IS - 3

JA - IEICE TRANSACTIONS on Information

Y1 - March 2001

AB - Most scheduling applications have been classified into NP-complete problems. This fact implies that an optimal solution for a large scheduling problem is extremely time-consuming. A number of schemes are introduced to solve NP-complete scheduling applications, such as linear programming, neural network, and fuzzy logic. In this paper, we demonstrate a new approach, fuzzy Hopfield neural network, to solve the scheduling problems. This fuzzy Hopfield neural network approach integrates fuzzy c-means clustering strategies into a Hopfield neural network. In this investigation, we utilizes this new approach to demonstrate the feasibility of resolving a multiprocessor scheduling problem with no process migration, limited resources and constrained times (execution time and deadline). In the approach, the process and processor of the scheduling problem can be regarded as a data sample and a cluster, respectively. Then, an appropriate Lyapunov energy function is derived correspondingly. The scheduling results can be obtained using a fuzzy Hopfield neural network clustering technique by iteratively updating fuzzy state until the energy function gets minimized. To validate our approach, three scheduling cases for different initial neuron states as well as fuzzification parameters are taken as testbed. Simulation results reveal that imposing the fuzzy Hopfield neural network on the proposed energy function provides a sound approach in solving this class of scheduling problems.

ER -