Optimising Flexibility for Simple Temporal Networks

Cees Witteveen

doi:10.5220/0005824205240531

Optimising Flexibility for Simple Temporal Networks

Algorithmics

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

1 Citation (Scopus)

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%.

Original language	English
Title of host publication	Proceedings of the 8th International Conference on Agents and Artificial Intelligence
Editors	Joaquim Filipe, Jaap van den Herik
Publisher	SciTePress
Pages	524-531
Number of pages	8
Volume	2
ISBN (Print)	978-989-758-172-4
DOIs	https://doi.org/10.5220/0005824205240531
Publication status	Published - 2016
Event	ICAART 2016: 8th International Conference on Agents and Artificial Intelligence - Rome, Italy Duration: 24 Feb 2016 → 26 Feb 2016 Conference number: 8 http://www.icaart.org/?y=2016

Conference

Conference	ICAART 2016
Country/Territory	Italy
City	Rome
Period	24/02/16 → 26/02/16
Internet address	http://www.icaart.org/?y=2016

Keywords

flexibility
linear programming
scheduling
simple temporal planning

Access to Document

10.5220/0005824205240531Licence: Unspecified

Cite this

@inproceedings{41e796ff109b4dc08c68888f54d90a54,

title = "Optimising Flexibility for Simple Temporal Networks",

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%.",

keywords = "flexibility, linear programming, scheduling, simple temporal planning",

author = "Cees Witteveen",

year = "2016",

doi = "10.5220/0005824205240531",

language = "English",

isbn = "978-989-758-172-4",

volume = "2",

pages = "524--531",

editor = "Joaquim Filipe and {van den Herik}, Jaap",

booktitle = "Proceedings of the 8th International Conference on Agents and Artificial Intelligence",

publisher = "SciTePress",

note = "ICAART 2016 : 8th International Conference on Agents and Artificial Intelligence ; Conference date: 24-02-2016 Through 26-02-2016",

url = "http://www.icaart.org/?y=2016",

}

TY - GEN

T1 - Optimising Flexibility for Simple Temporal Networks

AU - Witteveen, Cees

N1 - Conference code: 8

PY - 2016

Y1 - 2016

N2 - 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%.

AB - 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%.

KW - flexibility

KW - linear programming

KW - scheduling

KW - simple temporal planning

U2 - 10.5220/0005824205240531

DO - 10.5220/0005824205240531

M3 - Conference contribution

SN - 978-989-758-172-4

VL - 2

SP - 524

EP - 531

BT - Proceedings of the 8th International Conference on Agents and Artificial Intelligence

A2 - Filipe, Joaquim

A2 - van den Herik, Jaap

PB - SciTePress

T2 - ICAART 2016

Y2 - 24 February 2016 through 26 February 2016

ER -

Optimising Flexibility for Simple Temporal Networks

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this