A neural network model for scheduling problems

DOI10.1016/0377-2217(96)00041-0zbMath0913.90180OpenAlexW2050893476MaRDI QIDQ1268160

Burckaan Gurgun, Ịhsan Sabuncuoğlu

Publication date: 31 May 1999

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

Full work available at URL: http://hdl.handle.net/11693/25777

zbMATH Keywords

artificial neural networksminimum makespan job shop schedulingsingle machine mean tardiness scheduling

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)

Related Items

A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling ⋮ A GA-based NN approach for makespan estimation ⋮ Heuristics and augmented neural networks for task scheduling with non-identical machines ⋮ Augmented neural networks for task scheduling. ⋮ A dynamic all parameters adaptive BP neural networks model and its application on oil reservoir prediction ⋮ Sequencing jobs on a single machine: A neural network approach ⋮ Job shop scheduling with beam search ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ The single-machine total tardiness scheduling problem: review and extensions ⋮ A bibliography of neural network business applications research: 1994--1998 ⋮ Heuristic procedure neural networks for the CMST problem ⋮ Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic ⋮ Makespan estimation in batch process industries: A comparison between regression analysis and neural networks

Cites Work

• Introduction to computation and learning in artificial neural networks
• ``Neural computation of decisions in optimization problems
• Neural networks and operations research: An overview
• Neural network methods in combinatorial optimization
• Scheduling with neural networks -- the case of the Hubble Space Telescope
• A stochastic neural network for resource constrained scheduling
• A heuristic for the single machine tardiness problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Job Shop Scheduling by Simulated Annealing
• Scheduling for minimizing total actual flow time by neural networks
• A Computational Study of the Job-Shop Scheduling Problem
• A dual algorithm for the one-machine scheduling problem
• Job-Shop Scheduling by Implicit Enumeration
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• New insights on the single machine total tardiness problem
• Neural networks and physical systems with emergent collective computational abilities.