A branch, bound, and remember algorithm for the simple assembly line balancing problem

INFORMS Journal on Computing

Volumn 24, Issue 3, 2012, Pages 433-442

  Sewell, E C ^a   Jacobson, S H ^b  

^a SOUTHERN ILLINOIS UNIVERSITY EDWARDSVILLE   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Branch and bound; Combinatorial optimization; Heuristics; Production; Programming

Indexed keywords

ASSEMBLY LINE BALANCING PROBLEMS; BEST-KNOWN ALGORITHMS; BRANCH AND BOUNDS; EXACT ALGORITHMS; HEURISTICS; OPTIMAL SOLUTIONS; SIMPLE ASSEMBLY LINE BALANCING; SUB-PROBLEMS;

COMBINATORIAL OPTIMIZATION; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; PRODUCTION;

ALGORITHMS;

EID: 84867541884     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1110.0462     Document Type: Article

References (32)

1. Bautista, J., J. Pereira. 2002. Ant algorithms for assembly line balancing. M. Dorigo, G. Di Caro, M. Sampels, eds. Ant Algorithms: 3rd Internat. Workshop. Lecture Notes in Computer Science, Vol. 2463. Springer, Berlin, 49-61.
2. Bautista, J., J. Pereira. 2007. Ant algorithms for a time and space constrained assembly line balancing problem. Eur. J. Oper. Res. 177(3) 2016-2032.
3. Bautista, J., J. Pereira. 2009. A dynamic programming-based heuristic for the assembly line balancing problem. Eur. J. Oper. Res. 194(3) 787-794.
4. Bautista, J., R. Suarez, M. Mateo, R. Companys. 2000. Local search heuristics for the assembly line balancing problem with incompatibilities between tasks. Proc. 2000 IEEE Internat. Conf. Robotics and Automation, IEEE, Piscataway, NJ, 2404-2409.
5. Becker, C., A. Scholl. 2006. A survey on problems and methods in generalized assembly line balancing. Eur. J. Oper. Res. 168(3) 694-715.
6. Blum, C. 2008. Beam-ACO for simple assembly line balancing. INFORMS J. Comput. 20(4) 618-627.
7. Boysen, N., M. Fliedner, A. Scholl. 2007. A classification of assembly line balancing problems. Eur. J. Oper. Res. 183(2) 674-693.
8. Dechter, R., J. Pearl. 1985. Generalized best-first search strategies and the optimality of A. J. Assoc. Comput. Machinery 32(3) 505-536.
9. Easton, F. F. 1990. A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem. Comput. Oper. Res. 17(2) 163-175.
10. Fleszar, K., K. S. Hindi. 2003. An enumerative heuristic and reduction methods for the assembly line balancing problem. Eur. J. Oper. Res. 145(3) 606-620.
11. Gourgand, M., N. Grangeon, S. Norre. 2007. Metaheuristics based on bin packing for the line balancing problem. RAIRO Oper. Res. 41(2) 193-211.
12. Hall, S. N., S. H. Jacobson, E. C. Sewell. 2008. An analysis of pediatric vaccine formulary selection problems. Oper. Res. 56(6) 1348-1365.
13. Hoffmann, T. R. 1963. Assembly line balancing with a precedence matrix. Management Sci. 9(4) 551-562.
14. Hoffmann, T. R. 1990. Assembly line balancing: A set of challenging problems. Internat. J. Production Res. 28(10) 1807-1815.
15. Hoffmann, T. R. 1992. EUREKA: A hybrid system for assembly line balancing. Management Sci. 38(1) 39-47.
16. Johnson, R. V. 1988. Optimally balancing large assembly lines with "FABLE." Management Sci. 34(2) 240-253.
17. Jouglet, A., P. Baptiste, J. Carlier. 2004. Branch-and-bound algorithms for total weighted tardiness. J. Y.-T. Leung, ed. Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Chapter 13. CRC Press, Boca Raton, FL.
18. i scheduling problem. J. Scheduling 12(2) 163-175.
19. i scheduling problem. Comput. Optim. Appl. Forthcoming.
20. Korf, R. E. 2003. An improved algorithm for optimal bin packing. Proc. 18th Internat. Joint Conf. Artificial Intelligence, Morgan Kaufmann, San Francisco, 1252-1258.
21. Lapierre, S. D., A. Ruiz, P. Soriano. 2006. Balancing assembly lines with tabu search. Eur. J. Oper. Res. 168(3) 826-837.
22. Michie, D. 1968. "Memo" functions and machine learning. Nature 218(5136) 19-22.
23. Morin, T. L., R. E. Marsten. 1976. Branch-and-bound strategies for dynamic programming. Oper. Res. 24(4) 611-627.
24. Nourie, F. J., E. R. Venta. 1991. Finding optimal line balances with OptPack. Oper. Res. Lett. 10(3) 165-171.
25. Sabuncuoglu, I., E. Erel, M. Tanyer. 2000. Assembly line balancing using genetic algorithms. J. Intelligent Manufacturing 11(3) 295-310.
26. Scholl, A., C. Becker. 2006. State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur. J. Oper. Res. 168(3) 666-693.
27. Scholl, A., R. Klein. 1997. SALOME: A bidirectional branchand-bound procedure for assembly line balancing. INFORMS J. Comput. 9(4) 319-334.
28. Scholl, A., R. Klein. 1999. Balancing assembly lines effectively-A computational comparison. Eur. J. Oper. Res. 114(1) 50-58.
29. Scholl, A., S. Voß. 1996. Simple assembly line balancing-Heuristic approaches. J. Heuristics 2(3) 217-244.
30. Sewell, E. C., G. K. Kao, S. H. Jacobson. 2009. A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times. Technical report, Southern Illinois University, Edwardsville.
31. Sprecher, A. 1999. A competitive branch-and-bound algorithm for the simple assembly line balancing problem. Internat. J. Production Res. 37(8) 1787-1816.
32. Talbot, F. B., J. H. Patterson, W. V. Gehrlein. 1986. A comparative evaluation of heuristic line balancing techniques. Management Sci. 32(4) 430-454.