The degree of dynamism for workforce scheduling problem with stochastic task duration
Pages 2005 - 2010
Abstract
Real time dispatching strategies in a dynamic environment is a growing area of interest. Most of current work focuses mainly on two dynamic aspects of the problem, namely dynamic arrival of jobs and dynamic travel time. The degree of dynamism, for example is defined with respect to dynamic arrival of jobs. This paper focuses on another dynamic aspect, namely the duration of tasks. This aspect becomes important when tasks durations are relatively long and, in addition, one has to respect time windows. We characterize the degree of dynamism of such problems and show that it relates with the expected cost of a static scheduler which is reapplied in light of dynamic events. Furthermore, preliminary experiments indicate that the performance of the scheduler can be improved when the expected duration of a task is overestimated.
References
[1]
S. Baker. Applying simulated annealing to the workforce management problem. Technical report, British Telecom Laboratories, 1993.
[2]
R.W. Bent and P. Van Hentenryck. Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Operations Research, 52(6):p977--987, n.d.n.d.n.d.
[3]
J. Branke, M. Middendorf, G. Noeth, and M. Dessouky. Waiting strategies for dynamic vehicle routing. Transportation Science, 39(3):298--312, 2005.
[4]
L.A.L.C.L.D. Dorne. R, Voudouris. C. ischedule -- an optimisation tool-kit based on heuristic search to solve bt scheduling problems. BT Technology Journal, 21(4):50--58, 2003.
[5]
A.T. Ernst, H. Jiang, M. Krishnamoorthy, and D. Sier. Staff scheduling and rostering: A review of applications, methods and models. European Journal of Operational Research, 153(1):3--27, February 2004.
[6]
M. Gendreau, F. Guertin, J.-Y. Potvin, and E. Taillard. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science, 33(4):381--390, 1999.
[7]
G.L.R.M. Gianpaolo Ghiani, Francesca Guerriero. Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. European Journal of Operational Research, 151:1--11, 2003.
[8]
F. Glover and G. Kochenberger. Handbook of Metaheuristics (International Series in Operations Research & Management Science). Springer, 2003.
[9]
S. Ichoua, M. Gendreau, and J.-Y. Potvin. Exploiting knowledge about future demands for real-time vehicle dispatching. Transportation Science, 40(2):211--225, 2006.
[10]
O.B.M. Karsten Lund and J.M. Rygaard. Vehicle routing problems with varying degrees of dynamism. Technical report, IMM Department of Mathematical Modelling, The Technical University of Denmark, 1996.
[11]
R. Kolisch and S. Hartmann. Experimental investigation of heuristics for resource-constrained project scheduling: An update. European Journal of Operational Research, 174(1):23--37, October 2006.
[12]
A. Larsen, O.B.G. Madsen, and M.M. Solomon. Partially dynamic vehicle routing--models and algorithms. Journal of the Operational Research Society, 53(6):637--646, 2002.
[13]
A. Larsen, O.B.G. Madsen, and M.M. Solomon. The a priori dynamic traveling salesman problem with time windows. Transportation Science, 38(4):459--472, 2004.
[14]
D. Lesaint, C. Voudouris, and N. Azarmi. Dynamic workforce scheduling for british telecommunications plc. Interfaces, 30(1):45--56, 2000.
[15]
J. Lever, M. Wallace, and B. Richards. Constraint logic programming for scheduling and planning. British Telecom Technology Journal, 13(No.1):73--80, 1995.
[16]
C. Muller, E. Magill, and D. Smith. Distributed genetic algorithms for resource allocation. Technical report, Strathclyde University, 1993.
[17]
W.B. Powell, M.T. Towns, and A. Marar. On the value of optimal myopic solutions for dynamic routing and scheduling problems in the presence of user noncompliance. Transportation Science, 34(1):67--85, 2000.
[18]
M.M. Solomon. Algorithms for the vehicle routing and scheduling problems with time window constraints. European Journal for Operational Research, 35(2):245--265, 1987.
[19]
E. Tsang and C. Voudouris. Fast local search and guided local search and their application to british telecom's workforce scheduling problem. Operations Research Letters, 20(3):119--127, 1997.
[20]
E. Tsang and C. Voudouris. Fast local search and guided local search and their application to british telecom's workforce scheduling problem. Operations Research Letters, Elsevier Science Publishers, Amsterdam, 20(3):119--127, 1997.
[21]
C. Voudouris and E. Tsang. Guided local search. In F. Glover, editor, Handbook of metaheuristics, pages 185--218. Kluwer, 2003.
[22]
R. Yang. Solving a workforce management problem with constraint programming. In The 2nd International Conference on the Practical Application of Constraint Technology, page 373--387, 1996.
Index Terms
- The degree of dynamism for workforce scheduling problem with stochastic task duration
Recommendations
A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates
Flexible job shop scheduling problem (FJSSP) is generalization of job shop scheduling problem (JSSP), in which an operation may be processed on more than one machine each of which has the same function. Most previous researches on FJSSP assumed that all ...
Dynamic Partitioning Based Scheduling of Real-Time Tasks in Multicore Processors
ISORC '15: Proceedings of the 2015 IEEE 18th International Symposium on Real-Time Distributed ComputingExisting real-time multicore schedulers use either global or partitioned scheduling technique to schedule real-time tasks. Partitioned scheduling is a static approach in which, a task is mapped to a per-processor ready queue prior to scheduling it and ...
Workflow-based dynamic scheduling of job shop operations
In a job shop such as a mould-making shop, dispatching decisions as to which job should be loaded on a machine when it becomes free are termed dynamic scheduling. A practical approach to dynamic job-shop scheduling is the use of discrete event ...
Comments
Information & Contributors
Information
Published In
Copyright © 2009 Copyright is held by the author/owner(s).
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 July 2009
Check for updates
Author Tags
Qualifiers
- Short-paper
Conference
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 197Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 25 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in