A self-guided genetic algorithm for permutation flowshop scheduling problems

DOI10.1016/j.cor.2011.08.016zbMath1251.90122OpenAlexW2048240704MaRDI QIDQ1762134

Shih-Hsin Chen, Qingfu Zhang, Pei-Chann Chang, Cheng, T. C. Edwin

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.08.016

zbMATH Keywords

estimation of distribution algorithmspermutation flowshop schedulingself-guided crossoverself-guided mutation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

Total completion time with makespan constraint in no-wait flowshops with setup times ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ Matching and scheduling of student-company-talks for a university it-speed dating event ⋮ Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem ⋮ Dominance conditions determination based on machine idle times 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 ⋮ Multiple parents crossover operators: a new approach removes the overlapping solutions for sequencing problems ⋮ Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem

Cites Work

• Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems
• 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
• An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
• A genetic algorithm for flowshop sequencing
• A comprehensive review and evaluation of permutation flowshop heuristics
• Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
• Benchmarks for basic scheduling problems
• Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems
• A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
• New Ways to Calibrate Evolutionary Algorithms
• An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering
• A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
• Flowshop-scheduling problems with makespan criterion: a review
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• A survey of optimization by building and using probabilistic models
• Data mining. Concepts and techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A self-guided genetic algorithm for permutation flowshop scheduling problems