Survey, Categorization, and Comparison of Recent Tour Scheduling Literature

The employee tour scheduling problem involves the determination of both work hours of the day and workdays of the week for each employee. This problem has proven difficult to solve optimally due to its large size and pure integer nature. During the last decade, numerous approaches for modeling and s...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research 2004-03, Vol.127 (1-4), p.145-175
Main Author: Alfares, Hesham K.
Format: Article
Language:English
Subjects:
Customer services
Employees
Human resource management
Integer programming
Labor costs
Labor economics
Mathematical models
Mathematical programming
Operations research
Schedules
Scheduling
Studies
Workforce
Workforce planning
Working hours
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The employee tour scheduling problem involves the determination of both work hours of the day and workdays of the week for each employee. This problem has proven difficult to solve optimally due to its large size and pure integer nature. During the last decade, numerous approaches for modeling and solving this problem have been proposed. In this paper, employee tour scheduling literature published since 1990 is reviewed and classified. Solution techniques are classified into ten categories: (1) manual solution, (2) integer programming, (3) implicit modeling, (4) decomposition, (5) goal programming, (6) working set generation, (7) LP-based solution, (8) construction and improvement, (9) metaheuristics, and (10) other methods. The objective is to identify broad classifications, present typical mathematical models, compare the different methods, and identify future research directions. [PUBLICATION ABSTRACT}
ISSN:0254-5330
1572-9338
DOI:10.1023/B:ANOR.0000019088.98647.e2