A self-guided genetic algorithm for permutation flowshop scheduling problems
From MaRDI portal
Recommendations
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- An estimation of distribution algorithm for solving the hybrid flow-shop scheduling problem
- An improved genetic algorithm for the flowshop scheduling problem
- A genetic algorithm for flowshop sequencing
- A genetic algorithm for the flowshop scheduling problem
Cites work
- scientific article; zbMATH DE number 1054947 (Why is no real title available?)
- scientific article; zbMATH DE number 3270307 (Why is no real title available?)
- A comprehensive review and evaluation of permutation flowshop heuristics
- A genetic algorithm for flowshop sequencing
- A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- A review and evaluation of multiobjective algorithms for the flowshop scheduling problem
- A survey of optimization by building and using probabilistic models
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering
- Benchmarks for basic scheduling problems
- Data mining. Concepts and techniques
- Efficiency enhancement of estimation of distribution algorithms
- Flowshop-scheduling problems with makespan criterion: a review
- Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems
- Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems
- New Ways to Calibrate Evolutionary Algorithms
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
Cited in
(9)- Total completion time with makespan constraint in no-wait flowshops with setup times
- Multiple parents crossover operators: a new approach removes the overlapping solutions for sequencing problems
- A discrete inter-species cuckoo search for flowshop scheduling problems
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem
- Matching and scheduling of student-company-talks for a university it-speed dating event
- Dominance conditions determination based on machine idle times 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
This page was built for publication: A self-guided genetic algorithm for permutation flowshop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762134)
