A Linear Solution for the University Timetabling Problem
The university timetabling problem deals with scheduling courses and determining the lecturer and the location of each course in a semester. This problem belongs to NP-hard problems, which means that solving the problem requires smart algorithms. In this paper, we propose a linear formulation of the...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 57 |
|---|---|
| container_issue | |
| container_start_page | 54 |
| container_title | |
| container_volume | 2 |
| creator | Davoudzadeh, M. Rafeh, R. Rashidi, R. |
| description | The university timetabling problem deals with scheduling courses and determining the lecturer and the location of each course in a semester. This problem belongs to NP-hard problems, which means that solving the problem requires smart algorithms. In this paper, we propose a linear formulation of the problem which has been implemented using the GLPG modeling language. |
| doi_str_mv | 10.1109/ICCEE.2009.131 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5380143</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5380143</ieee_id><sourcerecordid>5380143</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-7bcc2737b87972fd7c7ec83a18172d3fb189abe60dd2c58cfd65110482b0d79a3</originalsourceid><addsrcrecordid>eNotj8tKw0AYRkekoK3ZunEzL5A41_wzyxKiFgIKtusyt-hILjIZhb69Ff02Z3M48CF0S0lFKdH3u6Zp24oRoivK6QVaE6i15JpJcYkKDYoKJoTktVQrtP71tCC11leoWJYPcp6QjAt2jdQWd3EKJuHXefjKcZ5wPyec3wM-TPE7pCXmE97HMWRjhzi94Zc02yGMN2jVm2EJxT836PDQ7punsnt-3DXbrowUZC7BOseAg1WggfUeHASnuKGKAvO8t1RpY0NNvGdOKtf7Wp4vCsUs8aAN36C7v24MIRw_UxxNOh0lV4QKzn8Ah8NI1A</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Linear Solution for the University Timetabling Problem</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Davoudzadeh, M. ; Rafeh, R. ; Rashidi, R.</creator><creatorcontrib>Davoudzadeh, M. ; Rafeh, R. ; Rashidi, R.</creatorcontrib><description>The university timetabling problem deals with scheduling courses and determining the lecturer and the location of each course in a semester. This problem belongs to NP-hard problems, which means that solving the problem requires smart algorithms. In this paper, we propose a linear formulation of the problem which has been implemented using the GLPG modeling language.</description><identifier>ISBN: 9781424453658</identifier><identifier>ISBN: 1424453658</identifier><identifier>EISBN: 0769539254</identifier><identifier>EISBN: 9780769539256</identifier><identifier>DOI: 10.1109/ICCEE.2009.131</identifier><identifier>LCCN: 2009940699</identifier><language>eng</language><publisher>IEEE</publisher><subject>Constraint optimization ; DNA sequences ; Educational institutions ; Genetic algorithms ; Human Identification ; Linear programming ; Neural Network ; NP-hard problem ; Processor scheduling ; Programming profession ; Simulated annealing</subject><ispartof>2009 Second International Conference on Computer and Electrical Engineering, 2009, Vol.2, p.54-57</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5380143$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5380143$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Davoudzadeh, M.</creatorcontrib><creatorcontrib>Rafeh, R.</creatorcontrib><creatorcontrib>Rashidi, R.</creatorcontrib><title>A Linear Solution for the University Timetabling Problem</title><title>2009 Second International Conference on Computer and Electrical Engineering</title><addtitle>ICCEE</addtitle><description>The university timetabling problem deals with scheduling courses and determining the lecturer and the location of each course in a semester. This problem belongs to NP-hard problems, which means that solving the problem requires smart algorithms. In this paper, we propose a linear formulation of the problem which has been implemented using the GLPG modeling language.</description><subject>Constraint optimization</subject><subject>DNA sequences</subject><subject>Educational institutions</subject><subject>Genetic algorithms</subject><subject>Human Identification</subject><subject>Linear programming</subject><subject>Neural Network</subject><subject>NP-hard problem</subject><subject>Processor scheduling</subject><subject>Programming profession</subject><subject>Simulated annealing</subject><isbn>9781424453658</isbn><isbn>1424453658</isbn><isbn>0769539254</isbn><isbn>9780769539256</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj8tKw0AYRkekoK3ZunEzL5A41_wzyxKiFgIKtusyt-hILjIZhb69Ff02Z3M48CF0S0lFKdH3u6Zp24oRoivK6QVaE6i15JpJcYkKDYoKJoTktVQrtP71tCC11leoWJYPcp6QjAt2jdQWd3EKJuHXefjKcZ5wPyec3wM-TPE7pCXmE97HMWRjhzi94Zc02yGMN2jVm2EJxT836PDQ7punsnt-3DXbrowUZC7BOseAg1WggfUeHASnuKGKAvO8t1RpY0NNvGdOKtf7Wp4vCsUs8aAN36C7v24MIRw_UxxNOh0lV4QKzn8Ah8NI1A</recordid><startdate>200912</startdate><enddate>200912</enddate><creator>Davoudzadeh, M.</creator><creator>Rafeh, R.</creator><creator>Rashidi, R.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200912</creationdate><title>A Linear Solution for the University Timetabling Problem</title><author>Davoudzadeh, M. ; Rafeh, R. ; Rashidi, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-7bcc2737b87972fd7c7ec83a18172d3fb189abe60dd2c58cfd65110482b0d79a3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Constraint optimization</topic><topic>DNA sequences</topic><topic>Educational institutions</topic><topic>Genetic algorithms</topic><topic>Human Identification</topic><topic>Linear programming</topic><topic>Neural Network</topic><topic>NP-hard problem</topic><topic>Processor scheduling</topic><topic>Programming profession</topic><topic>Simulated annealing</topic><toplevel>online_resources</toplevel><creatorcontrib>Davoudzadeh, M.</creatorcontrib><creatorcontrib>Rafeh, R.</creatorcontrib><creatorcontrib>Rashidi, R.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Davoudzadeh, M.</au><au>Rafeh, R.</au><au>Rashidi, R.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Linear Solution for the University Timetabling Problem</atitle><btitle>2009 Second International Conference on Computer and Electrical Engineering</btitle><stitle>ICCEE</stitle><date>2009-12</date><risdate>2009</risdate><volume>2</volume><spage>54</spage><epage>57</epage><pages>54-57</pages><isbn>9781424453658</isbn><isbn>1424453658</isbn><eisbn>0769539254</eisbn><eisbn>9780769539256</eisbn><abstract>The university timetabling problem deals with scheduling courses and determining the lecturer and the location of each course in a semester. This problem belongs to NP-hard problems, which means that solving the problem requires smart algorithms. In this paper, we propose a linear formulation of the problem which has been implemented using the GLPG modeling language.</abstract><pub>IEEE</pub><doi>10.1109/ICCEE.2009.131</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9781424453658 |
| ispartof | 2009 Second International Conference on Computer and Electrical Engineering, 2009, Vol.2, p.54-57 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_5380143 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Constraint optimization DNA sequences Educational institutions Genetic algorithms Human Identification Linear programming Neural Network NP-hard problem Processor scheduling Programming profession Simulated annealing |
| title | A Linear Solution for the University Timetabling Problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T00%3A17%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20Linear%20Solution%20for%20the%20University%20Timetabling%20Problem&rft.btitle=2009%20Second%20International%20Conference%20on%20Computer%20and%20Electrical%20Engineering&rft.au=Davoudzadeh,%20M.&rft.date=2009-12&rft.volume=2&rft.spage=54&rft.epage=57&rft.pages=54-57&rft.isbn=9781424453658&rft.isbn_list=1424453658&rft_id=info:doi/10.1109/ICCEE.2009.131&rft_dat=%3Cieee_6IE%3E5380143%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=0769539254&rft.eisbn_list=9780769539256&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5380143&rfr_iscdi=true |