Use this link to cite:

http://hdl.handle.net/2183/29444

A Bi-Objective Scheduling Problem in a Home Care Business

Thumbnail Image

Files

Mendez_Fernandez_2021_A_Bi-Objective_Scheduling.pdf (329.07 KB)

Identifiers

URI: http://hdl.handle.net/2183/29444
DOI: 10.3390/engproc2021007042

Publication date

2021

Authors

Advisors

Other responsabilities

Journal Title

Bibliographic citation

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

Type of academic work

Academic degree

Abstract

[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.

Description

Presented at the 4th XoveTIC Conference, A Coruña, Spain, 7–8 October 2021.

Keywords

Optimization Scheduling Heuristic algorithms Operations research

Editor version

https://doi.org/10.3390/engproc2021007042

Rights

Atribución 4.0 Internacional

Collections

Investigación (FIC)
Atribución 4.0 Internacional

Except where otherwise noted, this item's license is described as Atribución 4.0 Internacional