Beatrice Bolsi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Beatrice Bolsi has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Manuel Iori
DISMI University of Modena and Reggio Emilia Reggio Emilia Italy
6 shared publications - Thiago Alves de Queiroz
Federal University of Catalão
5 shared publications - Vinícius Loti de Lima
Institute of Computing, University of Campinas, Campinas, Brazil
3 shared publications - Arthur Kramer
Federal University of Rio Grande do Norte
2 shared publications - Arthur Kramer
Federal University of Rio Grande do Norte
1 shared publication - Nilson Felipe Matos Mendes
University of Modena and Reggio Emilia
1 shared publication
Latest Publications
- 29 May 2023
- Published by Springer Nature
- p. 97-111
Assigning Multi-skill Configurations to Multiple Servers with a Reduced VNS
- 29 May 2023
- Published by Springer Nature
- p. 97-111
Assigning Multi-skill Configurations to Multiple Servers with a Reduced VNS
- 25 November 2022
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 61 (20) , 7048-7063
Heuristic algorithms for integrated workforce allocation and scheduling of perishable products
We study a problem from a real-world application, in which a daily set of orders must be processed following two stages, consisting of preparing perishable products on benches and allocating them to conveyors to be packed in disposable trays. Daily decisions must be made regarding the number and start time of working shifts, the number of workers and their allocation to machines, and the scheduling of orders in a two-stage flexible flow shop environment. The flow shop environment of the studied problem is common in many industries of perishable products, making the problem very general. The problem involves a number of operational constraints, and three objective functions that are minimised in a lexicographic way. To solve the problem, we implement a constructive heuristic and embed it within three metaheuristics: a Random multi-start algorithm (MR), a Biased random key genetic algorithm (BRKGA), and a Variable neighbourhood search (VNS) based one. We perform computational experiments over a set of realistic instances, and present a lower bound obtained from a constraint programming model for the scheduling counterpart. The results of the experiments show that the BRKGA is the most effective in practice for the integrated problem of workforce allocation and scheduling.
- 25 November 2022
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 61 (20) , 7048-7063
Heuristic algorithms for integrated workforce allocation and scheduling of perishable products
We study a problem from a real-world application, in which a daily set of orders must be processed following two stages, consisting of preparing perishable products on benches and allocating them to conveyors to be packed in disposable trays. Daily decisions must be made regarding the number and start time of working shifts, the number of workers and their allocation to machines, and the scheduling of orders in a two-stage flexible flow shop environment. The flow shop environment of the studied problem is common in many industries of perishable products, making the problem very general. The problem involves a number of operational constraints, and three objective functions that are minimised in a lexicographic way. To solve the problem, we implement a constructive heuristic and embed it within three metaheuristics: a Random multi-start algorithm (MR), a Biased random key genetic algorithm (BRKGA), and a Variable neighbourhood search (VNS) based one. We perform computational experiments over a set of realistic instances, and present a lower bound obtained from a constraint programming model for the scheduling counterpart. The results of the experiments show that the BRKGA is the most effective in practice for the integrated problem of workforce allocation and scheduling.
- 2 March 2022
- Published by Springer Nature
- p. 247-258
Optimizing a Dynamic Outpatient Facility System with Multiple Servers
- 2 March 2022
- Published by Springer Nature
- p. 247-258
Optimizing a Dynamic Outpatient Facility System with Multiple Servers
- 31 August 2021
- Published by Springer Nature
- p. 594-602
Integrated Workforce Scheduling and Flexible Flow Shop Problem in the Meat Industry
- 31 August 2021
- Published by Springer Nature
- p. 594-602
Integrated Workforce Scheduling and Flexible Flow Shop Problem in the Meat Industry