Partial-Order Support-Link Scheduling
Banerjee, Debdeep; Haslum, Patrik
Description
Partial-order schedules are valued because they are flexible, and therefore more robust to unexpected delays. Previous work has indicated that constructing partial-order schedules by a two-stage method, in which a fixed-time schedule is first found and a
Collections | ANU Research Publications |
---|---|
Date published: | 2011 |
Type: | Conference paper |
URI: | http://hdl.handle.net/1885/36443 |
Source: | International Conference on Automated Planning and Scheduling 2011 proceedings |
Access Rights: | Open Access |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Banerjee_Partial-Order_Support-Link_2011.pdf | 114.92 kB | Adobe PDF |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator