首页    期刊浏览 2025年07月28日 星期一
登录注册

文章基本信息

  • 标题:Optimizing the Assignment of Students to Classes in an Elementary School
  • 本地全文:下载
  • 作者:Binyamin Krauss ; Jon Lee ; Daniel Newman
  • 期刊名称:INFORMS : Transactions on Education
  • 印刷版ISSN:1532-0545
  • 电子版ISSN:1532-0545
  • 出版年度:2013
  • 卷号:14
  • 期号:1
  • DOI:10.1287/ited.2013.0111
  • 出版社:Institute for Operations Research and the Management Sciences
  • 摘要:Every summer, the Salanter Akiba Riverdale (SAR) Academy must create class placements for their elementary school students. Each grade of 80 to 100 students must be divided into four classes. In assigning students to classes, the school administration aims to foster a positive social and educational environment for students while satisfying placement requests and recommendations from parents, teachers, and school therapists. The school must satisfy several constraints such as not placing certain pairs of students in the same class or keeping boy/girl ratios balanced. The process of creating optimal class placements by hand can be laborious and difficult, especially for grades with many constraints to satisfy. This paper describes a model that is being used to assist SAR Academy with creating class placements. Following the constraints and objectives given by administrators at the school, we describe an integer-programming model for satisfying placement constraints and heuristics to further improve on the outputs of the integer-programming model. The results of this process were successfully used to assist administrators in assigning students in one grade for the 2012–13 school year, and SAR Academy plans to use the model for help with future class placements.
  • 关键词:assignment problem ; class assignment ; integer programming ; genetic algorithm
国家哲学社会科学文献中心版权所有