Heuristics and augmented neural networks for task scheduling with non-identical machines
From MaRDI portal
Publication:2432852
DOI10.1016/J.EJOR.2005.03.045zbMATH Open1137.90473OpenAlexW1997200022MaRDI QIDQ2432852FDOQ2432852
Authors: Anurag Agarwal, Selcuk Colak, Varghese S. Jacob, Hasan Pirkul 
Publication date: 25 October 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.03.045
Recommendations
- Augmented neural networks for task scheduling.
- An improved augmented neural-network approach for scheduling problems
- Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem
- Heuristics for scheduling unrelated parallel machines
- A new adaptive neural network and heuristics hybrid approach for job-shop scheduling
Cites Work
- A Survey of Scheduling Rules
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- ``Neural computation of decisions in optimization problems
- Preemptive Scheduling of Uniform Processor Systems
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- A comparison of list schedules for parallel processing systems
- A Review of Production Scheduling
- A lower bound for on-line scheduling on uniformly related machines
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
- Augmented neural networks for task scheduling.
- A neural network model for scheduling problems
- A hybrid neural approach to combinatorial optimization
- An improved augmented neural-network approach for scheduling problems
Cited In (7)
- Comparison of neural and heuristic methods for a timetabling problem
- Augmented neural networks for task scheduling.
- Learning-augmented heuristics for scheduling parallel serial-batch processing machines
- A hybrid neural network approach to minimize total completion time on a single batch processing machine
- An improved augmented neural-network approach for scheduling problems
- A Neural Network Model For The Common Due Date Job Scheduling On Unrelated Parallel Machines
- Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem
This page was built for publication: Heuristics and augmented neural networks for task scheduling with non-identical machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432852)
