Dynamical Neural Network Approach to the Job-shop Scheduling
From MaRDI portal
Publication:4846554
Recommendations
Cites work
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- A Branch-Bound Solution to the General Scheduling Problem
- A Generalized Machine-Scheduling Algorithm
- Job-Shop Scheduling by Implicit Enumeration
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- Optimization by simulated annealing
Cited in
(14)- Application of neural-network methods for prediction of the job execution characteristics in multiprocessor computing systems
- A stochastic neural network for resource constrained scheduling
- A new adaptive neural network and heuristics hybrid approach for job-shop scheduling
- Scheduling for minimizing total actual flow time by neural networks
- A neural network algorithm for servicing jobs with sequential and parallel machines
- Sequencing jobs on a single machine: A neural network approach
- Advances in Neural Networks – ISNN 2005
- An application of the neural network energy function to machine sequencing
- An improved constraint satisfaction adaptive neural network for job-shop scheduling
- A CONNECTIONIST METHOD TO SOLVE JOB SHOP PROBLEMS
- Advances in Neural Networks – ISNN 2005
- Advances in Neural Networks – ISNN 2005
- A production rescheduling expert simulation system
- Easing the conscience of the guilty net
This page was built for publication: Dynamical Neural Network Approach to the Job-shop Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4846554)