Design of efficient hybrid neural networks for flexible flow shop scheduling
- 23 September 2003
- journal article
- Published by Wiley in Expert Systems
- Vol. 20 (4) , 208-231
Abstract
Although neural networks have been successfully used in performing pattern recognition, their application for solving optimization problems has been limited. In this paper we design a neural network to solve a well‐known combinatorial problem, namely the flexible flow shop problem. A key feature of our neural network design is the integration of problem structure and heuristic information in the network structure and solution. We compare the performance of our neural network with well‐known current heuristics with respect to solution quality. The results indicate that our approach outperforms the heuristics.Keywords
This publication has 27 references indexed in Scilit:
- Global lower bounds for flow shops with multiple processorsEuropean Journal of Operational Research, 1995
- Heuristics for scheduling flexible flow linesComputers & Industrial Engineering, 1994
- Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environmentEuropean Journal of Operational Research, 1994
- Multiple job scheduling with artificial neural networksComputers and Electrical Engineering, 1993
- Neural networks for automated vehicle dispatchingComputers & Operations Research, 1992
- A stochastic neural network for resource constrained schedulingComputers & Operations Research, 1992
- Scheduling with neural networks—the case of the hubble space telescopeComputers & Operations Research, 1992
- Branch and bound algorithm for the flow shop with multiple processorsEuropean Journal of Operational Research, 1991
- A neural network approach to job-shop schedulingIEEE Transactions on Neural Networks, 1991
- Scheduling algorithms for flexible flowshops: Worst and average case performanceEuropean Journal of Operational Research, 1989