%0 Generic
%A Moreno Camacho, Carlos Alberto
%A Montoya Torres, Jairo Rafael
%A Vélez Gallego, Mario C.
%8 2018
%@ 0305-215X
%U http://hdl.handle.net/10818/36936
%X Only a few studies in the available scientific literature address the problem of having a group of workers that do not share identical levels of productivity during the planning horizon. This study considers a workforce scheduling problem in which the actual processing time is a function of the scheduling sequence to represent the decline in workers’ performance, evaluating two classical performance measures separately: makespan and maximum tardiness. Several mathematical models are compared with each other to highlight the advantages of each approach. The mathematical models are tested with randomly generated instances available from a public e-library.
%I Journal Engineering Optimization
%T A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times
%R 10.1080/0305215X.2017.1358362
%~ Intellectum