Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm

Authors:
Der-Fang Shiau;Shu-Chen Cheng;Yueh-Min Huang
Affiliations:
Department of Engineering Science, National Cheng-Kung University, Tainan 701, Taiwan, ROC;Department of Computer Science and Information Engineering, Southern Taiwan University of Technology, Tainan County 71005, Taiwan, ROC;Department of Engineering Science, National Cheng-Kung University, Tainan 701, Taiwan, ROC
Venue:
Expert Systems with Applications: An International Journal
Year:
2008

Citing 14
Cited 7

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness

Computers and Operations Research
Parallel machine scheduling with earliness and tardiness penalties

Computers and Operations Research
A Constructive Evolutionary Approach to School Timetabling

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms

Proceedings of the 5th International Conference on Genetic Algorithms
Parallel Machine Scheduling by Column Generation

Operations Research
Solving Parallel Machine Scheduling Problems by Column Generation

INFORMS Journal on Computing
A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem

Computers and Operations Research
A tabu search algorithm for parallel machine total tardiness problem

Computers and Operations Research
A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks

Journal of Scheduling
Constructive Genetic Algorithm for Clustering Problems

Evolutionary Computation
A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time

Computers and Operations Research
Two-phase sub population genetic algorithm for parallel machine-scheduling problem

Expert Systems with Applications: An International Journal
The three-machine proportionate flow shop problem with unequal machine speeds

Operations Research Letters

Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Computers and Operations Research
A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences

Expert Systems with Applications: An International Journal
Quantum genetic algorithm for hybrid flow shop scheduling problems to minimize total completion time

LSMS/ICSEE'10 Proceedings of the 2010 international conference on Life system modeling and simulation and intelligent computing, and 2010 international conference on Intelligent computing for sustainable energy and environment: Part II
FMS scheduling with knowledge based genetic algorithm approach

Expert Systems with Applications: An International Journal
Solving flexible flow-shop problem with a hybrid genetic algorithm and data mining: A fuzzy approach

Expert Systems with Applications: An International Journal
Metaheuristic methods in hybrid flow shop scheduling problem

Expert Systems with Applications: An International Journal
Two-stage proportionate flexible flow shop to minimize the makespan

Journal of Combinatorial Optimization

Quantified Score

Hi-index	12.06

Visualization

Abstract

The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A proportionate flexible flow shop (PFFS) is a machine environment with parallel identical machines at each stage. This study presents an effective hybrid approach based on constructive genetic algorithm (CGA) for PFFS scheduling with the criterion to minimize the total weighted completion time (WCT). Minimizing the WCT in a PFFS problem significantly differs from the parallel-identical-machine scheduling problem, an optimal schedule in which the jobs on each machine are in weighted shortest processing time (WSPT) order. The proposed approach incorporates two fitness functions, and a population trained by a local improvement search based on tabu search with a candidate list strategy into CGA. Simulation results are compared with those of the column generation (CG) approach to demonstrate the effectiveness of the proposed hybrid approach. In particular, the CG approach has been applied successfully to solve various parallel machine scheduling problems, and yields high-quality solutions.