CP methods for scheduling and routing with time-dependent task costs

A particularly difficult class of scheduling and routing problems involves an objective that is a sum of time-varying action costs, which increases the size and complexity of such problems. Solve-and-improve approaches, which find an initial solution for a simplified model and improve it using a cos...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Elena Kelareva, Kevin Tierney, Philip Kilby
Formato: article
Lenguaje:EN
Publicado: Elsevier 2014
Materias:
Acceso en línea:https://doaj.org/article/3a8ac1f77196420b84472f539abc19ed
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!