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.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
capacitated lotsizing problem;
permutation flow shop;
Document Type: Research Article
Department of Industrial Engineering, Faculty of Engineering,Tarbiat Moallem University, Karaj, Iran
Department of Industrial Engineering,Amirkabir University of Technology, 424, Hafez Avenue15916-34311Tehran, Iran
Department of Industrial Engineering,Tarbiat Modares University, P.O. Box 14115-179Tehran, Iran
January 1, 2011
More about this publication?