Genetic Algorithm for Minimizing the Makespan in Hybrid Flow Shop Scheduling Problem

  title={Genetic Algorithm for Minimizing the Makespan in Hybrid Flow Shop Scheduling Problem},
  author={Zhixiong Su and Tieke Li},
  journal={2009 International Conference on Management and Service Science},
  • Zhixiong Su, Tieke Li
  • Published 30 October 2009
  • Computer Science
  • 2009 International Conference on Management and Service Science
This paper propose a genetic algorithm based on extended Giffler & Thompson (EGT) procedure for hybrid flow shop (HFS) scheduling problem. In this method, each individual represents a complete schedule. The crossover and mutation operators are designed based on EGT algorithm. This algorithm is also used to generate initial population. Therefore, the search space is restricted to the active schedule space. Last, the performance of this algorithm is analyzed by computational experiments using… 

Figures and Tables from this paper

Applying bee colony optimization heuristic for production scheduling in make-pack manufacturing
This paper presents the application of Bee Colony Optimization (BCO) for solving make-pack problem. The objective is to reduce the makespan while satisfying the restrictions on the number and
Applying Bee Colony Optimization Heuristic for Make-Pack Problem in Process Manufacturing
BCO is applied to the realistic-sized case study data with 59 bulk formulas and 203 final productions along with 4 types of resources; premix tank, mix tank, storage tank and packing line. The
Algoritmo genético para reduzir o makespan em um flow shop híbrido flexível com máquinas paralelas não relacionadas e tempos de preparação dependentes da sequência
El articulo propone el algoritmo genetico simple o estandar (AGS) como enfoque de solucion al problema de programacion de produccion para un ambiente tipo flow shop hibrido flexible minimizando el
Reducción del Tiempo de Terminación en la Programación de la Producción de una Línea de Flujo Híbrida Flexible (HFS)
espanolSe propone un modelo de programacion de la produccion mediante la aplicacion de una meta heuristica para lograr la reduccion del tiempo de terminacion del ultimo trabajo (makespan). Se eligio


An Application Of Effective Genetic Algorithms For Solving Hybrid Flow Shop Scheduling Problems
The computational results indicate that the proposed efficient genetic algorithm approach is effective in terms of reduced total completion time or makespan (Cmax) for HFS problems.
Genetic algorithm for large-size multi-stage batch plant scheduling
Algorithms for Solving Production-Scheduling Problems
It is shown that it is practical, in problems of small size, to generate the complete set of all active schedules and to pick the optimal schedules directly from this set and, when this is not practical, to random sample from the bet of allactive schedules.
Local search algorithms for the multiprocessor flow shop scheduling problem
This paper considers a scheduling problem of minimizing the maximum lateness for a parallel- machine flowshop with m stages, each of which consists of one or more identical parallel machines. We
Solving hybrid flow shop problem using energetic reasoning and global operations
An Exact Method for Solving the Multi-Processor Flow-Shop
A new branch and bound method for solving the Multi-Processor Flow-Shop based on the relaxation of the initial problem to m-machine problems corresponding to centers is presented.
A computational study of heuristics for two-stage flexible flowshops
We consider the scheduling of two-stage flexible flowshops. This manufacturing environment involves two machine centres representing two consecutive stages of production. Each machine centre is
Two-Stage, Hybrid Flowshop Scheduling Problem
The effectiveness of the proposed heuristic algorithm in finding a minimum makespan schedule is empirically evaluated and found to increase with the increase in the number of jobs.