Mariona Vilà

According to our database, Mariona Vilà authored at least 8 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

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

Eduardo Álvarez-Miranda, Jordi Pereira, Mariona Vilà

Comput. Oper. Res., 2024

2023

Analysis of the simple assembly line balancing problem complexity.

Eduardo Álvarez-Miranda, Jordi Pereira, Mariona Vilà

Comput. Oper. Res., November, 2023

Variable-depth local search heuristic for assembly line balancing problems.

Eduardo Álvarez-Miranda, Jordi Pereira, Camila Vargas, Mariona Vilà

Int. J. Prod. Res., May, 2023

2015

Variable neighborhood search heuristics for a test assembly design problem.

Jordi Pereira, Mariona Vilà

Expert Syst. Appl., 2015

2014

A note on 'Exact and approximate methods for a one-dimensional minimax bin-packing problem' [Annals of Operations Research (2013) 206: 611-626].

Mariona Vilà, Jordi Pereira

CoRR, 2014

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

Mariona Vilà, Jordi Pereira

Comput. Oper. Res., 2014

2013

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

Mariona Vilà, Jordi Pereira

Eur. J. Oper. Res., 2013

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

Mariona Vilà, Jordi Pereira

Comput. Oper. Res., 2013