Algorithms for the Calzedonia workload allocation problem

Maria Battarra; Federico Fraboni; Oliver Thomasson; Güneş Erdoğan; Gilbert Laporte; Formentini Marco

doi:10.1080/01605682.2020.1755897

Algorithms for the Calzedonia workload allocation problem

Maria Battarra, Federico Fraboni, Oliver Thomasson, Güneş Erdoğan, Gilbert Laporte, Formentini Marco

Research output: Contribution to journal › Article › peer-review

4 Citations (SciVal)

36 Downloads (Pure)

Abstract

The Workload Allocation Problem consists of assigning a sequence of (Formula presented.) operations to workers. The order of these operations is fixed. Each operation consists of a batch of B units, hence a total of (Formula presented.) 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.

Original language	English
Pages (from-to)	2004-2017
Number of pages	14
Journal	Journal of the Operational Research Society
Volume	72
Issue number	9
Early online date	23 Jun 2020
DOIs	https://doi.org/10.1080/01605682.2020.1755897
Publication status	Published - 31 Dec 2021

Keywords

Combinatorial optimisation
production
scheduling

ASJC Scopus subject areas

Modelling and Simulation
Strategy and Management
Statistics, Probability and Uncertainty
Management Science and Operations Research

Access to Document

10.1080/01605682.2020.1755897

Calzedonia_JORS_revision2
This is an Accepted Manuscript of an article published by Taylor & Francis in Journal of the operational research society on 23/06/2020 available online: https://www.tandfonline.com/doi/full/10.1080/01605682.2020.1755897
Accepted author manuscript, 590 KB

Cite this

@article{5a9942a589f64f5c8d0948db7563d145,

title = "Algorithms for the Calzedonia workload allocation problem",

abstract = "The Workload Allocation Problem consists of assigning a sequence of (Formula presented.) operations to workers. The order of these operations is fixed. Each operation consists of a batch of B units, hence a total of (Formula presented.) 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.",

keywords = "Combinatorial optimisation, production, scheduling",

author = "Maria Battarra and Federico Fraboni and Oliver Thomasson and G{\"u}ne{\c s} Erdoğan and Gilbert Laporte and Formentini Marco",

note = "Funding Information: This work was partially supported by the Canadian Natural Sciences and Engineering Research Council under grant 2015-06189. This support is gratefully acknowledged. This research made use of the Balena High Performance Computing (HPC) Service at the University of Bath. Thanks are due to the referees for their valuable comments. Funding Information: This work was partially supported by the Canadian Natural Sciences and Engineering Research Council under grant 2015-06189. This support is gratefully acknowledged. This research made use of the Balena High Performance Computing (HPC) Service at the University of Bath. Thanks are due to the referees for their valuable comments. Publisher Copyright: {\textcopyright} Operational Research Society 2020.",

year = "2021",

month = dec,

day = "31",

doi = "10.1080/01605682.2020.1755897",

language = "English",

volume = "72",

pages = "2004--2017",

journal = "Journal of the Operational Research Society",

issn = "0160-5682",

publisher = "Palgrave Macmillan",

number = "9",

}

TY - JOUR

T1 - Algorithms for the Calzedonia workload allocation problem

AU - Battarra, Maria

AU - Fraboni, Federico

AU - Thomasson, Oliver

AU - Erdoğan, Güneş

AU - Laporte, Gilbert

AU - Marco, Formentini

N1 - Funding Information: This work was partially supported by the Canadian Natural Sciences and Engineering Research Council under grant 2015-06189. This support is gratefully acknowledged. This research made use of the Balena High Performance Computing (HPC) Service at the University of Bath. Thanks are due to the referees for their valuable comments. Funding Information: This work was partially supported by the Canadian Natural Sciences and Engineering Research Council under grant 2015-06189. This support is gratefully acknowledged. This research made use of the Balena High Performance Computing (HPC) Service at the University of Bath. Thanks are due to the referees for their valuable comments. Publisher Copyright: © Operational Research Society 2020.

PY - 2021/12/31

Y1 - 2021/12/31

N2 - The Workload Allocation Problem consists of assigning a sequence of (Formula presented.) operations to workers. The order of these operations is fixed. Each operation consists of a batch of B units, hence a total of (Formula presented.) 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.

AB - The Workload Allocation Problem consists of assigning a sequence of (Formula presented.) operations to workers. The order of these operations is fixed. Each operation consists of a batch of B units, hence a total of (Formula presented.) 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.

KW - Combinatorial optimisation

KW - production

KW - scheduling

UR - http://www.scopus.com/inward/record.url?scp=85087344404&partnerID=8YFLogxK

U2 - 10.1080/01605682.2020.1755897

DO - 10.1080/01605682.2020.1755897

M3 - Article

SN - 0160-5682

VL - 72

SP - 2004

EP - 2017

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

IS - 9

ER -

Algorithms for the Calzedonia workload allocation problem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Maria Battarra

Gunes Erdogan

Cite this

Algorithms for the Calzedonia workload allocation problem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Profiles

Maria Battarra

Gunes Erdogan

Cite this