Skilled workforce scheduling in Service Centres

被引:90
作者
Valls, Vicente [2 ]
Perez, Angeles [1 ]
Quintanilla, Sacramento [1 ]
机构
[1] Univ Valencia, Fac Econ, Dpto Matemat Econ & Empresa, Valencia 46022, Spain
[2] Univ Valencia, Fac Matemat, Dpto Estadist & Invest Operat, Valencia 46100, Spain
关键词
Project scheduling; Skilled workforce; Service Centres; Maximal and minimal time lags; Percentage time lags; PROJECT; METAHEURISTICS; ALGORITHM;
D O I
10.1016/j.ejor.2007.11.008
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:791 / 804
页数:14
相关论文
共 26 条
[1]  
Bagchi T., 1999, MULTIOBJECTIVE SCHED
[2]  
Ballestín F, 2006, INT SER OPER RES MAN, V92, P79, DOI 10.1007/978-0-387-33768-5_4
[3]  
BELLENGUEZ O, 2004, 9 INT WORKSH PROJ MA
[4]  
Blazewicz J., 2001, SCHEDULING COMPUTER
[5]   A genetic algorithm for scheduling staff of mixed skills under multi-criteria [J].
Cai, X ;
Li, KN .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 125 (02) :359-369
[6]   The multi-mode resource-constrained project scheduling problem with generalized precedence relations [J].
De Reyck, B ;
Herroelen, W .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 119 (02) :538-556
[7]   Metaheuristics in combinatorial optimization [J].
Gendreau, M ;
Potvin, JY .
ANNALS OF OPERATIONS RESEARCH, 2005, 140 (01) :189-213
[8]  
Golberg DE., 1989, Choice Reviews Online, V1989, P36, DOI DOI 10.5860/CHOICE.27-0936
[9]   A survey of the state-of-the-art of common due date assignment and scheduling research [J].
Gordon, V ;
Proth, JM ;
Chu, CB .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 139 (01) :1-25
[10]   Project scheduling with multiple modes: A genetic algorithm [J].
Hartmann, S .
ANNALS OF OPERATIONS RESEARCH, 2001, 102 (1-4) :111-135