Title :
A scheduling algorithm for flexible flow shop problem
Author :
Wang, Li ; Li, Dawei
Author_Institution :
Dept. of Math. & Phys., Anshan Inst. of Iron & Steel Technol., Liaoning, China
Abstract :
This paper considers the flexible flow shops scheduling problem. The objective is to minimize the makespan. This is an NP-hard problem. A scheduling algorithm is presented. In this algorithm, the longest-processing-time-first heuristic is used for machine allocation. A genetic algorithm is used for solving the problem of finding a good loading sequence. Finally, the results of experiments are shown.
Keywords :
computational complexity; flexible manufacturing systems; genetic algorithms; production control; NP-hard problem; flexible flow shop problem; genetic algorithm; loading sequence; longest-processing-time-first heuristic; machine allocation; makespan minimisation; scheduling algorithm; Chemical industry; Genetic algorithms; Job shop scheduling; Mathematics; Parallel machines; Petroleum industry; Physics; Processor scheduling; Scheduling algorithm; Steel;
Conference_Titel :
Intelligent Control and Automation, 2002. Proceedings of the 4th World Congress on
Print_ISBN :
0-7803-7268-9
DOI :
10.1109/WCICA.2002.1020102
