Optimizing Classroom Allocation using Markov Chain Model for Shifted Lecture Schedules
DOI:
https://doi.org/10.25077/jmua.15.1.17-29.2026Keywords:
Classroom Allocation, Markov Chain, Shift Lecture SchedulesAbstract
This study aims to optimize classroom allocation for shift lecture schedules at the Batam Institut of Technology (ITEBA) using a Markov chain model. Classroom utilization data from the Odd and EVen Semesters of the 2024/2025 Academic Year were analyzed by defining four classroom usage states: occupied in the morning shift and vacant in the evening shift (OV), vacant in the morning shift and occupied in the evening shift (VO), occupied in both morning and evening shifts (OO), and vacant in both morning and evening shifts (VV). State transition analysis revealed patterns in classroom allocation dynamics between semesters, while steady-state analysis projected long term utilization. The results show a steady-state probability of 74.04% for the OO state (optimal utilization), but 15.48% of classrooms remain in the VV state (chronic underutilization). Based on these findings, the study recommends a classroom consolidation strategy based on complementary patterns, implementation of a digital reservation system, and optimization of single shift usage. This study concludes that the Markov chain model provides a scientific basis for strategic decision making in educational facility management.
Downloads
References
[1] Atje, R., 2021, Batam’s Special Economic Status: A Mixed Blessing?, The SIJORI Series: The Riau Island Setting Sail, 103 – 113, ISEAS Yusof Ishak Institute
[2] Wulandari, S. N., Raihan, A. U., Sasnita, S. D., 2023, The Strategy of The Riau Islands Province in Facing Challenges as A State Border Area, International Conference Social-Humanities in Maritime and Border Area (SHIMBA 2023), 110 – 114, Atlantis Press
[3] Asep, D., Afrizal, A., Muhammad, M., Satriawan, B., 2022, The Effect of Work Motivation, Compensation and Work Discipline on Employee Performance through Job Satisfaction at Batam University Indonesia, International Journal of Advances in Social Sciences and Humanities, Vol. 1: 159 – 165
[4] Widiantoro, S., 2017, The implementation of Analytical Hierarchy Process Method for Outstanding Achievement Scholarship Reception Selection at Universal University of Batam, OP Conference Series: Earth and Environmental Science, Vol. 97: 012003, IOP Publishing
[5] Hermawan, A., Rifai, A. I., Handayani, S., 2022, Analysis of Student Mode Selection Behavior at Batam International University, Indonesian Journal of Multidisciplinary Science, Vol. 1: 1 – 16
[6] Christian, Y., 2020, Application of K-Means Algorithm for Clustering the Quality of Lecturer Learning at Batam International University, IJISTECH (International Journal of Information System and Technology), Vol. 3: 191 – 199
[7] Naim, Y. J., 2019, Lima penghargaan ”Kota Cerdas” dari ITEBA disabet Kota Batam, Antara: Kantor Berita Indonesia, www.antaranews.com
[8] Putut, A. T. P., 2024, ITEBA Mantapkan Peran Sebagai Perguruan Tinggi Berbasis Teknologi, Batam Pos, metro.batampos.co.id
[9] Ikhsan, Muhammad, 2023, ITEBA Bersiap Menjadi Kampus Berstandar Dunia, Batam News, www.batamnews.co.id
[10] ITEBA, 2025, Kenapa Kuliah di ITEBA?, Institut Teknologi Batam, iteba.ac.id
[11] Zhang, H., Xiao, B., Li, J. and Hou, M., 2021, An Improved Genetic Algorithm and Neural Network-Based Evaluation Model of Classroom Teaching Quality in Colleges and Universities, Wireless Communications and Mobile Computing, Vol. 1: 2602385
[12] Zhang, Qiang, 2022, An Optimized Solution to The Course Scheduling Problem in Universities under an Improved Genetic Algorithm, Journal of Intelligent Systems, Vol. 31: 1065 – 1073
[13] Chen, Xiangliu, Yue, Xiao-Guang, Li, Rita, Zhumadillayeva, Ainur, Liu, Ruru, 2021, Design and Application of an Improved Genetic Algorithm to a Class Scheduling System, International Journal of Emerging Technologies in Learning (iJET), Vol. 16: 44 – 59
[14] Anggraeni, A.S., Sabarinsyah, S., Hayati, N., Wati, D.C., Ananda, S.T., 2025, Fuzzy time series markov chain and discrete-time markov chain analysis of export gonggong in Batam, Desimal: Jurnal Matematika, Vol. 8: 59 – 70
[15] Gupta, R. K., Khan, D., Banerjee, S., Samanta, F. 2020, An Application of Markovian Brand Switching Model to Develop Marketing Strategies in Sunscreen Market with Special Emphasis on the Determination of Long Run Steady State Market Shares, International Journal of Applied Marketing and Management, Vol. 5: 21 – 27
[16] Hayati, N., Kiftiah, M. and Prihandono, B., 2016, Aplikasi Model Jukes Cantor dalam Menentukan Peluang Basa Nitrogen Keturunan Suatu Individu, BIMASTER: Buletin Ilmiah Matematika, Statistika dan Terapannya, Vol. 5: 119 – 128
[17] Hayati, N., Sulistyono, E., Handayani, V. A., 2024, Utilizing Discrete Hidden Markov Model to Analyze Tetraploid Plant Breeding, Jurnal Matematika UNAND, Vol. 13: 244 – 256
[18] Mahmoud, A.S., Hassanain, M. A., Alshibani, A., 2024, Evolving Trends and Innovations in Facilities Management within Higher Education Institutions, Buildings, Vol. 14: 3759
[19] Radebe, S., Ozumba, A. O. U., 2021, Challenges of Implementing Sustainable Facilities Management in Higher Institutions of Learning, IOP Conference Series: Earth and Environmental Science, Vol. 654: 012010, IOP Publishing
[20] Matarneh, S.T., Danso-Amoako, M., Al-Bizri, S., Gaterell, M. Matarneh, R., 2019, Building Information Modeling for Facilities Management: A Literature Review and Future Research Directions, Journal of Building Engineering, Vol. 24: 100755.
[21] Oude Vrielink, R. A., Jansen, E. A., Hans, E. W., van Hillegersberg, J., 2019, Practices in Timetabling in Higher Education Institutions: A Systematic Review, Annals of Operations Research, Vol. 275: 145 – 160
[22] Pillay, Nelishia., 2016, A Review of Hyper-Heuristics for Educational Timetabling, Annals of Operations Research, Vol. 239: 3 – 38
[23] Bhoi, S. B., Dhodiya, J. M., 2022, Multi-Objective University Course Scheduling for Uncertainly Generated Courses, Neural Networks, Machine Learning, and Image Processing, 21 – 32
[24] Sobaszek, L., Gola, A., Kozlowski, E., 2020, Predictive scheduling with Markov chains and ARIMA models, Applied Sciences, Vol. 10: 6121
[25] Zhang, Q., Chen, Z., Yang, L. T., 2015, A Nodes Scheduling Model based on Markov Chain Prediction for Big Streaming Data Analysis, International Journal of Communication Systems, Vol. 28: 1610 – 1619
[26] Ardabili, H. A. R., Haghifam, M. R., Abedi, S. M., 2021, A Stochastic Markov Model for Maintenance Scheduling in The Presence of Online Monitoring System, IEEE Transactions on Power Delivery, Vol. 37: 2831 – 2842
[27] Odhiambo, J., Weke, P. G. O., Ngare, P., Odhiambo, J., Weke, P., 2020, Modeling Kenyan Economic Impact of Corona Virus in Kenya Using Discrete-Time Markov Chains, Journal of Finance and Economics, Vol. 8: 80 – 85
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Departemen Matematika dan Sains Data FMIPA UNAND

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA 4.0). This license allows published content to be freely accessed, shared, redistributed, and adapted for any purpose, including commercial use, provided that the applicable license conditions are followed.
Copyright Holder
The copyright of articles published in Jurnal Matematika UNAND is held by the Departemen Matematika dan Sains Data, Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA), Universitas Andalas (UNAND), in accordance with the journal's stated copyright policy.
Author Rights
Under the CC BY-SA 4.0 license, authors may share, distribute, and reuse their published articles, subject to the applicable license conditions. These rights include:
-
Self-Archiving: Authors may deposit their published articles in institutional repositories, personal websites, or academic platforms.
-
Reuse: Authors may reuse their published work in subsequent publications, research, teaching materials, or other lawful purposes, provided that appropriate attribution is maintained.
-
Distribution: Authors may share and distribute their published articles without requiring additional permission under the terms of the license.
Creative Commons License (CC BY-SA 4.0)
Under the CC BY-SA 4.0 license, users are free to:
-
Share: Copy and redistribute the material in any medium or format.
-
Adapt: Remix, transform, and build upon the material for any purpose, including commercial purposes.
These permissions are subject to the following conditions:
-
Attribution: Users must give appropriate credit to the original author(s), retain relevant copyright notices, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author(s), copyright holder, or journal.
-
ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same CC BY-SA 4.0 license or a compatible license.
-
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from exercising the rights granted by the license.
For more information about the CC BY-SA 4.0 license, please visit:
https://creativecommons.org/licenses/by-sa/4.0/
Third-Party Content
Third-party materials, including figures, tables, photographs, and illustrations, are covered by the article's CC BY-SA 4.0 license only when their inclusion under that license is authorized.
Materials excluded from the license must be clearly identified with appropriate copyright notices and attribution. Authors are responsible for obtaining any necessary permissions, while users must comply with the applicable licensing terms or permissions when reusing excluded materials.
Copyright and Licensing Information
Copyright and licensing information should be clearly displayed on each published article's landing page and included in the full-text versions (HTML and PDF), where applicable, to ensure transparency regarding copyright ownership and permitted reuse.



