Skip to main content

An Integer Programming Model for Course Timetabling Problem at HUST

  • Conference paper
  • First Online:
Intelligent Systems and Networks (ICISN 2021)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 243))

Included in the following conference series:

  • 796 Accesses

Abstract

Creating a course timetable for university is a complex problem. It is difficult and time-consuming to solve due to many constraints, including ‘hard’ constraints and ‘soft’ constraints. The proposed model is a 0-1 integer programming model that provides constraints for a host of operational rules and requirements found in Hanoi University of Science and Technology (HUST). The objective is to minimize a linear cost function related to the cost of infrastructure (classrooms) and teaching staff. The problem was solved successfully for medium-sized data sets by CPLEX 12.8. The case of a school (SAMI) in HUST with a considerable number of courses and lecturers is presented along with its solution as resulted from the proposed model.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Similar content being viewed by others

References

  1. Wolsey, L.A.: Integer Programming (1998)

    Google Scholar 

  2. Daskalaki, S., Birbas, T., Housos, E.: An integer programming for a case study in university timetabling. Eur. J. Oper. Res. 153, 117–135 (2004)

    Article  MathSciNet  Google Scholar 

  3. Bruke, E.K., Petrovic, S.: Recent research directions in automated timetabling. Eur. J. Oper. Res. 140, 266–280 (2002)

    Article  Google Scholar 

  4. Welsh, D.J.A., Powell, M.B.: An upper bound to the chromatic number of a graph and its application to timetabling problem. Comput. J. 10, 85–86 (1967)

    Article  Google Scholar 

  5. Tripathy, A.: School timetabling - a case in large binary integer linear-programming. Manag. Sci. 30, 1473–1489 (1984)

    Article  Google Scholar 

  6. Man, K.F., Tang, K.S., Kwong, S.: Genetic algorithms: concepts and applications. IEEE Trans. Ind. Electron. 43, 519–534 (1996)

    Article  Google Scholar 

  7. IBM CPLEX Optimizer. https://www.ibm.com/analytics/cplex-optimizer

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ta Anh Son .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Son, T.A., Ngan, N.T. (2021). An Integer Programming Model for Course Timetabling Problem at HUST. In: Tran, DT., Jeon, G., Nguyen, T.D.L., Lu, J., Xuan, TD. (eds) Intelligent Systems and Networks . ICISN 2021. Lecture Notes in Networks and Systems, vol 243. Springer, Singapore. https://doi.org/10.1007/978-981-16-2094-2_43

Download citation

Publish with us

Policies and ethics