@misc{10818/36936,
year = {2018},
url = {http://hdl.handle.net/10818/36936},
abstract = {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.},
publisher = {Journal Engineering Optimization},
title = {A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times},
doi = {10.1080/0305215X.2017.1358362},
author = {Moreno Camacho, Carlos Alberto and Montoya Torres, Jairo Rafael and Vélez Gallego, Mario C.},
}