2000
DOI: 10.1016/s0377-2217(99)00413-0
|View full text |Cite
|
Sign up to set email alerts
|

A comparative evaluation of modeling approaches to the labor shift scheduling problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
40
0
2

Year Published

2004
2004
2019
2019

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 77 publications
(42 citation statements)
references
References 15 publications
0
40
0
2
Order By: Relevance
“…For large call centers with a single queue of call arrivals and a homogeneous pool of agents, each with several possible shift and break combinations and associated restrictions, the size of the mathematical program grows very rapidly. This issue is addressed by several researchers, most notably Aykin (1996Aykin ( , 2000, who models flexible break constraints for each shift and tests the proposed methodology with several large test problems.…”
Section: Personnel Planning: Resource Acquisitionmentioning
confidence: 99%
“…For large call centers with a single queue of call arrivals and a homogeneous pool of agents, each with several possible shift and break combinations and associated restrictions, the size of the mathematical program grows very rapidly. This issue is addressed by several researchers, most notably Aykin (1996Aykin ( , 2000, who models flexible break constraints for each shift and tests the proposed methodology with several large test problems.…”
Section: Personnel Planning: Resource Acquisitionmentioning
confidence: 99%
“…Breaks are only modelled implicitly and the resulting formulation therefore has a much smaller size than the classical set covering model for the same problem. A comparison of some of the different modelling approaches can be found in Aykin (2000). Computational tests show that the model based on Aykin (1996) is superior to the approach suggested in Bechtold and Jacobs (1990).…”
Section: Related Literaturementioning
confidence: 99%
“…Integer programming formulations for shift scheduling include [3], [29], and [1]. Aykin [1] introduced an implicit integer programming model for the shift scheduling problem in 1996 and later he compared an extended version [2] of his previous model with a similarly extended formulation introduced by Bechtold and Jacobs [3]. He observed that Bechtold and Jacobs' approach needed fewer variables whereas his approach needed fewer constraints.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Shift design and break assignment problems are known also under other names, for example as shift design [19,10], shift scheduling [3,2,25,28], and break scheduling [4,5,20,31]. Such problems arise at airports, call centers, and in the service industry in general, and have been extensively investigated in Operations Research and Artificial Intelligence.…”
Section: Introductionmentioning
confidence: 99%