A dynamic programming based heuristic for the assembly line balancing problem

European Journal of Operational Research

Volumn 194, Issue 3, 2009, Pages 787-794

  Bautista, Joaquín ^a   Pereira, Jordi ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Assembly line balancing; Bounded Dynamic Programming; Car manufacturing; Production

Indexed keywords

ASSEMBLY MACHINES; DYNAMIC PROGRAMMING; HEURISTIC METHODS; PROBLEM SOLVING; SYSTEMS ENGINEERING;

ASSEMBLY LINE BALANCING; ASSEMBLY LINE BALANCING PROBLEMS; ASSEMBLY LINES; BOUNDED DYNAMIC PROGRAMMING; CAR MANUFACTURING; COMPUTING TIMES; OPTIMAL SOLUTIONS; REAL PROBLEMS; SPACE BASED; STATE SPACES;

ASSEMBLY;

EID: 55149094562     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.01.016     Document Type: Article

References (22)

1. Bautista J., Companys R., and Corominas A. Heuristics and exact algorithms for solving the Monden problem. European Journal of Operational Research 88 (1996) 101-113
2. Bautista J., and Pereira J. Ant algorithms for a time and space constrained assembly line balancing problem. European Journal of Operational Research 177 (2007) 2016-2032
3. Baybars I. A survey of exact algorithms for the simple assembly line balancing problem. Management Science 32 (1986) 909-932
4. Becker C., and Scholl A. A survey on problems and methods in generalized assembly line balancing. European Journal of Operational Research 168 (2006) 694-715
5. Bellman R. Dynamic Programming (2003), Dover Publications
6. Blum C., Bautista J., and Pereira J. Beam-ACO Applied to Assembly Line Balancing. Lecture Notes in Computer Science 4150 (2006) 96-107
7. Boysen N., Fliedner M., and Scholl A. A classification of assembly line balancing problems. European Journal of Operational Research 183 (2007) 674-693
8. Christofides N., Mingozzi A., and Toth P. State-space relaxation procedures for the computation of bounds to routing problems. Networks 11 (1981) 145-164
9. Easton F., Faaland B., Klastorin T.D., and Schmitt T. Improved Network based algorithms for the assembly line balancing problem. International Journal of Production Research 27 (1989) 1901-1915
10. Fleszar K., and Hindi K.S. An enumerative heuristic and reduction methods for the assembly line balancing problem. European Journal of Operational Research 145 (2003) 606-620
11. Gutjahr A.L., and Nemhauser G.L. An algorithm for the line balancing problem. Management Science 11 (1964) 308-315
12. Held M., Karp R.M., and Shareshian R. Assembly line balancing - Dynamic programming with precedence constraints. Operations Research 11 (1963) 442-459
13. Hoffmann T.R. Assembly line balancing with a precedence matrix. Management Science 9 (1963) 551-562
14. Jackson J.R. A computing procedure for a line balancing problem. Management Science 2 (1956) 261-271
15. Lapierre S.D., Ruiz A., and Soriano P. Balancing assembly lines with tabu search. European Journal of Operational Research 168 (2006) 826-837
16. Martello S., and Toth P. Knapsack Problems - Algorithms and Computer Implementations (1990), Wiley, New York
17. Ow P.S., and Morton T.E. Filtered beam search in scheduling. International Journal of Production Research 26 (1988) 35-62
18. Scholl A. Balancing and Sequencing Assembly Lines. second ed. (1999), Physica, Heidelberg
19. Scholl A., and Becker C. State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. European Journal of Operational Research 168 (2006) 666-693
20. Scholl A., and Klein R. SALOME: A bidirectional branch and bound procedure for assembly line balancing. INFORMS Journal on Computing 9 (1997) 319-334
21. Scholl A., and Voß S. Simple assembly line balancing - Heuristic approaches. Journal of Heuristics 2 (1996) 217-244
22. Talbot F.B., Patterson J.H., and Gehrlein W.V. A comparative evaluation of heuristic line balancing techniques. Management Science 32 (1986) 430-454