A hybrid genetic algorithm for flowshop lot streaming with setups and variable sublots

International Journal of Production Research

Volumn 48, Issue 6, 2010, Pages 1705-1726

  Defersha, Fantahun M ^a   Chen, Mingyuan ^a  

^a Dept of Electrical and Computer Engineering   (Canada)

Author keywords

Hybrid genetic algorithm; Lot streaming; Variable sublots

Indexed keywords

COMPUTATIONAL RESULTS; EFFICIENT SOLUTION PROCEDURE; FLOW-SHOPS; HYBRID GENETIC ALGORITHMS; LEADTIME; LOT STREAMING; MANUFACTURING LEAD-TIME; MATHEMATICAL PROGRAMMING MODELS; MULTI-STAGE MANUFACTURING SYSTEMS; OPTIMALITY; OPTIMISATIONS; SET-UP TIME;

COMPUTATIONAL EFFICIENCY; GENETIC ALGORITHMS; MATHEMATICAL PROGRAMMING; STREAM FLOW;

PROBLEM SOLVING;

EID: 74549175886     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540802660544     Document Type: Article

References (20)

1. Baker, K.R and Pyke, D.F., 1990. Solution procedures for the lot-streaming problem. Decision Sciences, 21 (3), 475-491.
2. Baker, K.R., 1995. Lot streaming in the two-machine flow shop with setup times. Annals of Operations Research, 57 (1), 1-11.
3. Biskup, D. and Feldmann, M., 2006. Lot streaming with variable sublots: an integer programming formulation. Journal of Operational Research Society, 57 (3), 296-303.
4. Blackburn, J., 1991. Time-based competition. Burr Ridge, IL: Business One Irwin.
5. Bockerstette, J. and Shell, R., 1993. Time based manufacturing. New York: McGraw-Hill.
6. Chang, J.H. and Chiu, H.N., 2005. A comprehensive review of lot streaming. International Journal of Production Research, 43 (8), 1515-1536.
7. Feldmann, M. and Biskup, D., 2008. Lot streaming in a multiple product permutation flow shop with intermingling. International Journal ofProduction Research, 46 (1), 197-216.
8. Glass, C.A., Gupta, J.N.D., and Potts, C., 1994. Lot streaming in three-stage process. European Journal ofOperations Research, 75 (2), 378-394.
9. Hall, N.G., et al. , 2003. Scheduling and lot streaming in flow shops with no-wait in process. Journal of Scheduling, 6 (4), 339-354.
10. ILOG Inc., 2003. CPLEX 9.0 users manual. Mountain View, CA: ILOG. Available from: http://www.ilog.com [Accessed 1 August 2008].
11. Kumar, S., Bagchi, T., and Sriskandarajah, C., 2000. Lot streaming and scheduling heuristics or m-machine no-wait flow shop. Computers and Industrial Engineering, 38 (1), 149-172.
12. Lindo Systems Inc., 2002. LINGO: users guide. Chicago, IL: Lindo Systems.
13. Liu, S.C., 2003. A heuristic method for discrete lot streaming with variable sublots in a flow shop. nternational Journal of Advanced Manufacturing Technology, 22 (9), 662-668.
14. Marimuthu, S., Ponnambalam, S.G., and Jawahar, A.N., 2008. Evolutionary algorithms for scheduling m-machine flow shop with lot streaming. Robotics and Computer-Integrated Manufacturing, 24 (1), 125-139.
15. Martin, C.H., 2009. A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming. OMEGA International Journal of Management Sciences, 37 (1), 126-137.
16. Potts, C. and Baker, K., 1989. Flow shop scheduling with lot streaming. Operations Research Letters, 8 (6), 297-303.
17. Reiter, S., 1966. A system for managing job shop production. Journal of Business, 39 (3), 371-393.
18. Sriskandarajah, C. and Wagneur, E., 1999. Lot streaming and scheduling multiple products in two-machine no-wait flow shop. IIE Transactions, 31 (8), 695-707.
19. Teghem, J., Pinot, M., and Antoniadis, C., 1995. Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem. Journal of Computational and Applied Mathematics, 64 (1-2), 91-102.
20. Vickson, R., 1995. Optimal lot streaming for multiple products in a two-machine flow shop. European Journal ofOperations Research, 85 (3), 556-575.