A heuristic for total flowtime minimization in flow shop scheduling

Author

Gao, Xiang ; Li, Xiao-ping ; Zhang, Hong-Fang

Author_Institution

Dept. of Comput. Sci. & Technol., Harbin Univ. of Sci. & Technol., China

Volume

6

fYear

2005

fDate

18-21 Aug. 2005

Firstpage

3656

Abstract

In this paper, DIH (double inserting heuristic) is proposed for flow shops with total flowtime minimization, in which the initial solution is improved by combing local-insertion with global-insertion. As well, partial inserting selection is introduced to reduce the computation time. DIH is compared with three best existing heuristics, RZ, WY and FL, on 6000 randomly generated instances in both effectiveness and efficiency. Computational results show that DIH is the best in effectiveness and the CPU time of DIH is more than that of WY or RZ but less than that of FL.

Keywords

computational complexity; flow shop scheduling; minimisation; computation time; double inserting heuristic; flow shop scheduling; flowtime minimization; partial inserting selection; Computer aided manufacturing; Computer science; High performance computing; Information science; Job shop scheduling; Manufacturing industries; Manufacturing systems; Optimal scheduling; Polynomials; Processor scheduling; Heuristic; flow shop; scheduling; total flowtime;

fLanguage

English

Publisher

ieee

Conference_Titel

Machine Learning and Cybernetics, 2005. Proceedings of 2005 International Conference on

Conference_Location

Guangzhou, China

Print_ISBN

0-7803-9091-1

Type

conf

DOI

10.1109/ICMLC.2005.1527576

Filename

1527576