Tabu search algorithms for an industrial multi-product and multi-objective assembly line balancing problem, with reduction of the task dispersion

Journal of the Operational Research Society

Volumn 53, Issue 12, 2002, Pages 1317-1323

  Pastor, Rafael ^a   Andres C ^b   Duran, A ^c   Perez M ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^c NONE

Author keywords

Assembly line balancing; Heuristics; Production; Tabu search

Indexed keywords

FORECASTING; HEURISTIC METHODS; PROBLEM SOLVING; PRODUCTION ENGINEERING;

ASSEMBLY LINE BALANCING;

OPERATIONS RESEARCH;

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

References (36)

1. Duran A. and Pérez M. (1999). Equilibrat d'una línia de muntatge minimitzant el temps de cicle, gplicació a un cas real Technology University of Catalonia: Barcelona.
2. Baybars I. (1986). A survey of exact algorithms for the simple assembly line balancing problem. Mngt Sci 32: 909-932.
3. Wee T.S. and Magazine M.J. (1982). Assembly line balancing as generalized bin packing. Opns Res Letters 1:56-58.
4. Ghosh S. and Gagnon R.J. (1989). A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems. Int J Prob Res 27:637-670.
5. Scholl A. (1999). Balancing and Sequencing of Assembly Lines (2nd edition). Physica-Verlag Heidelberg: Germany.
6. Scholl A and Voss S (1996). Simple assembly line balancing- Heuristic approaches. J Heuristics 2: 217-244.
7. White W.W. (1961). Comments on a paper by Bowman. Opns Res 9: 274-276.
8. Talbot F.B. and Patterson J.H. (1984). An integer programming algorithm with network cuts for solving the assembly line balancing problem. Mngt Sci 30:85-99.
9. Easton F.F. (1990). A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem. Comput Opns Res 17:163-175.
10. Kao E.P.C. and Queyraune M. (1982). On dynamic programming methods for assembly line balancing. Opns Res 30: 375-390.
11. Schrage L. and Baker K.R. (1978). Dynamic programming solution of sequencing problems with precedence constraints. Opns Res 26: 444-449.
12. Johnson R.V. (1988). Optimally balancing large assembly lines with FABLE. Mngt Sci 34: 240-253.
13. Hoffmann T.R. (1992). EUREKA: A hybrid system for assembly line balancing. Mngt Sci 38: 39-47.
14. Scholl A. and Klein R. (1997). SALOME: A bidirectional branch and bound procedure for assembly line balancing. Informs J Comput 9:319-334.
15. Park K., Park S. and Kim W. (1997). A heuristic for an assembly line balancing problem with incompatibility, range, and partial precedence constraints. Comput Ind Eng 32: 321-332.
16. Rachamadugu R. (1991). Assembly line design with incompa-tible task assignments. J Opns Mngt 10: 469-487.
17. Ventura R. (1996). Algorismes greedy per a la determinació del hombre mínim d'estacions en línies de muntatge. Technology University of Catalonia: Barcelona.
18. Berger I., Bourjolly J.M. and Laporte G. (1992). Branch- and-bound algorithm for the multi-product assembly line balancing problem. Eur J Opl Res 58: 215-222.
19. Malakooti B. and Kumar A. (1996). A knowledge-based system for solving multi-objective assembly line balancing problems. Int J Prod Res 34: 2533-2552.
20. Rubinovitz J. and Levitin G. (1995). Genetic algorithm for assembly line balancing. Int J Prod Econ 41: 343-354.
21. Suresh G. and Sahu S. (1994). Stochastic assembly line balancing using stimulated annealing. Int J Prod Res 32: 1801-1810.
22. Glover F. (1989). Tabu search-Part I. ORSA J Comput 1: 190-206.
23. Glover F. (1990). Tabu search-Part II. ORSA J Comput 2: 4-32.
24. Glover F. and Laguna M. (1997). Tabu Search. Kluwer: Boston.
25. Laguna M., Barnes J.W. and Glover F. (1991). Tabu search methods for single machine scheduling problem. J Intelligent Manufacturing 2: 63-74.
26. Chiang W.-C. (1998). The application of a tabu search metaheuristic to the assembly line balancing problem. Ann Opns Res 77: 209-227.
27. Htihscher R. and Glover F. (1994). Applying tabu search with influential diversification to multiprocessor scheduling. Comput Opns Res 21:877-884.
28. Voss S. (1994). Tabu search in manufacturing. In: Dyckhoff H., Derigs U., Salomon M. and Tijms H.C. (eds). Operational Research Proceedings 1993. Springer: Berlin, pp 183-194.
29. Saltzman M.J. and Baybars I. (1987). A two-process implicit enumeration algorithm for the simple assembly line balancing problem. Eur J Opl Res 32:118-129.
30. Boctor F.F. (1995). A multiple-rule heuristic for assembly line balancing. J Opl Res Soc 46:62-69.
31. Bhattacharjee T.K. and Sahu S. (1989). A comparative study of heuristic general assembly line balancing techniques. Asia- Pacific J Opl Res 6: 63-76.
32. Helgeson W.P. and Birnie D.P. (1961). Assembly line balancing using ranked positional weight technique. J Industrial Eng 12: 394-398.
33. Moodie C.L. and Young H.H. (1965). A heuristic method of assembly line balancing for assumptions of constant or variable work element times. J Industrial Eng 16: 23-29.
34. Tonge F.M. (1965). Assembly line balancing using probabilistic combination of heuristics. Mngt Sci 11: 727-735.
35. Talbot F.B., Patterson J.H. and Gehrlein W.V. (1986). A comparative evaluation of heuristic line balancing techniques. Mngt Sci 32: 430-456.
36. Klein R. and Scholl A. (1996). Maximizing the production rate in simple assembly line balancing-A branch and bound procedure. Eur J Opl Res 91: 367-385.