Locally optimal algorithms for designing schedules based on Hopfield networks

DOI10.1023/A:1024918625291zbMATH Open1099.68533OpenAlexW1576956391MaRDI QIDQ2487110FDOQ2487110

Authors: V. A. Kostenko, A. V. Vinokurov 

Publication date: 17 August 2005

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024918625291

Recommendations

• Scheduling for minimizing total actual flow time by neural networks
• Local Search in Complex Scheduling Problems
• Scheduling with neural networks: Application to timetable construction
• scientific article; zbMATH DE number 4091174
• A stochastic neural network for resource constrained scheduling
• On parameter settings of Hopfield networks applied to traveling salesman problems
• scientific article; zbMATH DE number 3570347
• A novel Hopfield neural network approach for minimizing total weighted tardiness of jobs scheduled on identical machines
• A neural network model for scheduling problems

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)

This page was built for publication: Locally optimal algorithms for designing schedules based on Hopfield networks

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