Heuristic algorithms for integrated workforce allocation and scheduling of perishable products
- 25 November 2022
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 61 (20) , 7048-7063
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.Keywords
Funding Information
- São Paulo Research Foundation (2017/11831-1)
- National Council for Scientific and Technological Development (405369/2021-2, 311185/2020-7)
- State of Goiás Research Foundation
This publication has 20 references indexed in Scilit:
- The irace package: Iterated racing for automatic algorithm configurationOperations Research Perspectives, 2016
- Scheduling of multi-component products in a two-stage flexible flow shopApplied Soft Computing, 2015
- Scheduling rules for two-stage flexible flow shop scheduling problem subject to tail group constraintInternational Journal of Production Economics, 2013
- Heuristics for scheduling a two-stage hybrid flow shop with parallel batching machines: application at a hospital sterilisation plantInternational Journal of Production Research, 2013
- The Hybrid Flow Shop2012
- The hybrid flow shop scheduling problemEuropean Journal of Operational Research, 2010
- A Comparison between Basic Cyclic Scheduling and Variable Cyclic Scheduling in a Two‐stage Hybrid Flow ShopDecision Sciences, 2000
- Hybrid flow shop scheduling: A surveyComputers & Industrial Engineering, 1999
- Variable neighborhood searchComputers & Operations Research, 1997
- The Two — Stage Hybrid — Flowshop Scheduling Problem with Sequence — Dependent Setup Times1993