Carregant...
Carregant...

Vés al contingut (premeu Retorn)

An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time

Autor
Vila, M.; Pereira, J.
Tipus d'activitat
Article en revista
Revista
European journal of operational research
Data de publicació
2013-08-16
Volum
229
Número
1
Pàgina inicial
106
Pàgina final
113
DOI
https://doi.org/10.1016/j.ejor.2013.03.003 Obrir en finestra nova
Resum
In this article, we present a new exact algorithm for solving the simple assembly line balancing problem given a determined cycle time (SALBP-1). The algorithm is a station-oriented bidirectional branch-and-bound procedure based on a new enumeration strategy that explores the feasible solutions tree in a non-decreasing idle time order. The procedure uses several well-known lower bounds, dominance rules and a new logical test based on the assimilation of the feasibility problem for a given cycle ...
Paraules clau
Assembly Line Balancing, Branch And Bound, Manufacturing
Grup de recerca
OPE-PROTHIUS - Organització de la Producció en Tallers Híbrids

Participants