Heuristic algorithms for minimizing total completion time in a two-machine flowshop with sequence-independent setup times

Author

Msakni, Mohamed Kais ; Ladhari, Talel ; Allahverdi, Ali

Author_Institution

Unit de Rech. ROI, Ecole Polytech. de Tunisie, La Marsa, Tunisia

fYear

2009

fDate

6-9 July 2009

Firstpage

90

Lastpage

95

Abstract

In this paper, we address the two-machine flowshop with sequence-independent setup times. Heuristic algorithms are proposed to find a near-optimal solution. We propose a constructive heuristic based on new priority rule, local search procedures and a genetic local search algorithm for the problem under consideration. Computational results show that local search procedures contribute to have a better results.

Keywords

flow shop scheduling; genetic algorithms; constructive heuristic; genetic local search; heuristic algorithm; near-optimal solution; priority rule; sequence-independent setup times; total completion time; two-machine flowshop; Databases; Educational institutions; Engineering management; Genetic algorithms; Heuristic algorithms; Job shop scheduling; Petroleum industry; Routing; Sociotechnical systems; Systems engineering and theory; Flowshop; Genetic algorithm; Local search procedure; Setup times; Total completion time;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers & Industrial Engineering, 2009. CIE 2009. International Conference on

Conference_Location

Troyes

Print_ISBN

978-1-4244-4135-8

Electronic_ISBN

978-1-4244-4136-5

Type

conf

DOI

10.1109/ICCIE.2009.5223857

Filename

5223857