{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T14:27:47Z","timestamp":1680445667675},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7808,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0166-218x(92)90243-4","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T18:04:08Z","timestamp":1034273048000},"page":"177-195","source":"Crossref","is-referenced-by-count":3,"title":["Modelling and solving an acyclic multi-period timetabling problem"],"prefix":"10.1016","volume":"35","author":[{"given":"Mirjana","family":"\u010cangalovi\u0107","sequence":"first","affiliation":[]},{"given":"Jan A.M.","family":"Schreuder","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90243-4_BIB1","series-title":"Advances in Project Scheduling","first-page":"113","article-title":"Heuristic algorithms for resource-constrained project scheduling: a review and an empirical analysis","author":"Olaguibel","year":"1989"},{"key":"10.1016\/0166-218X(92)90243-4_BIB2","series-title":"Ph.D. Thesis","article-title":"Some new combinatorial optimization algorithms applied to timetabling problems","author":"\u010cangalovic","year":"1989"},{"key":"10.1016\/0166-218X(92)90243-4_BIB3","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0377-2217(91)90254-S","article-title":"Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different length","volume":"51","author":"\u010cangolovic","year":"1991","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(92)90243-4_BIB4","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0377-2217(89)90269-5","article-title":"An interactive system for constructing timetables on a PC","volume":"40","author":"Chahal","year":"1989","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(92)90243-4_BIB5","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/363958.363986","article-title":"Tests on computer method for constructing school timetables","volume":"7","author":"Csima","year":"1964","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(92)90243-4_BIB6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","article-title":"An introduction to timetabling","volume":"19","author":"de Werra","year":"1985","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(92)90243-4_BIB7","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1057\/jors.1987.132","article-title":"Combinatorial optimization problems with soft and hard requirements","volume":"38","author":"Eiselt","year":"1987","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0166-218X(92)90243-4_BIB8","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90243-4_BIB9","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0305-0548(84)90036-4","article-title":"Examination timetabling by computer","volume":"11","author":"Laporte","year":"1984","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/0166-218X(92)90243-4_BIB10","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1093\/comjnl\/23.4.307","article-title":"Timetable construction \u2014 an annoted bibliography","volume":"23","author":"Schmidt","year":"1979","journal-title":"Comput. J."},{"key":"10.1016\/0166-218X(92)90243-4_BIB11","series-title":"Operational Research '84","first-page":"601","article-title":"Timetables in Dutch High Schools","author":"Schreuder","year":"1984"},{"key":"10.1016\/0166-218X(92)90243-4_BIB12","doi-asserted-by":"crossref","first-page":"1473","DOI":"10.1287\/mnsc.30.12.1473","article-title":"School timetabling \u2014 a case in large binary integer linear programming","volume":"30","author":"Tripathy","year":"1984","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(92)90243-4_BIB13","series-title":"Optimization and Control of Dynamic Operational Research Models","first-page":"105","article-title":"Modelling and control of dynamic resource allocation project scheduling systems","author":"Weglarz","year":"1982"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92902434?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92902434?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T17:23:41Z","timestamp":1555176221000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92902434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["0166218X92902434"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90243-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}