Beam-ACO for Simple Assembly Line Balancing

Published Online:https://doi.org/10.1287/ijoc.1080.0271

References

  • Baker K. R.Introduction to Sequencing and Scheduling (1974) (John Wiley & Sons, New York) Google Scholar
  • Bautista J., Pereira J., Dorigo M., Di Caro G., Sampels M. Ant algorithms for assembly line balancing. Ant Algorithms—Proc. ANTS 2002—Third Internat. Workshop, Lecture Notes in Computer Science (2002) 2463(Springer-Verlag, Berlin) 65–75CrossrefGoogle Scholar
  • Bautista J., Pereira J. Ant algorithms for a time and space constrained assembly line balancing problem. Eur. J. Oper. Res. (2007) 177(3):2016–2032CrossrefGoogle Scholar
  • Blum C. Beam-ACO—Hybridizing ant colony optimization with beam search: An application to open shop scheduling. Comput. Oper. Res. (2005) 32(6):1565–1591CrossrefGoogle Scholar
  • Blum C., Dorigo M. The hyper-cube framework for ant colony optimization. IEEE Trans. Systems, Man, Cybernetics—Part B (2004) 34:1161–1172CrossrefGoogle Scholar
  • Blum C., Bautista J., Pereira J., Dorigo M., Gambardella L. M., Birattari M., Martinoli A., Poli R., Stützle T. Beam-ACO for assembly line balancing. Proc. ANTS 2006—Fifth Internat. Workshop on Ant Colony Optim. and Swarm Intelligence, Lecture Notes in Computer Science (2006) 4150(Springer-Verlag, Berlin) 96–107Google Scholar
  • Boctor F. F. A multiple-rule heuristic for assembly line balancing. J. Oper. Res. Soc. (1995) 46(1):62–69CrossrefGoogle Scholar
  • Dorigo M., Stützle T.Ant Colony Optimization (2004) (MIT Press, Cambridge, MA) CrossrefGoogle Scholar
  • Falkenauer E., Delchambre E. A genetic algorithm for bin packing and line balancing. Proc. IEEE Internat. Conf. Robotics and Automation (1992) (IEEE Press, Washington, D.C.) 1186–1192CrossrefGoogle Scholar
  • Gonçalves J. F., de Almeida J. R. A hybrid genetic algorithm for assembly line balancing. J. Heuristics (2002) 8(6):629–642CrossrefGoogle Scholar
  • Hackman S. T., Magazine M. J., Wee T. S. Fast, effective algorithms for simple assembly line balancing problems. Oper. Res. (1989) 37(6):916–924LinkGoogle Scholar
  • Hoffmann T. R. EUREKA: A hybrid system for assembly line balancing. Management Sci. (1992) 38(1):39–47LinkGoogle Scholar
  • Johnson R. V. Optimally balancing large assembly lines with “FABLE”. Management Sci. (1988) 34(2):240–253LinkGoogle Scholar
  • Kao E. P. C., Queyranne M. On dynamic programming methods for assembly line balancing. Oper. Res. (1982) 30(2):375–390LinkGoogle Scholar
  • Lapierre D. L., Ruiz A., Soriano P. Balancing assembly lines with tabu search. Eur. J. Oper. Res. (2006) 168(3):826–837CrossrefGoogle Scholar
  • Merkle D., Middendorf M. An ant algorithm with a new pheromone evaluation rule for total tardiness problems. Proc. EvoWorkshops 2000, Lecture Notes in Computer Science (2000) 1803(Springer-Verlag, Berlin) 287–296CrossrefGoogle Scholar
  • Ow P. S., Morton T. E. Filtered beam search in scheduling. Internat. J. Production Res. (1988) 26(1):297–307CrossrefGoogle Scholar
  • Sabuncuoglu I., Erel E., Tanyer M. Assembly line balancing using genetic algorithms. J. Intelligent Manufacturing (2000) 11(3):295–310CrossrefGoogle Scholar
  • Scholl A., Becker C. State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur. J. Oper. Res. (2006) 168(3):666–693CrossrefGoogle Scholar
  • Scholl A., Klein R. SALOME: A bidirectional branch and bound procedure for assembly line balancing. INFORMS J. Comput. (1997) 9(4):319–334LinkGoogle Scholar
  • Scholl A., Klein R. Balancing assembly lines effectively—A computational comparison. Eur. J. Oper. Res. (1999) 114(1):50–58CrossrefGoogle Scholar
  • Scholl A., Voss S. Simple assembly line balancing—Heuristic approaches. J. Heuristics (1996) 2(3):217–244CrossrefGoogle Scholar
  • Sprecher A. Dynamic search tree decomposition for balancing assembly lines by parallel search. Internat. J. Production Res. (2003) 41(7):1423–1430CrossrefGoogle Scholar
  • Talbot F. B., Patterson J. H., Gehrlein J. H. A comparative evaluation of heuristic line balancing techniques. Management Sci. (1986) 32(4):430–454LinkGoogle Scholar
  • Vilarinho P. M., Simaria A. A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations. Internat. J. Production Res. (2002) 40(6):1405–1420CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.