An improved genetic algorithm for the flowshop scheduling problem
From MaRDI portal
Publication:3596697
Recommendations
- Improved genetic algorithm for the permutation flowshop scheduling problem.
- Research on flow shop scheduling problem based on improved genetic algorithm
- A genetic algorithm for the flowshop scheduling problem
- A genetic algorithm for flowshop scheduling with multiple objectives
- A genetic algorithm for flow shop scheduling problems
Cites work
- A fast tabu search algorithm for the permutation flow-shop problem
- A genetic algorithm for flowshop sequencing
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- A new constructive heuristic for the flowshop scheduling problem
- A tabu search approach for the flow shop scheduling problem
- Genetic algorithms for the two-stage bicriteria flowshop problem
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Optimal two- and three-stage production schedules with set-up time included
- The Complexity of Flowshop and Jobshop Scheduling
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
Cited in
(22)- scientific article; zbMATH DE number 5221570 (Why is no real title available?)
- Research on flow shop scheduling problem based on improved genetic algorithm
- scientific article; zbMATH DE number 1998810 (Why is no real title available?)
- Exact methods for the robotic cell problem
- A genetic algorithm for the flowshop scheduling problem
- An optimization-based heuristic for the robotic cell problem
- A genetic algorithm for flowshop sequencing
- scientific article; zbMATH DE number 1785794 (Why is no real title available?)
- A hybrid genetic algorithm for flowshop lot streaming with setups and variable sublots
- A high performing metaheuristic for multi-objective flowshop scheduling problem
- scientific article; zbMATH DE number 1975107 (Why is no real title available?)
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
- A self-guided genetic algorithm for permutation flowshop scheduling problems
- A study on open shop scheduling to minimise total tardiness
- Quantum-inspired genetic algorithms for flow shop scheduling
- A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems
- An introduction of dominant genes in genetic algorithm for FMS
- Improved genetic algorithm for the permutation flowshop scheduling problem.
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem
- Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems
This page was built for publication: An improved genetic algorithm for the flowshop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596697)