Scheduling part-time and mixed-skilled workers to maximize employee satisfaction

被引:33
作者
Akbari, Mohammad [1 ]
Zandieh, M. [1 ]
Dorri, Behrouz [1 ]
机构
[1] Shahid Beheshti Univ, Management & Accounting Fac, Dept Ind Management, GC, Tehran, Iran
关键词
Part-time workforce scheduling; Employee satisfaction; Simulated annealing; Variable neighborhood search; WORKFORCE; SEARCH; MODEL; HEALTH; STAFF; PRODUCTIVITY; ALGORITHM; PERSONNEL;
D O I
10.1007/s00170-012-4032-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, part-time and mixed-skilled workers scheduling problem have been modeled in which workers' productivity is variable during a day. This paper considers fatigue as a significant human aspect in staff scheduling problem. Considering the effect of fatigue in staff scheduling problem is motivated by human operators who experience fatigue in carrying out tasks in various shifts. The model tries to maximize workers' satisfaction while regarding workers' availability, productivity, priority preference, seniority level, and number of workers required. To solve such an NP-hard problem, simulated annealing (SA) and variable neighborhood search (VNS) have been introduced. In order to improve the efficiency of proposed algorithms, "time of switching NSSs" is applied as a control parameter. To evaluate validity of the algorithms, efficient lower bound has been provided using a heuristic method. Comparison experiments show that our algorithms are capable of finding near-global optimum solution. Competitiveness of proposed algorithms has been evaluated through solutions of mathematical integer programming. The comparison results indicate that performance of VNS is better than performance of SA in terms of solution quality and computational time.
引用
收藏
页码:1017 / 1027
页数:11
相关论文
共 51 条
[1]  
Aarts E, 2005, SEARCH METHODOLOGIES, P204
[2]  
Aarts EHL, 1989, SIMULATED ANNEALING, P284
[3]   A MULTIPLE OBJECTIVE NURSE SCHEDULING MODEL [J].
ARTHUR, JL ;
RAVINDRAN, A .
AIIE TRANSACTIONS, 1981, 13 (01) :55-60
[4]   Preference scheduling for nurses using column generation [J].
Bard, JF ;
Purnomo, HW .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 164 (02) :510-534
[5]   Staff scheduling at the United States Postal Service [J].
Bard, JF ;
Binici, C ;
deSilva, AH .
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (05) :745-771
[6]   Cyclic preference scheduling of nurses using a Lagrangian-based heuristic [J].
Bard, Jonathan F. ;
Purnomo, Hadi W. .
JOURNAL OF SCHEDULING, 2007, 10 (01) :5-23
[7]   A GUARANTEED-ACCURACY ROUND-OFF ALGORITHM FOR CYCLIC SCHEDULING AND SET COVERING [J].
BARTHOLDI, JJ .
OPERATIONS RESEARCH, 1981, 29 (03) :501-510
[8]   A multi-objective approach to nurse scheduling with both hard and soft constraints [J].
Berrada, I ;
Ferland, JA ;
Michelon, P .
SOCIO-ECONOMIC PLANNING SCIENCES, 1996, 30 (03) :183-193
[9]   A SIMULATED ANNEALING APPROACH TO THE SOLUTION OF FLEXIBLE LABOR SCHEDULING PROBLEMS [J].
BRUSCO, MJ ;
JACOBS, LW .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1993, 44 (12) :1191-1200
[10]   Staffing a multiskilled workforce with varying levels of productivity: An analysis of cross-training policies [J].
Brusco, MJ ;
Johns, TR .
DECISION SCIENCES, 1998, 29 (02) :499-515