An effective architecture for learning and evolving flexible job-shop schedules

DOI10.1016/j.ejor.2006.04.007zbMath1180.90121MaRDI QIDQ858446

Nhu Binh Ho, Joc Cing Tay, Edmund M.-K. Lai

Publication date: 9 January 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.04.007

zbMATH Keywords

scheduling; genetic algorithms; composite dispatching rules; flexible job-shop problems

Mathematics Subject Classification ID

90B40: Search theory

90B35: Deterministic scheduling theory in operations research

Related Items

Double layer ACO algorithm for the multi-objective FJSSP, A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem

Cites Work

• Learnable evolution model: Evolutionary processes guided by machine learning
• Some new results on simulated annealing applied to the job shop scheduling problem
• Deterministic job-shop scheduling: Past, present and future
• Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
• A knowledge-based evolutionary strategy for scheduling problems with bottlenecks
• A generalized permutation approach to job shop scheduling with genetic algorithms
• Routing and scheduling in a flexible job shop by tabu search
• An Algorithm for Solving the Job-Shop Problem
• A Survey of Scheduling Rules
• The Complexity of Flowshop and Jobshop Scheduling
• A Fast Taboo Search Algorithm for the Job Shop Problem
• The elements of statistical learning. Data mining, inference, and prediction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item