Network construction problems with due dates

Igor Averbakh, Jordi Pereira

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

20 Citas (Scopus)

Resumen

Abstract A network needs to be constructed by a server (construction crew) that has a constant construction speed which is incomparably slower than the server's travel speed within the already constructed part of the network. A vertex is recovered when it becomes connected to the depot by an already constructed path. Due dates for recovery times are associated with vertices. The problem is to obtain a construction schedule that minimizes the maximum lateness of vertices, or the number of tardy vertices. We introduce these new problems, discuss their computational complexity, and present mixed-integer linear programming formulations, heuristics, a branch-and-bound algorithm, and results of computational experiments.

Idioma originalInglés
Número de artículo12783
Páginas (desde-hasta)715-729
Número de páginas15
PublicaciónEuropean Journal of Operational Research
Volumen244
N.º3
DOI
EstadoPublicada - 1 ago. 2015
Publicado de forma externa

Huella

Profundice en los temas de investigación de 'Network construction problems with due dates'. En conjunto forman una huella única.

Citar esto