A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem

Lin-Yu Tseng and Ya-Tai Lin

International Journal of Production Economics, 2010, vol. 127, issue 1, 121-128

Abstract: Recently, the flowshop scheduling problem to minimize total flowtime has attracted more attention from researchers. In this paper, a genetic local search algorithm is proposed to solve this problem. The proposed algorithm hybridizes the genetic algorithm and the tabu search. It employs the genetic algorithm to do the global search and the tabu search to do the local search. The orthogonal-array-based crossover is utilized to enhance the capability of intensification. Also, a novel orthogonal-array-based mutation is proposed, in order to add capability of intensification to the traditional mutation operator. The performance of the proposed genetic local search algorithm is very competitive. It improved 54 out of 90 current best solutions reported in the literature for short-term search, and it also improved 18 out of 20 current best solutions reported in the literature for long-term search.

Keywords: Genetic; algorithm; Tabu; search; Flowshop; scheduling; Total; flowtime; Genetic; local; search (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(10)00183-0
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:127:y:2010:i:1:p:121-128

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().