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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Elsevier
2014
|
| Subjects: | |
| Online Access: | https://doaj.org/article/3a8ac1f77196420b84472f539abc19ed |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|