TY - JOUR
T1 - A neural network to enhance local search in the permutation flowshop
AU - El-Bouri, Ahmed
AU - Balakrishnan, Subramaniam
AU - Popplewell, Neil
N1 - Funding Information:
This research work was carried out with the support of the Natural Sciences and Engineering Research Council (NSERC) of Canada. The authors are especially grateful for the helpful comments and suggestions provided by two anonymous referees.
PY - 2005/8
Y1 - 2005/8
N2 - This paper considers the n-job, m-machine permutation flowshop with the objective of minimizing the mean flowtime. Initial sequences that are structured to enhance the performance of local search techniques are constructed from job rankings delivered by a trained neural network. The network's training is done by using data collected from optimal sequences obtained from solved examples of flowshop problems. Once trained, the neural network provides rankable measures that can be used to construct a sequence in which jobs are located as close as possible to the positions they would occupy in an optimal sequence. The contribution of these 'neural' sequences in improving the performance of some common local search techniques, such as adjacent pairwise interchange and tabu search, is examined. Tests using initial sequences generated by different heuristics show that the sequences suggested by the neural networks are more effective in directing neighborhood search methods to lower local optima.
AB - This paper considers the n-job, m-machine permutation flowshop with the objective of minimizing the mean flowtime. Initial sequences that are structured to enhance the performance of local search techniques are constructed from job rankings delivered by a trained neural network. The network's training is done by using data collected from optimal sequences obtained from solved examples of flowshop problems. Once trained, the neural network provides rankable measures that can be used to construct a sequence in which jobs are located as close as possible to the positions they would occupy in an optimal sequence. The contribution of these 'neural' sequences in improving the performance of some common local search techniques, such as adjacent pairwise interchange and tabu search, is examined. Tests using initial sequences generated by different heuristics show that the sequences suggested by the neural networks are more effective in directing neighborhood search methods to lower local optima.
KW - Flowshop
KW - Mean flowtime
KW - Neural networks
KW - Tabu search
UR - http://www.scopus.com/inward/record.url?scp=23144465977&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=23144465977&partnerID=8YFLogxK
U2 - 10.1016/j.cie.2005.04.001
DO - 10.1016/j.cie.2005.04.001
M3 - Article
AN - SCOPUS:23144465977
SN - 0360-8352
VL - 49
SP - 182
EP - 196
JO - Computers and Industrial Engineering
JF - Computers and Industrial Engineering
IS - 1
ER -