A neural network algorithm for servicing jobs with sequential and parallel machines
From MaRDI portal
Publication:893921
DOI10.1134/S0005117914070030zbMath1325.93056MaRDI QIDQ893921
Publication date: 23 November 2015
Published in: Automation and Remote Control (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Neural networks for/in biological studies, artificial life and related topics (92B20) Control/observation systems involving computers (process control, etc.) (93C83) Optimal stochastic control (93E20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Discrepancy search for the flexible job shop scheduling problem
- A hierarchical approach for the FMS scheduling problem
- NP-hardness of shop-scheduling problems with three jobs
- A hybrid heuristic to solve the parallel machines job-shop scheduling problem
- Complexity of shop-scheduling problems with fixed number of jobs: a survey
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- A Survey of Scheduling Rules
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Heuristics for generalized shop scheduling problems based on decomposition
- Adaptive scheduling algorithm based on mixed graph model
- Advances in Neural Networks – ISNN 2005