Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks

Detalhes bibliográficos
Autor(a) principal: Pontes, Vitor Notini
Data de Publicação: 2020
Tipo de documento: Dissertação
Idioma: eng
Título da fonte: Repositório Institucional da UFLA
Texto Completo: http://repositorio.ufla.br/jspui/handle/1/45585
Resumo: Logistics problems lie at the core of industries' everyday operations. These types of problems are also one of the main points of interest in the Operations Research field of study. In recent decades, a class of combinatorial optimization problems, named Workforce Scheduling and Routing Problems (WSRP), has gained significant attention from researchers. In this document, a recently proposed WSRP is studied: in the Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks (MWSRPDT) a given company provides services by means of mobile teams. Service requests are known beforehand and each service is composed of one or more activities, where one activity may depend on the completion of another. A feasible schedule must be provided where all requested activities are completed in the minimum amount of days while respecting existing dependencies. Two hybrid exact-heuristic approaches based on a Mixed-Integer Programming formulation are proposed. Several new upper bounds for a set of instances obtained from the literature are discovered.
id UFLA_8c673185134fd5c6c1487ecaeb30ba40
oai_identifier_str oai:localhost:1/45585
network_acronym_str UFLA
network_name_str Repositório Institucional da UFLA
repository_id_str
spelling Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasksOtimização combinatóriaAlgoritmo híbrido exato-heurísticoCombinatorial optimizationHybrid exact-heuristicWorkforce schedulingRouting problemCiência da ComputaçãoLogistics problems lie at the core of industries' everyday operations. These types of problems are also one of the main points of interest in the Operations Research field of study. In recent decades, a class of combinatorial optimization problems, named Workforce Scheduling and Routing Problems (WSRP), has gained significant attention from researchers. In this document, a recently proposed WSRP is studied: in the Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks (MWSRPDT) a given company provides services by means of mobile teams. Service requests are known beforehand and each service is composed of one or more activities, where one activity may depend on the completion of another. A feasible schedule must be provided where all requested activities are completed in the minimum amount of days while respecting existing dependencies. Two hybrid exact-heuristic approaches based on a Mixed-Integer Programming formulation are proposed. Several new upper bounds for a set of instances obtained from the literature are discovered.Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Problemas de logística se encontram no núcleo das operações de dia-a-dia de diversas indústrias. Estes tipos de problema são também um dos principais pontos de interesse da área de pesquisa conhecida como Pesquisa Operacional. Em décadas recentes, uma classe de problemas de otimização combinatória, chamada Workforce Scheduling and Routing Problems (WSRP), tem recebido significativa atenção dos pesquisadores. Neste documento, um WSRP proposto recentemente é estudado: no Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks (MWSRPDT), uma empresa oferece serviços através de equipes móveis. Pedidos são conhecidos a priori e cada serviço é composto de uma ou mais atividades, onde uma pode depender do término de outra para que possa ser iniciada. É necessário construir um planejamento viável que visa a realização de todas as atividades requisitadas na menor quantidade de dias possível, enquanto ainda respeitando as dependências existentes. Dois algoritmos híbridos exato-heurísticos baseados em um modelo de Programação Mista-Inteira são propostos. Diversos novos limites superiores para um conjunto de instâncias obtidos da literatura foram descobertos.Universidade Federal de LavrasPrograma de Pós-Graduação em Ciência da ComputaçãoUFLAbrasilDepartamento de Ciência da ComputaçãoPereira, Dilson LucasSaúde, André VitalSouza, Fernanda Sumika Hojo deMoreira, Mayron César de OliveiraJanuario, Tiago de OliveiraPontes, Vitor Notini2020-11-23T17:18:02Z2020-11-23T17:18:02Z2020-11-232020-11-03info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisapplication/pdfPONTES, V. N. Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks. 2020. 89 p. Dissertação (Mestrado em Ciência da Computação) - Universidade Federal de Lavras, Lavras, 2020.http://repositorio.ufla.br/jspui/handle/1/45585enginfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFLAinstname:Universidade Federal de Lavras (UFLA)instacron:UFLA2020-11-23T17:47:21Zoai:localhost:1/45585Repositório InstitucionalPUBhttp://repositorio.ufla.br/oai/requestnivaldo@ufla.br || repositorio.biblioteca@ufla.bropendoar:2020-11-23T17:47:21Repositório Institucional da UFLA - Universidade Federal de Lavras (UFLA)false
dc.title.none.fl_str_mv Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks
title Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks
spellingShingle Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks
Pontes, Vitor Notini
Otimização combinatória
Algoritmo híbrido exato-heurístico
Combinatorial optimization
Hybrid exact-heuristic
Workforce scheduling
Routing problem
Ciência da Computação
title_short Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks
title_full Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks
title_fullStr Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks
title_full_unstemmed Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks
title_sort Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks
author Pontes, Vitor Notini
author_facet Pontes, Vitor Notini
author_role author
dc.contributor.none.fl_str_mv Pereira, Dilson Lucas
Saúde, André Vital
Souza, Fernanda Sumika Hojo de
Moreira, Mayron César de Oliveira
Januario, Tiago de Oliveira
dc.contributor.author.fl_str_mv Pontes, Vitor Notini
dc.subject.por.fl_str_mv Otimização combinatória
Algoritmo híbrido exato-heurístico
Combinatorial optimization
Hybrid exact-heuristic
Workforce scheduling
Routing problem
Ciência da Computação
topic Otimização combinatória
Algoritmo híbrido exato-heurístico
Combinatorial optimization
Hybrid exact-heuristic
Workforce scheduling
Routing problem
Ciência da Computação
description Logistics problems lie at the core of industries' everyday operations. These types of problems are also one of the main points of interest in the Operations Research field of study. In recent decades, a class of combinatorial optimization problems, named Workforce Scheduling and Routing Problems (WSRP), has gained significant attention from researchers. In this document, a recently proposed WSRP is studied: in the Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks (MWSRPDT) a given company provides services by means of mobile teams. Service requests are known beforehand and each service is composed of one or more activities, where one activity may depend on the completion of another. A feasible schedule must be provided where all requested activities are completed in the minimum amount of days while respecting existing dependencies. Two hybrid exact-heuristic approaches based on a Mixed-Integer Programming formulation are proposed. Several new upper bounds for a set of instances obtained from the literature are discovered.
publishDate 2020
dc.date.none.fl_str_mv 2020-11-23T17:18:02Z
2020-11-23T17:18:02Z
2020-11-23
2020-11-03
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/masterThesis
format masterThesis
status_str publishedVersion
dc.identifier.uri.fl_str_mv PONTES, V. N. Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks. 2020. 89 p. Dissertação (Mestrado em Ciência da Computação) - Universidade Federal de Lavras, Lavras, 2020.
http://repositorio.ufla.br/jspui/handle/1/45585
identifier_str_mv PONTES, V. N. Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks. 2020. 89 p. Dissertação (Mestrado em Ciência da Computação) - Universidade Federal de Lavras, Lavras, 2020.
url http://repositorio.ufla.br/jspui/handle/1/45585
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universidade Federal de Lavras
Programa de Pós-Graduação em Ciência da Computação
UFLA
brasil
Departamento de Ciência da Computação
publisher.none.fl_str_mv Universidade Federal de Lavras
Programa de Pós-Graduação em Ciência da Computação
UFLA
brasil
Departamento de Ciência da Computação
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFLA
instname:Universidade Federal de Lavras (UFLA)
instacron:UFLA
instname_str Universidade Federal de Lavras (UFLA)
instacron_str UFLA
institution UFLA
reponame_str Repositório Institucional da UFLA
collection Repositório Institucional da UFLA
repository.name.fl_str_mv Repositório Institucional da UFLA - Universidade Federal de Lavras (UFLA)
repository.mail.fl_str_mv nivaldo@ufla.br || repositorio.biblioteca@ufla.br
_version_ 1784550069319499776

Registros relacionados