Skip navigation
Skip navigation

CP Methods for Scheduling and Routing with Time-Dependent Task Costs

Kelareva, Elena; Tierney, Kevin; Kilby, Philip


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

CollectionsANU Research Publications
Date published: 2013
Type: Journal article
Source: Lecture Notes in Computer Science (LNCS)
DOI: 10.1007/978-3-642-38171-3_8


File Description SizeFormat Image
01_Kelareva_CP_Methods_for_Scheduling_and_2013.pdf7.02 MBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator