We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Heuristic search algorithms for lot streaming in a two-machine flowshop.
- Authors
Marimuthu, S.; Ponnambalam, S.G.
- Abstract
The objective of this paper is to propose and evaluate heuristic search algorithms for a two-machine flowshop problem with multiple jobs requiring lot streaming that minimizes makespan. A job here implies many identical items. Lot streaming creates sublots to move the completed portion of a production lot to second machine. The three heuristic search algorithms evaluated in this paper are Baker’s approach (Baker), genetic algorithm (GA) and simulated annealing (SA) algorithm. To create neighborhoods for SA, three perturbation schemes, viz., pair-wise exchange, insertion and random insertion are used, and the performance of these on the final schedule is also compared. A wide variety of data sets is randomly generated for comparative evaluation. The parameters for GA and SA are obtained after conducting sensitivity analysis. The genetic algorithm is found to perform well for lot streaming in the two-machine flowshop scheduling.
- Subjects
ALGORITHMS; GENETIC algorithms; HEURISTIC; MACHINERY; PRODUCTION scheduling; SIMULATED annealing
- Publication
International Journal of Advanced Manufacturing Technology, 2006, Vol 27, Issue 1/2, p174
- ISSN
0268-3768
- Publication type
Article
- DOI
10.1007/s00170-004-2127-2