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 the problem. Solve-and-improve approaches, which find an initial solution for a
|Collections||ANU Research Publications|
|Source:||Lecture Notes in Computer Science (LNCS)|
|01_Kelareva_CP_Methods_for_Scheduling_and_2013.pdf||7.02 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.