Skip to main content
SpringerLink
Log in

Assigning Resources to Constrained Activities

  • Conference paper
  • First Online:
Practice and Theory of Automated Timetabling III (PATAT 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2079))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arkin, E., Silverberg, E.: Scheduling Jobs with Fixed Start and End Times. Discrete Appl. Math. 18 (1987) 1–8

    Article  MATH  MathSciNet  Google Scholar 

  2. Carter, M., Laporte, G.: Recent Developments in Practical Examination Timetabling. In: Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996)

    Google Scholar 

  3. Choueiry, B.Y.: Abstraction Methods for Resource Allocation Ph.D.Thesis, EPFL, Lausanne (1994)

    Google Scholar 

  4. Choueiry, B.Y., Faltings, B.: A Decomposition Heuristic for Resource Allocation. In: Proc. 11th Eur. Conf. on Artificial Intelligence (Amsterdam, 1994) 585-9

    Google Scholar 

  5. Choueiry, B.Y., Faltings, B.: Interactive Resource Allocation Problem Decomposition and Temporal Abstractions. In: Backstrom and Sandwell (eds.): Current Trends in AIPlanning. IOS Press (1994) 87–104

    Google Scholar 

  6. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic, New York London (1980)

    MATH  Google Scholar 

  7. Golumbic, M.C.: Algorithmic Aspects of Perfect Graphs. Ann. Discrete Math. 21 (1984) 301–323

    MathSciNet  Google Scholar 

  8. Meisels, A., El-Saana, J., Gudes, E.: Decomposing and Solving Timetabling Constraint Networks. Comput. Intell. (1997) 13 (1997) 486–505

    Article  Google Scholar 

  9. Meisels, A., Gudes, E., Solotorevsky, G.: Combining Rules and Constraints for Employee Timetabling. Int. J. Intell. Syst. 12 (1997) 419–439

    Article  Google Scholar 

  10. Meisels, A., Liusternik, N.: Experiments on Networks of Employee Timetabling Problems. In: Proc. PATAT’97 (Toronto, Canada). Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1997) 130–141

    Google Scholar 

  11. Meisels, A., Schaerf, A.: Modelling and Solving Employee Timetabling Problems. Appl. Intell. submitted October, 1999

    Google Scholar 

  12. Ovadia, E.: Delay and Order Variables in Timetabling Problems. M. Sc. Thesis, Ben-Gurion University (1999)

    Google Scholar 

  13. Prosser, P.: Hybrid Algorithms for the Constraint Satisfaction Problem. Comput. Intell. 9 (1993) 268–299

    Article  Google Scholar 

  14. Prosser, P.: Binary Constraint Satisfaction Problems: Some Are Harder than Others. In: Proc. 11th Eur. Conf. on Artificial Intelligence (Amsterdam, 1994) 95–99

    Google Scholar 

  15. Regini, J.C.: A Filtering Algorithm for Constraints of Difference in CSPs. In: AAAI-94 (Seattle, WA, 1994) 362–367

    Google Scholar 

  16. Schaerf, A., Meisels, A.: Solving Employee Timetabling Problems by Generalized Local Search. In: Proc. Italian AI Assoc. (May, 1999) 493–502

    Google Scholar 

  17. Smith, B.M.: Phase Transition and the Mushy Region in CSP. In: Proc. 11th Eur. Conf. on Artificial Intelligence (Amsterdam, 1994) 100–104

    Google Scholar 

  18. Tsang, E.: Foundations of Constraint Satisfaction. Academic, New York (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84-105, Israel

    Amnon Meisels & Ella Ovadia

Authors
  1. Amnon Meisels
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ella Ovadia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Information Technology Automated Scheduling, Optimisation and Planning Research Group, University of Nottingham, Jubilee Campus,Wollaton Road, NG8 1BB, Nottingham, UK

    Edmund Burke

  2. Department of Computer Science, FH Konstanz, University of Applied Science, Brauneggerstr. 55, 78462, Konstanz, Germany

    Wilhelm Erben

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meisels, A., Ovadia, E. (2001). Assigning Resources to Constrained Activities. In: Burke, E., Erben, W. (eds) Practice and Theory of Automated Timetabling III. PATAT 2000. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44629-X_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-44629-X_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42421-5

  • Online ISBN: 978-3-540-44629-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation