Sequencing jobs on a single machine: A neural network approach

DOI10.1016/S0377-2217(99)00302-1zbMath0976.90040MaRDI QIDQ5928440

Neil Popplewell, Subramaniam Balakrishnan, Ahmed El-Bouri

Publication date: 13 January 2002

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

zbMATH Keywords

heuristics; neural networks; job sequencing; supervised learning

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

92B20: Neural networks for/in biological studies, artificial life and related topics

Related Items

Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem, A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling

Cites Work

• Unnamed Item
• ``Neural computation of decisions in optimization problems
• Adaptive pattern classification and universal recoding. I: Parallel development and coding of neural feature detectors
• A neural network model for scheduling problems
• Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
• Evaluation of leading heuristics for the single machine tardiness problem
• A heuristic for the single machine tardiness problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• A Dynamic Programming Approach to Sequencing Problems
• A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
• Scheduling for minimizing total actual flow time by neural networks
• An expert neural network system for dynamic job shop scheduling
• Applications of neural networks in manufacturing: a state-of-the-art survey
• The Total Tardiness Problem: Review and Extensions
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Variance Minimization in Single Machine Sequencing Problems