Comparison of neural and heuristic methods for a timetabling problem

DOI10.1016/0377-2217(96)00042-2zbMath0913.90175MaRDI QIDQ1268158

Michael J. Magazine, Helmut E. Mausser

Publication date: 31 May 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(96)00042-2

zbMATH Keywords

graph colouring; timetabling; annealed neural network; pricing heuristics

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

90B35: Deterministic scheduling theory in operations research

Related Items

A bibliography of neural network business applications research: 1994--1998

Cites Work

• Unnamed Item
• An introduction to timetabling
• ``Neural computation of decisions in optimization problems
• Neural networks and operations research: An overview
• Neural network methods in combinatorial optimization
• Scheduling with neural networks: Application to timetable construction
• Maximizing the value of a space mission
• Interval vertex-coloring of a graph with forbidden colors
• When Is the Classroom Assignment Problem Hard?
• A Neural Network-Based Optimization Algorithm for the Static Weapon-Target Assignment Problem
• Application of an Annealed Neural Network to a Timetabling Problem
• Neurons with graded response have collective computational properties like those of two-state neurons.
• A $k$-Sample Model in Order Statistics