Skip to main content
padlock icon - secure page this page is secure

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

Buy Article:

$61.00 + tax (Refund Policy)

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
No Metrics

Keywords: capacitated lotsizing problem; genetic algorithm; permutation flow shop; sequence-dependent setups

Document Type: Research Article

Affiliations: 1: Department of Industrial Engineering, Faculty of Engineering,Tarbiat Moallem University, Karaj, Iran 2: Department of Industrial Engineering,Amirkabir University of Technology, 424, Hafez Avenue15916-34311Tehran, Iran 3: Department of Industrial Engineering,Tarbiat Modares University, P.O. Box 14115-179Tehran, Iran

Publication date: January 1, 2011

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more