IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v42y2012i5p437-448.html
   My bibliography  Save this article

iSchedule to Personalize Learning

Author

Listed:
  • Anjuli Kannan

    (Analytics Operations Engineering, Inc., Boston, Massachusetts 02109)

  • Gerald van den Berg

    (Analytics Operations Engineering, Inc., Boston, Massachusetts 02109)

  • Adeline Kuo

    (Analytics Operations Engineering, Inc., Boston, Massachusetts 02109)

Abstract

The New York City public school system needed a new tool that would generate schedules for a set of experimental schools. These schools focus on individualized instruction, making the scheduling problem challenging and novel. In particular, the educators in these schools wanted to create master schedules that could accommodate each student's specific needs while satisfying teacher and other resource constraints. We took a graph-theoretic approach to this problem by developing an algorithm that breaks it into a series of subproblems and applies randomized direct heuristics. Educators have multiple competing objectives with trade-offs that they cannot quantify precisely; therefore, our solution generates a diverse set of schedules that they can compare, combine, and change, before ultimately choosing one schedule to use. Prior to our engagement, school administrators spent approximately eight weeks each year manually generating schedules, a time commitment that was likely to grow as school enrollment increased. Our tool, iSchedule, generated a far richer set of feasible schedules, allowing administrators to focus on satisfying individual student needs. It also reduced the time required to generate a complete schedule to about two weeks.

Suggested Citation

  • Anjuli Kannan & Gerald van den Berg & Adeline Kuo, 2012. "iSchedule to Personalize Learning," Interfaces, INFORMS, vol. 42(5), pages 437-448, October.
  • Handle: RePEc:inm:orinte:v:42:y:2012:i:5:p:437-448
    DOI: 10.1287/inte.1120.0643
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1120.0643
    Download Restriction: no

    File URL: https://libkey.io/10.1287/inte.1120.0643?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. D. Abramson, 1991. "Constructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms," Management Science, INFORMS, vol. 37(1), pages 98-113, January.
    2. Burke, Edmund K. & McCollum, Barry & Meisels, Amnon & Petrovic, Sanja & Qu, Rong, 2007. "A graph-based hyper-heuristic for educational timetabling problems," European Journal of Operational Research, Elsevier, vol. 176(1), pages 177-192, January.
    3. Werner Junginger, 1986. "Timetabling in Germany---A Survey," Interfaces, INFORMS, vol. 16(4), pages 66-74, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ahmed Kheiri & Ender Özcan & Andrew J. Parkes, 2016. "A stochastic local search algorithm with adaptive acceptance for high-school timetabling," Annals of Operations Research, Springer, vol. 239(1), pages 135-151, April.
    2. Aslan, Ayse & Ursavas, Evrim & Romeijnders, Ward, 2023. "A Precedence Constrained Knapsack Problem with Uncertain Item Weights for Personalized Learning Systems," Omega, Elsevier, vol. 115(C).
    3. Aslan, Ayse & Bakir, Ilke & Vis, Iris F.A., 2020. "A dynamic thompson sampling hyper-heuristic framework for learning activity planning in personalized learning," European Journal of Operational Research, Elsevier, vol. 286(2), pages 673-688.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nelishia Pillay, 2014. "A survey of school timetabling research," Annals of Operations Research, Springer, vol. 218(1), pages 261-293, July.
    2. R. A. Oude Vrielink & E. A. Jansen & E. W. Hans & J. Hillegersberg, 2019. "Practices in timetabling in higher education institutions: a systematic review," Annals of Operations Research, Springer, vol. 275(1), pages 145-160, April.
    3. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    4. Zhang, Defu & Liu, Yongkai & M'Hallah, Rym & Leung, Stephen C.H., 2010. "A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems," European Journal of Operational Research, Elsevier, vol. 203(3), pages 550-558, June.
    5. Drexl, Andreas & Salewski, Frank, 1997. "Distribution requirements and compactness constraints in school timetabling," European Journal of Operational Research, Elsevier, vol. 102(1), pages 193-214, October.
    6. Schirmer, Andreas & Potzhar, Kathrin, 2001. "Professional course scheduling in airline transport pilot training: A case from Lufthansa flight training," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 539, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. Carlos Contreras Bolton & Gustavo Gatica & Víctor Parada, 2013. "Automatically Generated Algorithms for the Vertex Coloring Problem," PLOS ONE, Public Library of Science, vol. 8(3), pages 1-9, March.
    8. Jacek Blazewicz & Edmund Burke & Graham Kendall & Wojciech Mruczkiewicz & Ceyda Oguz & Aleksandra Swiercz, 2013. "A hyper-heuristic approach to sequencing by hybridization of DNA sequences," Annals of Operations Research, Springer, vol. 207(1), pages 27-41, August.
    9. Song, Kwonsik & Kim, Sooyoung & Park, Moonseo & Lee, Hyun-Soo, 2017. "Energy efficiency-based course timetabling for university buildings," Energy, Elsevier, vol. 139(C), pages 394-405.
    10. R. Alan Bowman, 2021. "Developing Optimal Student Plans of Study," Interfaces, INFORMS, vol. 51(6), pages 409-421, November.
    11. Gerhard Post & Samad Ahmadi & Sophia Daskalaki & Jeffrey Kingston & Jari Kyngas & Cimmo Nurmi & David Ranson, 2012. "An XML format for benchmarks in High School Timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 385-397, April.
    12. Massimiliano Caramia & Stefano Giordani, 2020. "Curriculum-Based Course Timetabling with Student Flow, Soft Constraints, and Smoothing Objectives: an Application to a Real Case Study," SN Operations Research Forum, Springer, vol. 1(2), pages 1-21, June.
    13. Z.H. Che, 2012. "A hybrid algorithm for fuzzy clustering," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 6(1), pages 50-67.
    14. De Causmaecker, Patrick & Demeester, Peter & Vanden Berghe, Greet, 2009. "A decomposed metaheuristic approach for a real-world university timetabling problem," European Journal of Operational Research, Elsevier, vol. 195(1), pages 307-318, May.
    15. Haase, Knut & Latteier, Jörg & Schirmer, Andreas, 1997. "The course scheduling problem at Lufthansa Technical Training," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 441, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    16. Zhang Lihao & Ye Zeyang & Deng Yuefan, 2019. "Parallel MCMC methods for global optimization," Monte Carlo Methods and Applications, De Gruyter, vol. 25(3), pages 227-237, September.
    17. R Bai & E K Burke & G Kendall, 2008. "Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(10), pages 1387-1397, October.
    18. Haase, Knut & Latteier, Jörg & Schirmer, Andreas, 1997. "Course planning at Lufthansa technical training: Constructing more profitable schedules," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 442, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. Christine Mumford, 2010. "A multiobjective framework for heavily constrained examination timetabling problems," Annals of Operations Research, Springer, vol. 180(1), pages 3-31, November.
    20. R Qu & E K Burke, 2009. "Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1273-1285, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orinte:v:42:y:2012:i:5:p:437-448. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.