Cornell University Uses Integer Programming to Optimize Final Exam Scheduling
This paper presents an integer programming-based optimization framework designed to effectively address the complex final exam scheduling challenges encountered at Cornell University. With high flexibility, the framework is specifically tailored to accommodate a variety of different constraints, inc...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2024-09 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Ye, Tinghan Jovine, Adam Willem van Osselaer Zhu, Qihan Shmoys, David |
| description | This paper presents an integer programming-based optimization framework designed to effectively address the complex final exam scheduling challenges encountered at Cornell University. With high flexibility, the framework is specifically tailored to accommodate a variety of different constraints, including the front-loading of large courses and the exclusion of specific time slots during the exam period. By generating multiple scheduling model variants and incorporating heuristic approaches, our framework enables comprehensive comparisons of different schedules. This empowers the University Registrar to make informed decisions, considering trade-offs in terms of schedule comfort measured by different levels of exam conflicts. Our results demonstrate significant advantage over the historical lecture time-based approach, providing time and effort savings for the university administration while enhancing student and faculty satisfaction. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_3102579284</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3102579284</sourcerecordid><originalsourceid>FETCH-proquest_journals_31025792843</originalsourceid><addsrcrecordid>eNqNy80KgkAUQOEhCJLyHS60FnRG09ai1CIKyrUMdbOR-bGZMaqnr0UP0OpsvjMhAWUsiYqU0hkJnevjOKarnGYZC8iuNFajlNBo8UDrhH9B49DBVnvs0MLBms5ypYTuwBvYD14o8UaoheYSqidXcDzf8DLKr1iQ6ZVLh-Gvc7Ksq1O5iQZr7iM63_ZmtN_RtSyJaZavaZGy_9QHqV099Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3102579284</pqid></control><display><type>article</type><title>Cornell University Uses Integer Programming to Optimize Final Exam Scheduling</title><source>Free E- Journals</source><creator>Ye, Tinghan ; Jovine, Adam ; Willem van Osselaer ; Zhu, Qihan ; Shmoys, David</creator><creatorcontrib>Ye, Tinghan ; Jovine, Adam ; Willem van Osselaer ; Zhu, Qihan ; Shmoys, David</creatorcontrib><description>This paper presents an integer programming-based optimization framework designed to effectively address the complex final exam scheduling challenges encountered at Cornell University. With high flexibility, the framework is specifically tailored to accommodate a variety of different constraints, including the front-loading of large courses and the exclusion of specific time slots during the exam period. By generating multiple scheduling model variants and incorporating heuristic approaches, our framework enables comprehensive comparisons of different schedules. This empowers the University Registrar to make informed decisions, considering trade-offs in terms of schedule comfort measured by different levels of exam conflicts. Our results demonstrate significant advantage over the historical lecture time-based approach, providing time and effort savings for the university administration while enhancing student and faculty satisfaction.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Heuristic methods ; Integer programming ; Schedules ; Scheduling ; Time measurement</subject><ispartof>arXiv.org, 2024-09</ispartof><rights>2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>780,784</link.rule.ids></links><search><creatorcontrib>Ye, Tinghan</creatorcontrib><creatorcontrib>Jovine, Adam</creatorcontrib><creatorcontrib>Willem van Osselaer</creatorcontrib><creatorcontrib>Zhu, Qihan</creatorcontrib><creatorcontrib>Shmoys, David</creatorcontrib><title>Cornell University Uses Integer Programming to Optimize Final Exam Scheduling</title><title>arXiv.org</title><description>This paper presents an integer programming-based optimization framework designed to effectively address the complex final exam scheduling challenges encountered at Cornell University. With high flexibility, the framework is specifically tailored to accommodate a variety of different constraints, including the front-loading of large courses and the exclusion of specific time slots during the exam period. By generating multiple scheduling model variants and incorporating heuristic approaches, our framework enables comprehensive comparisons of different schedules. This empowers the University Registrar to make informed decisions, considering trade-offs in terms of schedule comfort measured by different levels of exam conflicts. Our results demonstrate significant advantage over the historical lecture time-based approach, providing time and effort savings for the university administration while enhancing student and faculty satisfaction.</description><subject>Heuristic methods</subject><subject>Integer programming</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Time measurement</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNy80KgkAUQOEhCJLyHS60FnRG09ai1CIKyrUMdbOR-bGZMaqnr0UP0OpsvjMhAWUsiYqU0hkJnevjOKarnGYZC8iuNFajlNBo8UDrhH9B49DBVnvs0MLBms5ypYTuwBvYD14o8UaoheYSqidXcDzf8DLKr1iQ6ZVLh-Gvc7Ksq1O5iQZr7iM63_ZmtN_RtSyJaZavaZGy_9QHqV099Q</recordid><startdate>20240908</startdate><enddate>20240908</enddate><creator>Ye, Tinghan</creator><creator>Jovine, Adam</creator><creator>Willem van Osselaer</creator><creator>Zhu, Qihan</creator><creator>Shmoys, David</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20240908</creationdate><title>Cornell University Uses Integer Programming to Optimize Final Exam Scheduling</title><author>Ye, Tinghan ; Jovine, Adam ; Willem van Osselaer ; Zhu, Qihan ; Shmoys, David</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_31025792843</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Heuristic methods</topic><topic>Integer programming</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Time measurement</topic><toplevel>online_resources</toplevel><creatorcontrib>Ye, Tinghan</creatorcontrib><creatorcontrib>Jovine, Adam</creatorcontrib><creatorcontrib>Willem van Osselaer</creatorcontrib><creatorcontrib>Zhu, Qihan</creatorcontrib><creatorcontrib>Shmoys, David</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ye, Tinghan</au><au>Jovine, Adam</au><au>Willem van Osselaer</au><au>Zhu, Qihan</au><au>Shmoys, David</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Cornell University Uses Integer Programming to Optimize Final Exam Scheduling</atitle><jtitle>arXiv.org</jtitle><date>2024-09-08</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>This paper presents an integer programming-based optimization framework designed to effectively address the complex final exam scheduling challenges encountered at Cornell University. With high flexibility, the framework is specifically tailored to accommodate a variety of different constraints, including the front-loading of large courses and the exclusion of specific time slots during the exam period. By generating multiple scheduling model variants and incorporating heuristic approaches, our framework enables comprehensive comparisons of different schedules. This empowers the University Registrar to make informed decisions, considering trade-offs in terms of schedule comfort measured by different levels of exam conflicts. Our results demonstrate significant advantage over the historical lecture time-based approach, providing time and effort savings for the university administration while enhancing student and faculty satisfaction.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2024-09 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_proquest_journals_3102579284 |
| source | Free E- Journals |
| subjects | Heuristic methods Integer programming Schedules Scheduling Time measurement |
| title | Cornell University Uses Integer Programming to Optimize Final Exam Scheduling |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T19%3A50%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Cornell%20University%20Uses%20Integer%20Programming%20to%20Optimize%20Final%20Exam%20Scheduling&rft.jtitle=arXiv.org&rft.au=Ye,%20Tinghan&rft.date=2024-09-08&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E3102579284%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3102579284&rft_id=info:pmid/&rfr_iscdi=true |