| Full text | |
| Author(s): |
Bolsi, Beatrice
;
de Lima, Vinicius Loti
;
de Queiroz, Thiago Alves
;
Iori, Manuel
Total Authors: 4
|
| Document type: | Journal article |
| Source: | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH; v. N/A, p. 16-pg., 2022-11-29. |
| Abstract | |
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. (AU) | |
| FAPESP's process: | 17/11831-1 - Algorithms and models for cutting and packing problems |
| Grantee: | Vinícius Loti de Lima |
| Support Opportunities: | Scholarships in Brazil - Doctorate (Direct) |