Search Results - person:"Vilà, Mariona"

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

Variable-depth local search heuristic for assembly line balancing problems

Álvarez-Miranda, Eduardo; Pereira, Jordi; Vargas, Camila; … - In: International journal of production research 61 (2023) 9, pp. 3103-3121

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

A new model for supply chain network design with integrated assembly line balancing decisions

Pereira, Jordi; Vilà, Mariona - In: International journal of production research 54 (2016) 9/10, pp. 2653-2669

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

An exact algorithm for the mixed-model level scheduling problem

Pereira, Jordi; Vilà, Mariona - In: International journal of production research 53 (2015) 19, pp. 5809-5825

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

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

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

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 : EJOR 229 (2013) 1, pp. 106-113

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

Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties

Vilà, Mariona; Pereira, Jordi - In: Computers & operations research : and their … 40 (2013) 7, pp. 1819-1828

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

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 : EJOR 229 (2013) 1, pp. 106-113

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