Similar Search Results

A branch-and-bound algorithm for assembly line worker assignment and balancing problems

Vilà, Mariona; Pereira, Jordi - In: Computers & operations research : and their … 44 (2014), pp. 105-114

Persistent link: https://www.econbiz.de/10010241366

A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem

Álvarez-Miranda, Eduardo; Pereira, Jordi; Vilà, Mariona - In: Computers & operations research : an international journal 166 (2024), pp. 1-16

Persistent link: https://www.econbiz.de/10014563804

Analysis of the simple assembly line balancing problem complexity

Álvarez-Miranda, Eduardo; Pereira, Jordi; Vilà, Mariona - In: Computers & operations research : and their … 159 (2023), pp. 1-14

Persistent link: https://www.econbiz.de/10014455580

A note on "algorithms for the Calzedonia workload allocation problem"

Pereira, Jordi; Ritt, Marcus - In: Journal of the Operational Research Society 73 (2022) 6, pp. 1420-1422

Persistent link: https://www.econbiz.de/10013373012

Exact and heuristic methods for a workload allocation problem with chain precedence constraints

Pereira, Jordi; Ritt, Marcus - In: European journal of operational research : EJOR 309 (2023) 1, pp. 387-398

Persistent link: https://www.econbiz.de/10014290545

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

Vilà, Mariona; Pereira, Jordi - In: European Journal of Operational Research 229 (2013) 1, pp. 106-113

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...

Persistent link: https://www.econbiz.de/10011052608