A Bi-Objective Scheduling Problem in a Home Care Business
Use este enlace para citar
http://hdl.handle.net/2183/29444Colecciones
Metadatos
Mostrar el registro completo del ítemTítulo
A Bi-Objective Scheduling Problem in a Home Care BusinessFecha
2021Cita bibliográfica
Méndez-Fernández, I.; Lorenzo-Freire, S.; González-Rueda, Á.M. A Bi-Objective Scheduling Problem in a Home Care Business. Eng. Proc. 2021, 7, 42. https://doi.org/10.3390/engproc2021007042
Resumen
[Abstract] In this work we study a routing and scheduling problem for a home care business. The problem is composed of two conflicting objectives, therefore we study it as a bi-objective one. We obtain the Pareto frontier for small size instances using the AUGMECON2 method and, for bigger cases, we developed an heuristic algorithm. We also obtained some preliminary results that show the algorithm has good behaviour.
Palabras clave
Optimization
Scheduling
Heuristic algorithms
Operations research
Scheduling
Heuristic algorithms
Operations research
Descripción
Presented at the 4th XoveTIC Conference, A Coruña, Spain, 7–8 October 2021.
Versión del editor
Derechos
Atribución 4.0 Internacional