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

Uložené v:

Podrobná bibliografia
Vydané v:	arXiv.org
Hlavní autori:	Dilson Lucas Pereira, Alves, Júlio César, Mayron César de Oliveira Moreira
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 06.08.2020
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!