Selecting Scheduling Heuristics Using Neural Networks

INFORMS Journal on Computing

Volumn 12, Issue 2, 2000, Pages 150-162

  Gupta, Jatinder N D ^a   Sexton, Randall S ^b   Tunc, Enar A ^a  

^a BALL STATE UNIVERSITY   (United States)

^b MISSOURI STATE UNIVERSITY   (United States)

Author keywords

Genetic algorithms; Heuristic selection; Hybrid flowshop scheduling; Parallel machines; Two tier neural networks

Indexed keywords

EID: 0000210782     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.12.2.150.11893     Document Type: Article

References (17)

1. D. ALPSAN, M. TOWNSEY, O. OLDAMAR, A.C. TSOI, and D.N. GHISTA, 1995. Efficiency of Modified Backpropagation and Optimization Methods on a Real-World Medical Problem, Neural Networks 8, 945-962.
2. L.I. BURKE and J.P. IGNIZIO, 1992. Neural Networks and Operations Research: An Overview, Computers and Operations Research 19, 179-189.
3. R.E. DORSEY and W.J. MAYER, 1995. Genetic Algorithms for Estimation Problems with Multiple Optima, Non-Differentiability, and Other Irregular Features, Journal of Business and Economic Statistics 13, 53-66.
4. R.E. DORSEY, J.D. JOHNSON, and W.J. MAYER, 1992. The Genetic Adaptive Neural Network Training (GANNT) for Generic Feed-forward Artificial Neural Systems, Working Paper, School of Business Administration, University of Mississippi, University, MS.
5. K.-I. FUNAHASHI, 1989. On the Approximate Realization of Continuous Mappings by Neural Networks, Neural Networks 2, 183-192.
6. J.N.D. GUPTA and R.S. SEXTON, 1999. Comparing Backpropagation with a Genetic Algorithm for Neural Network Training, OMEGA 27, 679-684.
7. J.N.D. GUPTA and E.A. TUNC, 1998. Minimizing Tardy Jobs in a Two-Stage Hybrid Flowshop, International Journal of Production Research 36, 2397-2417.
8. J.N.D. GUPTA and E.A. TUNC, 1997. Neural Networks Approach to Select Scheduling Heuristics for a Two-Stage Hybrid Flowshop, International Journal of Management and Systems 13, 283-298.
9. K. HORNIK, M. STINCHCOMBE, and H. WHITE, 1989. Multilayer Feed-forward Networks are Universal Approximators, Neural Networks 2, 359-366.
10. E.L. LAWLER, J.K. LENSTRA, A.H.G. RINNOOY KAN, and D.B. SHMOYS, 1993. Sequencing and Scheduling: Algorithms and Complexity, in Logistics of Production and Inventory, S.C. Graves, A.H.G. Rinnooy Kan, and P.M. Zipkin (eds.), North-Holland, Amsterdam, 445-522.
11. J.K. LENSTRA, A.H.G. RINNOOY KAN, and P. BRUCKER, 1977. Complexity of Machine Scheduling Problems, Annals of Discrete Mathematics 1, 343-362.
12. J.M. MOORE, 1968. An n Job, One-Machine Sequencing Algorithm for Minimizing the Number of Late Jobs, Management Science 15, 102-109.
13. K.E. NYGARD, P. JUELL, and N. KABADA, 1990. Neural Networks for Selecting Vehicle Routing Heuristics, ORSA Journal on Computing 4, 485-493.
14. D.E. RUMELHART, G.G. HINTON, and R.J. WILLIAMS, 1986. Learning Internal Representations by Error Propagation, in Parallel Distributed Processing: Exploration in the Microstructure of Cognition, D.E. Rumelhart (ed.), MIT Press, Cambridge, MA, 318-362.
15. R.S. SEXTON, R.E. DORSEY, and J.D. JOHNSON, 1998. Toward Global Optimization of Neural Networks, Decision Support Systems 22, 171-185.
16. K.A. SMITH, 1999. Neural Network for Combinatorial Optimization: A Review of More Than a Decade of Research, INFORMS Journal on Computing 11, 15-34.
17. D. TUZUN, M.A. MAGENT, and L.I. BURKE, 1997. Selection of Vehicle Routing Heuristics Using Heuristic Networks, International Transactions on Operations Research 4, 211-221.