Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Task Structure Abstraction
RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.ORCID iD: 0000-0002-0236-783X
RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.ORCID iD: 0000-0002-9331-0352
2001 (English)Report (Other academic)
Abstract [en]

This paper explores the idea of using formalised abstraction as means of describing various operations on structured representations of planing, scheduling and resource allocation problems. We define a notion of structures on tasks, relations and resources. Each task consists of task parameters and an inductively defined substructure. The task parameters denote domain variables constrained by the relations of the structure while resources formalises resource constraints, typically presupposing the semantics of some global constraint. A notion of consistency of such structures is briefly outlined. We go on characterise properties of safeness and certain conservation properties on operations We claim that such properties are relevant to problem domains where tasks on several different types or levels of resources has to scheduled simultaneously or by partitioning the problem into several subproblems that has then to be coordinated. Finally we present, in some detail, a model of such a problem from the rail transport industry formalised as several task structures. We show how operations on these can be seen as solvers for the various subproblems but also used to transform a specification or a solution of one subproblem into a specification of an other one. We claim that properties of such operations can be used to characterise reasoning in coordination problems.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2001, 1. , 14 p.
Series
SICS Technical Report, ISSN 1100-3154 ; 2001:05
Keyword [en]
Formal abstraction, task scheduling, resource management, hierarchical planning, approximate methods, problem coordination, constraint programming, formal models
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-22109OAI: oai:DiVA.org:ri-22109DiVA: diva2:1041651
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2017-10-12Bibliographically approved

Open Access in DiVA

fulltext(233 kB)3 downloads
File information
File name FULLTEXT01.pdfFile size 233 kBChecksum SHA-512
9bbc3ad505b7d4476e040622c6640125fe504cc5abda1b1fb9d2d236f9247eb4ddd5447812c1940c9f60fcd3949cff9141f5bcc2fe2dd9e255e8cf30b5ac33d8
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Aronsson, MartinKreuger, Per
By organisation
Decisions, Networks and Analytics lab
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 3 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 1 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf