A novel Hopfield neural network approach for minimizing total weighted tardiness of jobs scheduled on identical machines

zbMATH Open1311.90120arXiv1208.4583MaRDI QIDQ2935518FDOQ2935518

Authors: Norbert Fogarasi, Kálmán Tornai, János Levendovszky 

Publication date: 30 December 2014

Full work available at URL: https://arxiv.org/abs/1208.4583

Recommendations

• Scheduling for minimizing total actual flow time by neural networks
• Selecting Scheduling Heuristics Using Neural Networks
• A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
• A neural network model for scheduling problems
• Competitive neural network to solve scheduling problems

zbMATH Keywords

artificial neural networksquadratic optimizationHopfield neural networkscheduling theorytotal weighted tardiness problem

Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (2)

• Locally optimal algorithms for designing schedules based on Hopfield networks
• A hybrid neural network approach to minimize total completion time on a single batch processing machine

This page was built for publication: A novel Hopfield neural network approach for minimizing total weighted tardiness of jobs scheduled on identical machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935518)