An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time |
| |
Authors: | Mariona Vilà Jordi Pereira |
| |
Institution: | Escola Universitària d’Enginyeria Tècnica Industrial de Barcelona (EUETIB), Universitat Politècnica de Catalunya, C. Comte Urgell, 187 1st Floor, 08036 Barcelona, Spain |
| |
Abstract: | 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 time and number of stations (SALBP-F) to a maximum-flow problem. |
| |
Keywords: | Branch and bound Manufacturing Assembly line balancing |
本文献已被 ScienceDirect 等数据库收录! |