Robustness of Partial Order Schedules: Understanding the Chaining Algorithm

Wilmer, D.W.H.; Klos, Tomas

Robustness of Partial Order Schedules: Understanding the Chaining Algorithm

Conference paper (2015)

Authors

D.W.H. Wilmer Algorithmics

Tomas Klos Algorithmics

Research Group

Algorithmics

To reference this document use:

http://resolver.tudelft.nl/uuid:9da38201-e147-4543-86dc-ea9ae4efb3b1

More Info

expand_more

Published Date

2015

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Research Group

Algorithmics

No files available

Metadata only record. There are no files for this conference paper.