{"ID":6536164,"CreatedAt":"2026-07-14T01:21:01.169441415Z","UpdatedAt":"2026-07-15T03:28:55.185153975Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2607.10641","arxiv_id":"2607.10641","title":"Optimal class scheduling with minimum distributed vacant seats using binary linear programming","abstract":"In this paper, we propose a mathematical model for class scheduling using binary linear programming with the aims to automate the tedious task and to minimize the leftover seats distributed over all the classrooms. A case study at the Department of Mathematics, King Mongkut's University of Technology Thonburi (KMUTT), Thailand, is also presented. The result from our model is shown to have improved significantly over the current manual scheduling method.","short_abstract":"In this paper, we propose a mathematical model for class scheduling using binary linear programming with the aims to automate the tedious task and to minimize the leftover seats distributed over all the classrooms. A case study at the Department of Mathematics, King Mongkut's University of Technology Thonburi (KMUTT),...","url_abs":"https://arxiv.org/abs/2607.10641","url_pdf":"https://arxiv.org/pdf/2607.10641v1","authors":"[\"Ohmchana Klinsod\",\"Parin Chaipunya\"]","published":"2026-07-12T08:14:31Z","proceeding":"math.OC","tasks":"[\"math.OC\"]","methods":"[]","has_code":false}