Alysson M. Costa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Alysson M. Costa has a total of 82 co-authors. Here are the top co-authors by number of shared publications:
Cristóbal Miralles
6 shared publications- Marcus Ritt
Institute of Informatics Universidade Federal do Rio Grande do Sul Porto Alegre Brazil
5 shared publications - Mayron César de Oliveira Moreira
UFLA / UFMG
5 shared publications J. Angus Webb
Senior Lecturer, Dept. of Infrastructure Engineering, Univ. of Melbourne, Parkville, VIC 3010, Australia
4 shared publicationsJoanna M. Szemis
Research Fellow, Dept. of Infrastructure Engineering, Univ. of Melbourne, Parkville, VIC 3010, Australia
4 shared publicationsSimranjit Kaur
Research Fellow, Dept. of Infrastructure Engineering, Univ. of Melbourne, Parkville, VIC 3010, Australia
4 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by FapUNIFESP (SciELO) in Pesquisa Operacional
- Vol. 46
A SURVEY ON BENDERS DECOMPOSITION METHODS APPLIED TO ASSEMBLY LINE BALANCING PROBLEMS
This survey presents a comprehensive review on the application of classical and logic-based Benders decomposition (BD) approaches to Assembly Line Balancing Problems (ALBP). The core decisions in assembly lines involve assigning a partially ordered set of tasks to (work)stations to maximise productivity or minimise resource usage in flow-oriented systems. ALBPs may contain stochastic data, multiple workers per station, or depend on the production sequence. Hence, they require further scheduling decisions - various stochastic and sequence-dependent problems have successfully applied this approach. This paper contributes to the current body of knowledge by providing a literature review. It introduces each article’s particular aspects and ideas and brings forth a summary and discussions on existing gaps. We offer insights into the BD method’s efficiency for combinatorial problems such as ALBPs from a managerial perspective, suggest potential directions for future research, and highlight the increasing number of contributions using this technique.
- 1 January 2026
- Published by FapUNIFESP (SciELO) in Pesquisa Operacional
- Vol. 46
Open AccessA SURVEY ON BENDERS DECOMPOSITION METHODS APPLIED TO ASSEMBLY LINE BALANCING PROBLEMS
This survey presents a comprehensive review on the application of classical and logic-based Benders decomposition (BD) approaches to Assembly Line Balancing Problems (ALBP). The core decisions in assembly lines involve assigning a partially ordered set of tasks to (work)stations to maximise productivity or minimise resource usage in flow-oriented systems. ALBPs may contain stochastic data, multiple workers per station, or depend on the production sequence. Hence, they require further scheduling decisions - various stochastic and sequence-dependent problems have successfully applied this approach. This paper contributes to the current body of knowledge by providing a literature review. It introduces each article’s particular aspects and ideas and brings forth a summary and discussions on existing gaps. We offer insights into the BD method’s efficiency for combinatorial problems such as ALBPs from a managerial perspective, suggest potential directions for future research, and highlight the increasing number of contributions using this technique.
- Open Access
- 2 May 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 182
A block-building constraint programming model for the container loading problem
- 2 May 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 182
Open AccessA block-building constraint programming model for the container loading problem
- Open Access
- 29 November 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 323 (1) , 20-33
Multiskilled workforce staffing and scheduling: A logic-based Benders’ decomposition approach
- 29 November 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 323 (1) , 20-33
Open AccessMultiskilled workforce staffing and scheduling: A logic-based Benders’ decomposition approach
- Open Access
- 30 August 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 173
Adaptive large neighborhood search for drayage routing problems involving longer combination vehicles
- 30 August 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 173
Open AccessAdaptive large neighborhood search for drayage routing problems involving longer combination vehicles
- Open Access
- 11 December 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 315 (2) , 484-498
Instance space analysis for 2D bin packing mathematical models
- 11 December 2023
- Published by Elsevier in European Journal of Operational Research
- Vol. 315 (2) , 484-498
Open AccessInstance space analysis for 2D bin packing mathematical models
- 2 November 2021
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 60 (21) , 6616-6636
Conserving workforce while temporarily rebalancing assembly lines under demand disruption
In stable circumstances, assembly lines have workers with different capabilities assigned to stations. They perform a set of specialised tasks multiple times daily. Under a situation of high demand disruption (e.g. the COVID-19 pandemic), the overproduction rate would lead inventory levels to soar. An approach to cope with these demand drops and ongoing workforce costs is to dismiss employees and rebalance the line. Nevertheless, this implies social and economic costs related to rehiring and training. Alternatively, agreements can be made to reduce workload with a proportional wage deduction. These decisions are particularly challenging in heterogeneous workforces. We propose a Mixed-Integer Linear Programming (MILP) model to address the Assembly Line Worker Assignment and Rebalancing Problem (ALWARP). Our model aims at preserving jobs while minimising labour costs. We consider scenarios with falling demands and impose regularity metrics on workload reductions. Computational tests on benchmark datasets show that our strategy can distribute social costs among workers, with only slightly higher cumulative labour hours, while avoiding inconveniences associated with future renovations. A real-world case study of a truck cabin assembly line is investigated: the model can easily incorporate many realistic features and decide which workers should have their workload reduced and at which rate.
- 2 November 2021
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 60 (21) , 6616-6636
Conserving workforce while temporarily rebalancing assembly lines under demand disruption
In stable circumstances, assembly lines have workers with different capabilities assigned to stations. They perform a set of specialised tasks multiple times daily. Under a situation of high demand disruption (e.g. the COVID-19 pandemic), the overproduction rate would lead inventory levels to soar. An approach to cope with these demand drops and ongoing workforce costs is to dismiss employees and rebalance the line. Nevertheless, this implies social and economic costs related to rehiring and training. Alternatively, agreements can be made to reduce workload with a proportional wage deduction. These decisions are particularly challenging in heterogeneous workforces. We propose a Mixed-Integer Linear Programming (MILP) model to address the Assembly Line Worker Assignment and Rebalancing Problem (ALWARP). Our model aims at preserving jobs while minimising labour costs. We consider scenarios with falling demands and impose regularity metrics on workload reductions. Computational tests on benchmark datasets show that our strategy can distribute social costs among workers, with only slightly higher cumulative labour hours, while avoiding inconveniences associated with future renovations. A real-world case study of a truck cabin assembly line is investigated: the model can easily incorporate many realistic features and decide which workers should have their workload reduced and at which rate.
- 3 May 2021
- Published by Taylor & Francis in Transportmetrica A: Transport Science
- Vol. 18 (3) , 1053-1083
Multi-period two-echelon location routing problem for disaster waste clean-up
Waste clean-up after a disaster is one of the most critical tasks in the response stage of disaster management. We develop a model to minimise the cost and duration of disaster waste clean-up considering using Temporary Disaster Waste Management Sites (TDWMSs), which can store and process waste before it is sent to the final disposal sites. The problem that arises can be seen as a Multi-Period Two-echelon Location Routing Problem (MP-2ELRP) in which the main decisions are the location of the TDWMSs and the routing of vehicles in both echelons. In this paper, we propose both a mixed-integer program and a Genetic Algorithm (GA) to model and solve the problem. Computational tests indicate: (i) the performance of proposed GA is robust; (ii) the use of TDWMSs can reduce both total waste clean-up cost and duration; and (iii) the capacities of TDWMSs have a significant impact on the total waste clean-up time and duration.
- 3 May 2021
- Published by Taylor & Francis in Transportmetrica A: Transport Science
- Vol. 18 (3) , 1053-1083
Multi-period two-echelon location routing problem for disaster waste clean-up
Waste clean-up after a disaster is one of the most critical tasks in the response stage of disaster management. We develop a model to minimise the cost and duration of disaster waste clean-up considering using Temporary Disaster Waste Management Sites (TDWMSs), which can store and process waste before it is sent to the final disposal sites. The problem that arises can be seen as a Multi-Period Two-echelon Location Routing Problem (MP-2ELRP) in which the main decisions are the location of the TDWMSs and the routing of vehicles in both echelons. In this paper, we propose both a mixed-integer program and a Genetic Algorithm (GA) to model and solve the problem. Computational tests indicate: (i) the performance of proposed GA is robust; (ii) the use of TDWMSs can reduce both total waste clean-up cost and duration; and (iii) the capacities of TDWMSs have a significant impact on the total waste clean-up time and duration.
- 1 January 2021
- Published by Elsevier in Waste Management
- Vol. 119, 1-10
Optimisation of waste clean-up after large-scale disasters
- 1 January 2021
- Published by Elsevier in Waste Management
- Vol. 119, 1-10
Optimisation of waste clean-up after large-scale disasters
- 22 July 2020
- Published by Springer Nature in Journal of Intelligent Manufacturing
- Vol. 32 (8) , 2121-2124
A note to: A multiple-rule based constructive randomized search algorithm for solving assembly line worker assignment and balancing problem
- 22 July 2020
- Published by Springer Nature in Journal of Intelligent Manufacturing
- Vol. 32 (8) , 2121-2124
A note to: A multiple-rule based constructive randomized search algorithm for solving assembly line worker assignment and balancing problem
- 1 February 2020
- Published by Elsevier in European Journal of Operational Research
- Vol. 280 (3) , 1064-1081
Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems
- 1 February 2020
- Published by Elsevier in European Journal of Operational Research
- Vol. 280 (3) , 1064-1081
Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems