A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times
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 sche...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2017 |
| País: | Colombia |
| Institución: | Universidad de los Andes |
| Repositorio: | Séneca: repositorio Uniandes |
| Idioma: | inglés |
| OAI Identifier: | oai:repositorio.uniandes.edu.co:1992/47009 |
| Acceso en línea: | http://hdl.handle.net/1992/47009 |
| Access Level: | acceso abierto |
| Palabra clave: | Scheduling Parallel machines Deteriorating jobs Makespan Tardiness |
| Sumario: | 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. |
|---|