The Workload Allocation Problem consists of assigning a sequence of |S| operations to workers. The order of these operations is fixed. Each operation consists of a batch of B units, hence a total of |J| jobs have to be performed. Each worker is assigned to an ordered subset of consecutive jobs. Workers have different skills, and therefore jobs take a variable time to process, depending on the assigned worker. The study of this problem is rooted in the operations of Calzedonia. In this paper, we briefly introduce the application before presenting algorithms for solving the problem exactly and heuristically. Our computational results compare the performance of a stand-alone mathematical formulation solved by CPLEX, a sequential exact algorithm, and a metaheuristic, with a simple heuristic implemented in the company.

Algorithms for the Calzedonia workload allocation problem / Battarra, Maria; Fraboni, Federico; Thomasson, Oliver; Erdoğan, Güneş; Laporte, Gilbert; Formentini, Marco. - In: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY. - ISSN 0160-5682. - 2021, 72:9(2021), pp. 2004-2017. [10.1080/01605682.2020.1755897]

Algorithms for the Calzedonia workload allocation problem

Formentini, Marco
2021-01-01

Abstract

The Workload Allocation Problem consists of assigning a sequence of |S| operations to workers. The order of these operations is fixed. Each operation consists of a batch of B units, hence a total of |J| jobs have to be performed. Each worker is assigned to an ordered subset of consecutive jobs. Workers have different skills, and therefore jobs take a variable time to process, depending on the assigned worker. The study of this problem is rooted in the operations of Calzedonia. In this paper, we briefly introduce the application before presenting algorithms for solving the problem exactly and heuristically. Our computational results compare the performance of a stand-alone mathematical formulation solved by CPLEX, a sequential exact algorithm, and a metaheuristic, with a simple heuristic implemented in the company.
2021
9
Battarra, Maria; Fraboni, Federico; Thomasson, Oliver; Erdoğan, Güneş; Laporte, Gilbert; Formentini, Marco
Algorithms for the Calzedonia workload allocation problem / Battarra, Maria; Fraboni, Federico; Thomasson, Oliver; Erdoğan, Güneş; Laporte, Gilbert; Formentini, Marco. - In: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY. - ISSN 0160-5682. - 2021, 72:9(2021), pp. 2004-2017. [10.1080/01605682.2020.1755897]
File in questo prodotto:
File Dimensione Formato  
Algorithms for the Calzedonia workload allocation problem.pdf

Solo gestori archivio

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 1.75 MB
Formato Adobe PDF
1.75 MB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/286422
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 4
social impact