Back to Search
Start Over
Tabu Search and Simulated Annealing Algorithms for Scheduling in Flow Shops with Lot Streaming.
- Source :
- Proceedings of the Institution of Mechanical Engineers -- Part B -- Engineering Manufacture (Professional Engineering Publishing); Feb2007, Vol. 221 Issue 2, p317-331, 15p, 6 Diagrams, 27 Charts, 4 Graphs
- Publication Year :
- 2007
-
Abstract
- This paper addresses the problem of making sequencing and scheduling decisions for n Jobs in m-machine flow shops with a lot sizing constraint. Lot streaming (lot sizing) is the process of creating sublots to move the completed portion of a production sublot to downstream machines. The planning decisions become more complex when lot streaming is allowed. There is scope for efficient metaheuristics for scheduling problems in an m machine flow shop with lot streaming. In recent years, much attention has been given to heuristics and search techniques. This paper proposes two metaheuristics, namely a simulated annealing algorithm (SA) and a tabu search algorithm (TABU), to evolve the optimal sequence for makespan and total flow time criteria in an m-machine flow shop with lot streaming. The algorithms are evaluated by means of comparison with Baker's algorithm for 2m/c cases and the makespan criterion, which proves the capability of both of them. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 09544054
- Volume :
- 221
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- Proceedings of the Institution of Mechanical Engineers -- Part B -- Engineering Manufacture (Professional Engineering Publishing)
- Publication Type :
- Periodical
- Accession number :
- 30029156
- Full Text :
- https://doi.org/10.1243/09544054JEM334