An effective architecture for learning and evolving flexible job-shop schedules
From MaRDI portal
Publication:858446
DOI10.1016/j.ejor.2006.04.007zbMath1180.90121OpenAlexW2053131909MaRDI QIDQ858446
Joc Cing Tay, Edmund M.-K. Lai, Nhu Binh Ho
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
Related Items (27)
A priority-based genetic algorithm for a flexible job shop scheduling problem ⋮ List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility ⋮ Path-relinking tabu search for the multi-objective flexible job shop scheduling problem ⋮ Accelerating the branch-and-price algorithm using machine learning ⋮ 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 ⋮ A modified biogeography-based optimization for the flexible job shop scheduling problem ⋮ Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem ⋮ Solving the flexible job shop scheduling problem with sequence-dependent setup times ⋮ Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems ⋮ 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 ⋮ Adaptive multimeme algorithm for flexible job shop scheduling problem ⋮ An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems ⋮ A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach ⋮ An enhanced genetic algorithm with an innovative encoding strategy for flexible job-shop scheduling with operation and processing flexibility ⋮ A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities ⋮ Hyper-heuristic approaches for the response time variability problem ⋮ Scheduling manufacturing systems with blocking: a Petri net approach ⋮ Mathematical models for job-shop scheduling problems with routing and process plan flexibility ⋮ Analysis of the similarities and differences of job-based scheduling problems ⋮ Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm ⋮ Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system ⋮ Double layer ACO algorithm for the multi-objective FJSSP ⋮ A research survey: review of flexible job shop scheduling techniques ⋮ Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect ⋮ A Taxonomy for the Flexible 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
This page was built for publication: An effective architecture for learning and evolving flexible job-shop schedules
