Home > Table of Contents


Proceedings of the 2nd International Symposium on Information Processing (ISIP 2009)

Huangshan, China, August 21-23, 2009

Editors: Fei Yu, Jian Shu, and Guangxue Yue

AP Catalog Number: AP-PROC-CS-09CN002

ISBN: 978-952-5726-02-2 (Print), 978-952-5726-03-9 (CD-ROM)

Page(s): 381-386

Single Hoist Scheduling in No-Wait Flexible Flow Shop System

Wang Shilong, Yao Wei, and Zhou Jie

Full text: PDF


This paper studies the single hoist scheduling problem in no-wait flexible flow shop system with constant process times. The objective is to minimize the make span in the given job tasks. Different jobs have different process routes and process times. When a job starts, workstation must be free to process the job, and as soon as it is finished, the hoist must be free to move it to the next workstation. In this paper, a mathematics model is developed. A hybrid genetic algorithm and simulated annealing algorithm is proposed to find optical solutions to the problem. Examples are given to demonstrate the effectiveness of the model in different types of problem.

Index Terms

Hoist Scheduling; No-wait Flexible Flow Shop System; Genetic Simulated Annealing Algorithm

Copyright @ 2009 ACADEMY PUBLISHER All rights reserved