{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T14:28:48Z","timestamp":1699280928470},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1016\/j.ejor.2019.01.026","type":"journal-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T17:08:39Z","timestamp":1547831319000},"page":"422-435","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"title":["Quality recovering of university timetables"],"prefix":"10.1016","volume":"276","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-9672-1608","authenticated-orcid":false,"given":"Michael","family":"Lindahl","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6905-5454","authenticated-orcid":false,"given":"Thomas","family":"Stidsen","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6906-004X","authenticated-orcid":false,"given":"Matias","family":"S\u00f8rensen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2019.01.026_bib0001","series-title":"Proceedings of the international workshop on constraint solving and constraint logic programming","first-page":"233","article-title":"A new approach to modeling and solving minimal perturbation problems","author":"Bart\u00e1k","year":"2003"},{"key":"10.1016\/j.ejor.2019.01.026_bib0002","first-page":"1","article-title":"An overview of curriculum-based course timetabling","volume":"23","author":"Bettinelli","year":"2015","journal-title":"TOP"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.026_bib0003","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10479-010-0707-0","article-title":"Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results","volume":"194","author":"Bonutti","year":"2012","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2019.01.026_bib0004","series-title":"Operations research proceedings 2007","first-page":"409","article-title":"Penalising patterns in timetables: Novel integer programming formulations","volume":"2007","author":"Burke","year":"2008"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.026_bib0005","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10479-010-0716-z","article-title":"A supernodal formulation of vertex colouring with application in course timetabling","volume":"179","author":"Burke","year":"2010","journal-title":"Annals of Operations Research"},{"issue":"10","key":"10.1016\/j.ejor.2019.01.026_bib0006","doi-asserted-by":"crossref","first-page":"2466","DOI":"10.1016\/j.cor.2013.02.010","article-title":"A new lower bound for curriculum-based course timetabling","volume":"40","author":"Cacchiani","year":"2013","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2019.01.026_bib0007","series-title":"Technical Report","article-title":"The Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling (Track 3)","author":"Di Gaspero","year":"2007"},{"key":"10.1016\/j.ejor.2019.01.026_bib0008","series-title":"Practice and theory of automated timetabling iv","first-page":"39","article-title":"Solving dynamic resource constraint project scheduling problems using new constraint programming tools","volume":"2740","author":"Elkhyari","year":"2003"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.026_bib0009","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0305-0548(85)90045-0","article-title":"Timetabling problem for university as assignment of activities to resources","volume":"12","author":"Ferland","year":"1985","journal-title":"Computers & operations research"},{"key":"10.1016\/j.ejor.2019.01.026_bib0010","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","article-title":"Local branching","volume":"98","author":"Fischetti","year":"2003","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2019.01.026_bib0011","series-title":"Proceedings of the international conference on principles and practice of constraint programming","first-page":"331","article-title":"An improved search algorithm for min-perturbation","author":"Fukunaga","year":"2013"},{"key":"10.1016\/j.ejor.2019.01.026_bib0012","first-page":"296","article-title":"On a bicriteria formulation of the problems of the integrated system identification and system optimization","author":"Haimes","year":"1971","journal-title":"IEEE Transaction on Systems, Man, and Cybernetics, SMC-1"},{"key":"10.1016\/j.ejor.2019.01.026_bib0013","series-title":"SICS Research Report","article-title":"Dynamic scheduling. state of the art report","author":"Kocjan","year":"2002"},{"key":"10.1016\/j.ejor.2019.01.026_bib0014","series-title":"Experimental algorithms","first-page":"235","article-title":"Optimal university course timetables and the partial transversal polytope","volume":"5038","author":"Lach","year":"2008"},{"key":"10.1016\/j.ejor.2019.01.026_bib0015","series-title":"Practice and theory of automated timetabling v","first-page":"126","article-title":"Minimal perturbation problem in course timetabling","volume":"3616","author":"M\u00fcller","year":"2005"},{"key":"10.1016\/j.ejor.2019.01.026_bib0016","first-page":"1","article-title":"Integer programming for minimal perturbation problems in university course timetabling","volume":"252","author":"Phillips","year":"2016","journal-title":"Annals of Operations Research"},{"issue":"0","key":"10.1016\/j.ejor.2019.01.026_bib0017","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.cor.2014.07.012","article-title":"Integer programming methods for large-scale practical classroom assignment problems","volume":"53","author":"Phillips","year":"2015","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.026_bib0018","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10951-010-0171-3","article-title":"Complex university course timetabling","volume":"14","author":"Rudov\u00e1","year":"2011","journal-title":"Journal of Scheduling"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.026_bib0019","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1023\/A:1009856210543","article-title":"Probe backtrack search for minimal perturbation in dynamic scheduling","volume":"5","author":"Sakkout","year":"2000","journal-title":"Constraints"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.026_bib0020","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10601-005-2239-9","article-title":"Constraint solving in uncertain and dynamic environments: A survey","volume":"10","author":"Verfaillie","year":"2005","journal-title":"Constraints"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.026_bib0021","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/s10601-011-9108-5","article-title":"Hybrid search for minimal perturbation in dynamic CSPs","volume":"16","author":"Zivan","year":"2011","journal-title":"Constraints"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300451?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300451?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T12:29:51Z","timestamp":1551961791000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221719300451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["S0377221719300451"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2019.01.026","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2019,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Quality recovering of university timetables","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2019.01.026","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}