A genetic algorithm for simultaneous lotsizing and sequencing of the permutation flow shops with sequence-dependent setups

Abstract

This article proposes a genetic algorithm (GA) for the simultaneous lotsizing and sequencing problem in permutation flow shops involving sequence-dependent setups and capacity constraints. To evaluate the effectiveness of the proposed GA, two lower bounds are developed and compared against the optimal solution. The results of GA are compared with the selected lower bound.

Keywords:

• capacitated lotsizing problem
• permutation flow shop
• sequence-dependent setups
• genetic algorithm