An effective architecture for learning and evolving flexible job-shop schedules
From MaRDI portal
Publication:858446
DOI10.1016/J.EJOR.2006.04.007zbMATH Open1180.90121OpenAlexW2053131909MaRDI QIDQ858446FDOQ858446
Authors: 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
Recommendations
- Job shop scheduling with a genetic algorithm and machine learning
- Evolutionary algorithms for jobshop scheduling
- Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems
- Genetic learning through simulation: An investigation in shop floor scheduling
- Evolution based learning in a job shop scheduling environment
Cites Work
- The elements of statistical learning. Data mining, inference, and prediction
- Title not available (Why is that?)
- A Survey of Scheduling Rules
- The Complexity of Flowshop and Jobshop Scheduling
- Title not available (Why is that?)
- A Fast Taboo Search Algorithm for the Job Shop Problem
- An Algorithm for Solving the Job-Shop 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 generalized permutation approach to job shop scheduling with genetic algorithms
- Routing and scheduling in a flexible job shop by tabu search
- Some new results on simulated annealing applied to the job shop scheduling problem
- A knowledge-based evolutionary strategy for scheduling problems with bottlenecks
- Learnable evolution model: Evolutionary processes guided by machine learning
- Operations scheduling with applications in manufacturing and services. With 3.5 disk package
- Title not available (Why is that?)
Cited In (27)
- A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach
- Solving the flexible job shop scheduling problem with sequence-dependent setup times
- A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
- Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
- A Taxonomy for the Flexible Job Shop Scheduling Problem
- A research survey: review of flexible job shop scheduling techniques
- Analysis of the similarities and differences of job-based scheduling problems
- List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
- Accelerating the branch-and-price algorithm using machine learning
- Scheduling manufacturing systems with blocking: a Petri net approach
- Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system
- Adaptive multimeme algorithm for flexible job shop scheduling problem
- Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
- A priority-based genetic algorithm for a flexible job shop scheduling problem
- Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
- A modified biogeography-based optimization for the flexible job shop scheduling problem
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems
- Heuristic approaches for scheduling jobs in large-scale flexible job shops
- A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms
- Double layer ACO algorithm for the multi-objective FJSSP
- An enhanced genetic algorithm with an innovative encoding strategy for flexible job-shop scheduling with operation and processing flexibility
- Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect
- A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem
- Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times
- Hyper-heuristic approaches for the response time variability problem
This page was built for publication: An effective architecture for learning and evolving flexible job-shop schedules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858446)
