Partheno-Genetic Algorithm for the Permutation Flowshop Scheduling Problem with Maximum Waiting Times

Bai Lin Wang; Tie Ke Li; Hai Feng Wang; Can Tao Shi

doi:10.4028/www.scientific.net/AMM.631-632.66

Paper Titles

Incremental Approach for Updating Approximations of Variable Precision Rough Set Based on Dominance Relations
p.49

Maintaining Dynamic Information Systems Using Incremental Dominance-Based Rough Set Approach
p.53

Minimizing Total Flow Time in a Flow Shop with Blocking Using a Hybrid Variable Neighborhood Search and Simulated Annealing Algorithm
p.57

Optimal Algorithmic Trading Strategy with the Price Appreciation Cost
p.62

Partheno-Genetic Algorithm for the Permutation Flowshop Scheduling Problem with Maximum Waiting Times
p.66

Research and Application of Enterprise Operating Situation Prediction Based on Decision Tree
p.70

Research of Digital Resource Integration Based on DC Metadata Storage
p.75

Short-Term Gas Load Forecasting Based on Wavelet BP Neural Network Optimized by Genetic Algorithm
p.79

Study on Asymptotic Properties of a Joint Model
p.86

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 631-632Partheno-Genetic Algorithm for the Permutation...

Partheno-Genetic Algorithm for the Permutation Flowshop Scheduling Problem with Maximum Waiting Times

Abstract:

A permutation flowshop scheduling problem with maximum waiting time constraints to minimize makespan is studied, and a partheno-genetic algorithm (PGA) is presented. In PGA, the fitness function is defined as a decreasing function of makespan to enhance the selected opportunity of good individuals; the roulette algorithm for chromosome selection is improved to keep population diversity with high quality by three strategies: optimal maintenance, fitness adjustment and roulette reconstruction; single-point gene exchange operators are applied to generate offspring. Numerical results demonstrated the feasibility and effectiveness of the algorithm.