A Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks

In this paper, we study a new Workforce Scheduling and Routing Problem, denoted Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks. In this problem, customers request services from a company. Each service is composed of dependent tasks, which are executed by teams of varying s...

Celý popis

Podrobná bibliografie

Vydáno v:	arXiv.org
Hlavní autoři:	Dilson Lucas Pereira, Alves, Júlio César, Mayron César de Oliveira Moreira
Médium:	Paper
Jazyk:	angličtina
Vydáno:	Ithaca Cornell University Library, arXiv.org 06.08.2020
Témata:	Algorithms Ant colony optimization Computing time Customers Heuristic methods Integer programming Precedence constraints Problem solving Schedules Search algorithms Task scheduling Workforce
ISSN:	2331-8422
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!