Local search algorithms for the min-max loop layout problem

Journal of the Operational Research Society

Volumn 53, Issue 10 SPEC., 2002, Pages 1109-1117

  Bennell, J A ^a   Potts, C N ^a   Whitehead, J D ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Insertion algorithm; Iterated descent; Local search; Loop layout; Tabu search

Indexed keywords

ALGORITHMS; BELT CONVEYORS; COMPUTATIONAL METHODS; HEURISTIC METHODS; ITERATIVE METHODS; LINEAR PROGRAMMING; MACHINERY; OPTIMIZATION; PROBLEM SOLVING; PRODUCTION CONTROL;

INSERTION ALGORITHMS; MIN-MAX LOOP LAYOUT PROBLEMS;

OPERATIONS RESEARCH;

EID: 0036790095     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601269     Document Type: Article

References (19)

1. Kouvelis P., Chiang W.C. and Kiran A.S. (1992). A survey of layout issues in flexible manufacturing systems. Omega 20: 375-390.
2. Hassan M.M.D. (1994). Machine layout problem in modem manufacturing facilities. Int J Prod Res 11: 2559-2584.
3. Afentakis P. (1989). A loop layout design problem for flexible manufacturing systems. Int J Flexible Manuf Syst 1: 175-196.
4. Kouvelis P. and Kim M.W. (1992). Unidirectional loop network layout problem in automated manufacturing systems. Opns Res 40: 533-550.
5. Cheng R. and Gen M. (1998). Loop layout design problem in flexible manufacturing systems using genetic algorithms. Comput Indust Engng 34: 53-61.
6. Leung J. (1992). A graph-theoretic heuristic for designing loop-layout manufacturing systems. Eur J Opl Res 57: 243-252.
7. Leung J. (1994). Polyhedral structure and properties of a model for layout design. Eur J Opl Res 77: 195-207.
8. Nawaz M., Enscore Jr. E.E. and Ham I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11: 91-95.
9. Laguna M., Marti R. and Campos V. (1999). Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput Opns Res 26: 1217-1230.
10. Baum E.B. (1986). Iterated descent: a better algorithm for local search in combinatorial optimization problems. Unpublished manuscript.
11. Baum E.B. (1986). Towards practical 'neural' computation for combinatorial optimization problems. In: Denker J.S. (ed). Neural Networks for Computing. Proceedings AIP Conference 151, American Institute of Physics; New York, pp 53-58.
12. Lourenço H.R., Martin O.C. and Stützle T. (2001). Iterated local search. In: Glover F. and Kochenberger (eds). Handbook of Metaheuristics. Kluwer: Boston, to appear.
13. Glover F. (1986). Future paths for integer programming and links to artificial intelligence. Comput Opns Res 13: 533-549.
14. Hansen P. (1986). The steepest descent mildest ascent heuristic. Conference paper, Computational Issues in Combinatorial Optimization. Capri.
15. Hertz A., Taillard E. and de Werra D. (1997). Tabu search. In: Aarts E. and Lenstra J.K.L. (eds). Local Search in Combinatorial Optimization. Wiley: Chichester, pp 121-136.
16. Glover F. and Laguna M. (1997). Tabu Search. Kluwer: Boston, MA.
17. Taillard E.D. (1994). Parallel taboo search techniques for the job shop scheduling problem. ORSA J Comput 6: 108-117.
18. Thesen A. (1998). Design and evaluation of tabu search algorithms for multiprocessor scheduling. J Heuristics 4: 141-160.
19. Congram, R.K. (2000). Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation. PhD thesis, University of Southampton.