Affordable Access

Publisher Website

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

Authors
Journal
International Journal of Production Economics
0925-5273
Publisher
Elsevier
Publication Date
Volume
122
Issue
2
Identifiers
DOI: 10.1016/j.ijpe.2009.06.031
Keywords
  • Flowshop
  • Constructive Heuristics
  • Flowtime
  • Release Dates
  • Genetic Algorithm
Disciplines
  • Computer Science
  • Mathematics

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.