Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop

Talel Ladhari and Mohamed Ali Rakrouki

International Journal of Production Economics, 2009, vol. 122, issue 2, 678-691

Abstract: We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop subject to release dates. We develop several lower bounds and we describe constructive heuristics as well as an effective genetic local search algorithm. Computational experiments carried out on a large set of randomly generated instances provide evidence that a constructive heuristic based on new derived priority rule as well as the genetic algorithm perform consistently well.

Keywords: Flowshop; Constructive; heuristics; Flowtime; Release; dates; Genetic; algorithm (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(09)00232-1
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:122:y:2009:i:2:p:678-691

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 ().