A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems

DOI10.1080/00207543.2010.510808MaRDI QIDQ2967585zbMATH OpenOpenAlexFDO

Authors Pei-Chann Chang, Wei-Hsiu Huang, Ching-Jung Ting

Publication date 1 March 2017

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207543.2010.510808

zbMATH Keywords

genetic algorithmartificial immune systemco-evolutional processearly convergenceflow-shop scheduling problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An immune genetic algorithm the flexible job-shop scheduling problem
• An improved genetic algorithm for the flowshop scheduling problem
• An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
• A genetic algorithm for the flowshop scheduling problem
• A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
• Research on flow shop scheduling problem based on improved genetic algorithm
• A genetic algorithm for flow shop scheduling problems
• scientific article; zbMATH DE number 5583008

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (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 review and classification of heuristics for permutation flow-shop scheduling with makespan objective
• A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
• An efficient hybrid evolutionary heuristic using genetic algorithm and simulated annealing algorithm to solve machine loading problem in FMS
• An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns
• An improved genetic algorithm for the flowshop scheduling problem
• Flowshop-scheduling problems with makespan criterion: a review
• Genetic Algorithms and the Optimal Allocation of Trials
• Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems
• Improved genetic algorithm for the permutation flowshop scheduling problem.
• Improved immune algorithm for global numerical optimization and job-shop scheduling problems

Cited in

(4)

• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
• scientific article; zbMATH DE number 5583008 (Why is no real title available?)
• An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times

This page was built for publication: A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2967585)