Assigning resources to constrained activities

Amnon Meisels, Ella Ovadia

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Resource allocation problems (RAPs)are naturally represented as constraint networks (CNs), with constraints of inequality among activities that compete for the same resources at the same time [5]. A large variety of timetabling problems can be formulated as CNs with inequality constraints (representing time conflicts among classes of the same teacher, for example). A new algorithm for solving networks of RAPs is described and its detailed behavior is presented on a small example. The proposed algorithm delays assignments of resources to selected activities and processes the network during the assignment procedure, to select delays and values. The proposed algorithm is an enhancement to standard intelligent backtracking algorithms [13], is complete and performs better than two former approaches to solving CNs of resource allocation [15], [3], [4]. Results of comparing the proposed resource assignment algorithm to other ordering heuristics, on randomly generated networks, are reported.

Original languageEnglish
Title of host publicationPractice and Theory of Automated Timetabling III - Third International Conference, PATAT 2000, Selected Papers
EditorsEdmund Burke, Wilhelm Erben
PublisherSpringer Verlag
Pages213-223
Number of pages11
ISBN (Print)3540424210, 9783540424215
DOIs
StatePublished - 1 Jan 2001
Event3rd International Conference on the Practice and Theory of Automated Timetabling, PATAT 2000 - Konstanz, Germany
Duration: 16 Aug 200018 Aug 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2079 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Conference on the Practice and Theory of Automated Timetabling, PATAT 2000
Country/TerritoryGermany
CityKonstanz
Period16/08/0018/08/00

Keywords

  • Constraint-based methods
  • Timetabling networks

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Assigning resources to constrained activities'. Together they form a unique fingerprint.

Cite this