Heuristics for large scale labour scheduling problems in retail sector

S. Zolfaghari, A. El-Bouri, B. Namiranian, V. Quan

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Labour scheduling in an organization is described as the process of producing optimized timetables for employees. During this process, the work regulations associated with the relevant workplace agreements must be observed and individual work preferences should be accommodated. The problem is further complicated by having many non-standard shift patterns with varying start and end times, and shifts of differing lengths. Generating all possible shift combinations results in a very large problem size and, consequently, the computational time needed to find an optimal schedule may become too excessive to be of any practical value. This paper proposes eight heuristics for generating candidate shifts. Our extensive analysis identified several patterns in intraday labour demand, ranging from a simple flat demand to a mixed fluctuating demand. Accordingly, a number of heuristics were developed for these different demand patterns, and an integer programming model was constructed to test their performance. Our computational analysis on small-scale test problems showed promising results by some of the heuristics in improving computational efficiency, without compromising the solution quality. The results indicated that a combination of some of these heuristics would be useful for the general case in which demand does not necessarily follow any specific pattern.

Original languageEnglish
Pages (from-to)111-122
Number of pages12
JournalINFOR
Volume45
Issue number3
DOIs
Publication statusPublished - Aug 2007

Fingerprint

Scheduling
Personnel
Integer programming
Computational efficiency

Keywords

  • Heuristics
  • Integer programming
  • Retail labour scheduling
  • Shift generation

ASJC Scopus subject areas

  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this

Heuristics for large scale labour scheduling problems in retail sector. / Zolfaghari, S.; El-Bouri, A.; Namiranian, B.; Quan, V.

In: INFOR, Vol. 45, No. 3, 08.2007, p. 111-122.

Research output: Contribution to journalArticle

Zolfaghari, S. ; El-Bouri, A. ; Namiranian, B. ; Quan, V. / Heuristics for large scale labour scheduling problems in retail sector. In: INFOR. 2007 ; Vol. 45, No. 3. pp. 111-122.
@article{47630fd9982c4454a345968d7bb81515,
title = "Heuristics for large scale labour scheduling problems in retail sector",
abstract = "Labour scheduling in an organization is described as the process of producing optimized timetables for employees. During this process, the work regulations associated with the relevant workplace agreements must be observed and individual work preferences should be accommodated. The problem is further complicated by having many non-standard shift patterns with varying start and end times, and shifts of differing lengths. Generating all possible shift combinations results in a very large problem size and, consequently, the computational time needed to find an optimal schedule may become too excessive to be of any practical value. This paper proposes eight heuristics for generating candidate shifts. Our extensive analysis identified several patterns in intraday labour demand, ranging from a simple flat demand to a mixed fluctuating demand. Accordingly, a number of heuristics were developed for these different demand patterns, and an integer programming model was constructed to test their performance. Our computational analysis on small-scale test problems showed promising results by some of the heuristics in improving computational efficiency, without compromising the solution quality. The results indicated that a combination of some of these heuristics would be useful for the general case in which demand does not necessarily follow any specific pattern.",
keywords = "Heuristics, Integer programming, Retail labour scheduling, Shift generation",
author = "S. Zolfaghari and A. El-Bouri and B. Namiranian and V. Quan",
year = "2007",
month = "8",
doi = "10.3138/infor.45.3.001",
language = "English",
volume = "45",
pages = "111--122",
journal = "INFOR: Information Systems and Operational Research",
issn = "0315-5986",
publisher = "University of Toronto Press",
number = "3",

}

TY - JOUR

T1 - Heuristics for large scale labour scheduling problems in retail sector

AU - Zolfaghari, S.

AU - El-Bouri, A.

AU - Namiranian, B.

AU - Quan, V.

PY - 2007/8

Y1 - 2007/8

N2 - Labour scheduling in an organization is described as the process of producing optimized timetables for employees. During this process, the work regulations associated with the relevant workplace agreements must be observed and individual work preferences should be accommodated. The problem is further complicated by having many non-standard shift patterns with varying start and end times, and shifts of differing lengths. Generating all possible shift combinations results in a very large problem size and, consequently, the computational time needed to find an optimal schedule may become too excessive to be of any practical value. This paper proposes eight heuristics for generating candidate shifts. Our extensive analysis identified several patterns in intraday labour demand, ranging from a simple flat demand to a mixed fluctuating demand. Accordingly, a number of heuristics were developed for these different demand patterns, and an integer programming model was constructed to test their performance. Our computational analysis on small-scale test problems showed promising results by some of the heuristics in improving computational efficiency, without compromising the solution quality. The results indicated that a combination of some of these heuristics would be useful for the general case in which demand does not necessarily follow any specific pattern.

AB - Labour scheduling in an organization is described as the process of producing optimized timetables for employees. During this process, the work regulations associated with the relevant workplace agreements must be observed and individual work preferences should be accommodated. The problem is further complicated by having many non-standard shift patterns with varying start and end times, and shifts of differing lengths. Generating all possible shift combinations results in a very large problem size and, consequently, the computational time needed to find an optimal schedule may become too excessive to be of any practical value. This paper proposes eight heuristics for generating candidate shifts. Our extensive analysis identified several patterns in intraday labour demand, ranging from a simple flat demand to a mixed fluctuating demand. Accordingly, a number of heuristics were developed for these different demand patterns, and an integer programming model was constructed to test their performance. Our computational analysis on small-scale test problems showed promising results by some of the heuristics in improving computational efficiency, without compromising the solution quality. The results indicated that a combination of some of these heuristics would be useful for the general case in which demand does not necessarily follow any specific pattern.

KW - Heuristics

KW - Integer programming

KW - Retail labour scheduling

KW - Shift generation

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

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

U2 - 10.3138/infor.45.3.001

DO - 10.3138/infor.45.3.001

M3 - Article

AN - SCOPUS:45749095348

VL - 45

SP - 111

EP - 122

JO - INFOR: Information Systems and Operational Research

JF - INFOR: Information Systems and Operational Research

SN - 0315-5986

IS - 3

ER -