Optimising Flexibility for Simple Temporal Networks

Conference paper (2016)

Authors

C. Witteveen Algorithmics -

Research Group

Algorithmics () (TU Delft)

Linear programming Scheduling Flexibility Simple temporal planning

To reference this document use:

http://resolver.tudelft.nl/uuid:41e796ff-109b-4dc0-8c68-888f54d90a54

More Info

expand_more

Published Date

2016

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.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Technology

Research Group

Algorithmics

Abstract

We generalise a recently proposed concurrent flexibility metric to overcome some of its shortcomings. We show that these shortcomings can be removed if one selects an optimal subset of variables for which the concurrent flexibility is determined. The flexibility of the remaining variables does not play a role in the determination of the flexibility of the system. We present a preliminary experimental evaluation of the improvement in concurrent flexibility that can be obtained by comparing some (approximation) algorithms. Their performance on several benchmark sets is evaluated. As a result, in some cases the concurrent flexibility of an STN can be enhanced by 20-50%.