Skip to main content
SpringerLink
Log in

Teaching Assignment Problem Solver

  • Conference paper
Trends in Applied Intelligent Systems (IEA/AIE 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6097))

Abstract

In this paper, we describe an extension approach to the backtracking with look-ahead forward checking method that adopts weighted partial satisfaction of soft constraints that has been implemented to the development of an automated teaching assignment timetabling system. Determining the optimal solution for a teaching assignment problem is a challenging task. The objective is to construct a timetable for professors from already scheduled courses that satisfy both hard constraints (problem requirements such as no teacher should be assigned two courses at the same time) and soft constraints (teacher preferences) based on fairness principle in distributing courses among professors. The approach is done mainly to modify the variable selection method and the value assignment technique taking into account preferences and based on fairness principle. The optimized look-ahead backtracking method applied to the solution is presented and discussed along with computational results.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Tamura, N.: Cream: Class Library for Constraint Programming in Java. Kobe University (2009), http://bach.istc.kobe-u.ac.jp/cream/

  2. Valdes, R.A., Crespo, E., Tamarit, J.M.: Design and implementation of a course scheduling system using Tabu Search. European Journal of Operational Research 37, 512–523 (2002)

    Article  MATH  Google Scholar 

  3. Burke, E.K., Jackson, K., Kingston, J., Weare, R.E.: Automated university timetabling: the state of the art. The computer journal 40, 565–571 (1997)

    Article  Google Scholar 

  4. Carter, M.W., Laporte, G.: Recent developments in practical course timetabling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 3–19. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Welsh, D.J.A., Powell, M.B.: An upper bound for the chromatic number of graph and its application to timetabling problems.1. The Computer Journal 10, 360–364 (1967)

    Article  MATH  Google Scholar 

  6. Wood, D.C.A.: Technique for colouring a graph applicable to large scale timetabling problems. The Computer Journal 12, 317–319 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  7. Selim, S.M.: Split Vertices in Vertex colouring and their application in developping a solution to the faculty timetable problem. The Computer Journal 31, 76–82 (1988)

    Article  MATH  Google Scholar 

  8. Burke, E.K., Ross, P. (eds.): PATAT 1995. LNCS, vol. 1153, pp. 296–308. Springer, Heidelberg (1996)

    Book  Google Scholar 

  9. Miner, S., Elmohamed, S., Yau, H.W.: Optimizing Timetabling Solutions Using Graph Coloring. NY: NPAC REU program, NPAC, Syracuse University (1995)

    Google Scholar 

  10. Timothy, A.R.: A Study of university timetabling that blends graph coloring with the satisfaction of various essential and preferential conditions. Rice University: Ph.D. Thesis (2004)

    Google Scholar 

  11. Daskalaki, S., Birbas, T., Housos, E.: An integer programming formulation for a case study in university timetabling. European Journal of Operational Research, 117–135 (2004)

    Google Scholar 

  12. Daskalaki, S., Birbas, T.: Efficient solutions for university timetabling problem through integer programming. European Journal of Operational Research, 106–121 (2005)

    Google Scholar 

  13. Dimopoulou, M., Miliotis: An Automated Course Timetabling System developed in a distributed Environment: a Case Study. European Journal of Operational Research, 153, 136–148 (2004)

    Google Scholar 

  14. Dimopoulou, M., Miliotis, P.: Implementation of a University Course and Examination Timetabling System. European Journal of Operational Research 130, 202–213 (2001)

    Article  MATH  Google Scholar 

  15. Schimmelpfeng, k., Helber, S.: Application of a real-world university-course timetabling model solved by integer programming. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  16. Rudov, H., Murray, K.: University Course Timetabling with Soft Constraints, pp. 310–327. Springer, Heidelberg (2003)

    Google Scholar 

  17. George, T.B., Opalikhin, V., Chung, C.J.: Using an Evolution Strategy for a University Timetabling System with a Web Based Interface to Gather Real Student Data. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2724. Springer, Heidelberg (2003)

    Google Scholar 

  18. Burke, E.K., MacCathy, B., Petrovic, S., Qu, R.: Case-based reasoning in course timetabling: an attribute graph approach. In: Aha, D.W., Watson, I. (eds.) ICCBR 2001. LNCS (LNAI), vol. 2080, pp. 90–105. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  19. Burke, E.K., MacCathy, B., Petrovic, S., Qu, R.: Multiple-retrieval case-based reasoning for course timetabling problems. Journal of the Operational Research Society, 1–15 (2005)

    Google Scholar 

  20. Burke, E.K., MacCathy, B., Petrovic, S.: Knowledge discovery in a hyperheuristic for course timetabling using case-based reasoning. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 90–103. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  21. Burke, E.K., MacCathy, B., Petrovic, S., Qu, R.: Structured case in case-based reasoning-re-using and adapting cases for timetabling problems. Knowledge-Based Systems 13, 159–165 (2000)

    Article  Google Scholar 

  22. Schank, R.C., Abelson, R.P.: Scripts, plans, goals and understanding. Erlbaum, New Jersey (1977)

    MATH  Google Scholar 

  23. Burke, E.K., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A graph-based hyperheuristic for educational timetabling problem. European Journal of Operational Research, 1–16 (2006)

    Google Scholar 

  24. Gislen, L., Soderberg, B., Peterson, C.: Teachers and Classes with Neural Nets. International Journal of Neural Systems 1, 167–168 (1989)

    Article  Google Scholar 

  25. Gislen, L., Soderberg, B., Peterson, C.: Complex scheduling with Potts neural networks. Neural Computation 4, 805–831 (1992)

    Article  Google Scholar 

  26. Tamura, N.: Calc/Cream: OpenOffice Spreadsheet Front-End for Constraint Programming. In: Umeda, M., Wolf, A., Bartenstein, O., Geske, U., Seipel, D., Takata, O. (eds.) INAP 2005. LNCS, vol. 4369, pp. 81–87. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  27. Dechter, R.: Constraint Processing, 1st edn., pp. 123–128. Morgan Kaufmann, San Francisco (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Regina, Wascana Parkway, Regina, SK, Canada, S4S 0A2

    Ali Hmer & Malek Mouhoub

Authors
  1. Ali Hmer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Malek Mouhoub
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computing and Numerical Analysis, University of Cordoba, Campus Universitario de Rabanales, Einstein Building, 3rd floor,, 14071, Cordoba, Spain

    Nicolás García-Pedrajas

  2. Dept. of Computer Science and Artificial Intelligence, ETS de Ingenierias Informática y de Telecomunicación, University of Granada, 18071, Granada, Spain

    Francisco Herrera

  3. School of Computing, University of the West of Scotland, PA1 2BE, Paisley, UK

    Colin Fyfe

  4. Dept. Computer Science and Artificial Intelligence, ETS de Ingenierias Informática y de Telecomunicación, University of Granada, 18071, Granada, Spain

    José Manuel Benítez

  5. Department of Computer Science, Texas State University-San Marcos, 601 University Drive, TX 78666-4616, San Marcos, USA

    Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hmer, A., Mouhoub, M. (2010). Teaching Assignment Problem Solver. In: García-Pedrajas, N., Herrera, F., Fyfe, C., Benítez, J.M., Ali, M. (eds) Trends in Applied Intelligent Systems. IEA/AIE 2010. Lecture Notes in Computer Science(), vol 6097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13025-0_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13025-0_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13024-3

  • Online ISBN: 978-3-642-13025-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation