Show simple item record

dc.contributor.authorRintanen, Jussi
dc.contributor.editorBorrajo, Daniel
dc.contributor.editorKambhampati, Subbarao
dc.contributor.editorOddi, Angelo
dc.contributor.editorFratini, Simone
dc.date.accessioned2017-05-03T16:09:29Z
dc.date.available2017-05-03T16:09:29Z
dc.date.issued2013
dc.date.modified2014-02-12T23:05:03Z
dc.identifier.refurihttp://www.icaps-conference.org/
dc.identifier.urihttp://hdl.handle.net/10072/56735
dc.description.abstractFinding optimal schedules for the most commonly considered classes of scheduling problems is NP-complete. Best algorithms scale up to very large scheduling problems when optimality is not required and good solution quality suffices. These problems have perfect information in the sense that the resource availability, set of tasks, task duration, and other important facts, are fully known at the time of constructing a schedule. However, the assumption of perfect information is rarely satisfied, and real-world scheduling faces several forms of uncertainty, most notably with respect to durations and availability of resources. The effective handling of uncertainty is a major issue in applying scheduling in new areas. In this work, we investigate the properties of a number of classes of problems of contingent scheduling, in which assignments of resources to tasks depend on resource availability and other facts that are only known fully during execution, and hence the off-line construction of one fixed schedule is insufficient. We show that contingent scheduling in most general cases is most likely outside the complexity class NP, and resides, depending on the assumptions, in PSPACE, SigmaP2 or PiP2. The results prove that standard constraint-satisfaction and SAT frameworks are in general not straightforwardly applicable to contingent scheduling.
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.languageEnglish
dc.publisherAAAI Press
dc.publisher.placeUnited States
dc.publisher.urihttp://www.aaai.org/ocs/index.php/ICAPS/ICAPS13/paper/view/6029
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofconferencenameICAPS 2013
dc.relation.ispartofconferencetitleProceedings of the Twenty-Third International Conference on Automated Planning and Scheduling
dc.relation.ispartofdatefrom2013-06-10
dc.relation.ispartofdateto2013-06-14
dc.relation.ispartoflocationRome, Italy
dc.rights.retentionY
dc.subject.fieldofresearchArtificial Intelligence and Image Processing not elsewhere classified
dc.subject.fieldofresearchcode080199
dc.titleScheduling with Contingent Resources and Tasks
dc.typeConference output
dc.type.descriptionE1 - Conferences
dc.type.codeE - Conference Publications
gro.facultyGriffith Sciences, School of Information and Communication Technology
gro.date.issued2013
gro.hasfulltextNo Full Text
gro.griffith.authorRintanen, Jussi


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record