Tabu search and simulated annealing algorithms for scheduling in flow shops with lot streaming

Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture

Volumn 221, Issue 2, 2007, Pages 317-331

  Marimuthu, S ^a   Ponnambalam, S G ^b   Jawahar, N ^c  

^a K L N COLLEGE OF ENGINEERING   (India)

^b MONASH UNIVERSITY MALAYSIA   (Malaysia)

^c THIAGARAJAR COLLEGE OF ENGINEERING   (India)

Author keywords

Flow shop; Lot streaming; Scheduling; Simulated annealing algorithm; Tabu search algorithm

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; METADATA; SCHEDULING; TABU SEARCH;

FLOW SHOP; LOT STREAMING; SIMULATED ANNEALING ALGORITHM; TABU SEARCH ALGORITHM;

SIMULATED ANNEALING;

EID: 34250898096     PISSN: 09544054     EISSN: None     Source Type: Journal    
DOI: 10.1243/09544054JEM334     Document Type: Conference Paper

References (18)

1. Baker, K. R. Introduction to sequencing and scheduling, 1974 (John Wiley & Sons, Inc., New York).
2. Pinedo, M. and Chao, X. Operations scheduling, 1997 (Irwin/McGraw-Hill, New York).
3. Suie, D. R. Industrial scheduling, 1997 (PWS Publishing Company, Boston, Massachusetts).
4. Truscott, W. Production scheduling with capacity constrained transportation activities. J. Opl Managmt, 1986, 6, 333-348.
5. Potts, C. N. and Van Wassenhove, L. N. Integrating scheduling with batching and lot sizing: a review of algorithm and complexity. J. Opl Res. Soc., 1992, 43(5), 395-406.
6. Potts, C. N. and Baker, K. R. Flow shop scheduling with lot streaming. Ops Res. Lett., 1989, 8, 297-303.
7. Baker, K. R. Lot streaming in the two-machine flow shop with set-up times. Ann. Ops Res., 1995, 57, 1-11.
8. Glass, C. A., Gupta, J. N. D., and Potts, C. N. Lot streaming in three-stage process. Eur. J. Opl Res., 1994, 75, 378-394.
9. Vickson, R. G. Optimal lot streaming for multiple products in a two-machine flow shop. Eur. J. Opl Res., 1995, 85, 556-575.
10. Sriskandarajah, C. and Wagneur, E. Lot streaming and scheduling multiple products in two-machine no-wait flow shop. IIE Trans., 1999, 31, 695-707.
11. Kumar, S., Bagchi, T. P., and Sriskandarajah, C. Lot streaming and scheduling heuristics for m-machine no-wait flow shop. Comput. and Ind. Engng, 2000, 38, 149-172.
12. Hall, N. G., Laporte, G., Selvarajah, E., and Sriskandarajah, C. Scheduling and lot streaming in flow shops with no-wait in process. J. Scheduling, 2003, 6(4), 339-354.
13. Liu, S. C. A heuristic method for discrete lot streaming with variable sublots in a flow shop. Int. J. Advd Mfg Technol., 2003, 22, 662-668.
14. Laarhovan, P. J. M. and Aarts, E. H. L. Simulated annealing: theory and applications, 1987 (Kluwer Academic, Dordrecht, The Netherlands).
15. max flow shop problem. Comput. and Ops Res., 1990, 17, 243-253.
16. Parthasarathy, S. and Rajendran, C. An experimental evaluation of heuristics for scheduling in a real life flow shop with sequence-dependent setup time of jobs. Int. J. Prod. Econ., 1997, 49, 255-263.
17. Glover, F., Kelly, J. P., and Laguna, M. Genetic algorithms and Tabu search: hybrids for optimization. Comput. and Ops Res., 1995, 22(1), 111-134.
18. Liu, S. and Ong, H. L. A comparative study of algorithms for the flow shop scheduling problem. Asia-Pacific J. Opl Res., 2002, 19, 205-222.