Reducing network and computation complexities in neural based real-time scheduling scheme
From MaRDI portal
Publication:632870
DOI10.1016/j.amc.2011.01.014zbMath1211.68034OpenAlexW2025940734MaRDI QIDQ632870
Publication date: 28 March 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.01.014
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Makespan minimization in machine dominated flowshop
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Solving the resource-constrained project scheduling problem using filter-and-fan approach
- The museum visitor routing problem
- An improved particle swarm optimization algorithm for flowshop scheduling problem
- ``Neural computation of decisions in optimization problems
- Rate monotonic scheduling in hard real-time systems
- A class of on-line scheduling algorithms to minimize total completion time
- Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- Heuristic approaches for solving transit vehicle scheduling problem with route and fueling time constraints
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
- Approximation Techniques for Average Completion Time Scheduling
- Job-shop scheduling using neural networks
- Competitive neural network to solve scheduling problems
- Single machine scheduling with release times, deadlines and tardiness objectives
This page was built for publication: Reducing network and computation complexities in neural based real-time scheduling scheme
