A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times. Issue 6 (3rd June 2018)

• Record Type: Journal Article
• Authors: Moreno-Camacho, Carlos A.; Montoya-Torres, Jairo R.; Vélez-Gallego, Mario C.
• Is Part Of: Engineering optimization. Volume 50:Issue 6(2018)
• Page Start: 917
• Page End: 932
• Publication Date: 2018-06-03
• Subjects: Scheduling -- parallel machines -- deteriorating jobs -- makespan -- tardiness; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2017.1358362
• Languages: English
• ISSNs: 0305-215X

Abstract

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.