Skilled workforce scheduling in Service Centres
The Skilled Workforce Project Scheduling Problem (SWPSP) is a complex problem of task scheduling and resource assignment that comes up in the daily management of many company Service Centres (SC). The SWPSP considers many real characteristics faced daily by the SC: client-company service quality agreements that establish maximum dates for the beginning and the end of tasks with penalties for delays, criticality levels indicating the client-priority in processing each task, generalized precedence relationships that can produce cycle structures, time period and percentage time lags and variable task durations depending on the worker executing the task. Furthermore, the SC workforce is made up of specialist workers characterised by efficiency levels showing their efficiency and speed executing the several types of tasks. Each worker has his or her own timetable. The main objective of the SWPSP is to quickly obtain a feasible plan of action satisfying maximum established dates and timetable worker constraints. Secondary objectives deal with the urgency levels imposed by the criticality task levels, to obtain well-balanced worker workloads and an efficient assignment of specialists to tasks. In this paper an efficient and quick hybrid genetic algorithm that combines local searches with genetic population management techniques is presented to manage the model.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- De Reyck, Bert & Herroelen, Willy, 1999. "The multi-mode resource-constrained project scheduling problem with generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 119(2), pages 538-556, December.
- Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
- Cai, X. & Li, K. N., 2000. "A genetic algorithm for scheduling staff of mixed skills under multi-criteria," European Journal of Operational Research, Elsevier, vol. 125(2), pages 359-369, September.
- M. Vanhoucke, 2002.
"Optimal Due Date Assignment In Project Scheduling,"
Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium
02/159, Ghent University, Faculty of Economics and Business Administration.
- Mario Vanhoucke, 2002. "Optimal due date assignment in project scheduling," Vlerick Leuven Gent Management School Working Paper Series 2002-19, Vlerick Leuven Gent Management School.
- Heilmann, Roland, 2003. "A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags," European Journal of Operational Research, Elsevier, vol. 144(2), pages 348-365, January.
- Viana, Ana & Pinho de Sousa, Jorge, 2000. "Using metaheuristics in multiobjective resource constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 120(2), pages 359-374, January.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:193:y:2009:i:3:p:791-804. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.