Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling
Authors:
- Haibin YuHYHaibin Yu
- Wei LiangWLWei Liang
- 1 April 2001
- journal article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 39 (3-4) , 337-356
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- A neural network model for the job-shop scheduling problem with the consideration of lot sizes2002
- A tutorial survey of job-shop scheduling problems using genetic algorithms: Part II. Hybrid genetic search strategiesComputers & Industrial Engineering, 1999
- Genetic algorithms for the job-shop scheduling problem with unrelated parallel constraints: Heuristic mixing method machines and precedenceComputers & Industrial Engineering, 1999
- A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategiesComputers & Industrial Engineering, 1999
- Some new results on simulated annealing applied to the job shop scheduling problemEuropean Journal of Operational Research, 1999
- A genetic algorithm based procedure for more realistic job shop scheduling problemsInternational Journal of Production Research, 1998
- Job-shop scheduling using neural networksInternational Journal of Production Research, 1998
- A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weightsComputers & Operations Research, 1995
- Fuzzy constraints in job-shop schedulingJournal of Intelligent Manufacturing, 1995
- Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling ProblemOperations Research, 1976