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...
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Elsevier
2014
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/3a8ac1f77196420b84472f539abc19ed |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|