CP Methods for Scheduling and Routing with Time-Dependent Task Costs
Date
2013
Authors
Kelareva, Elena
Tierney, Kevin
Kilby, Philip
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Abstract
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 the problem. Solve-and-improve approaches, which find an initial solution for a
Description
Keywords
Citation
Collections
Source
Lecture Notes in Computer Science (LNCS)
Type
Journal article
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31
Downloads
File
Description