{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T15:37:52Z","timestamp":1732030672874},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0377-2217(97)00097-0","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"585-603","source":"Crossref","is-referenced-by-count":19,"title":["Constructing a course schedule by solving a series of assignment type problems"],"prefix":"10.1016","volume":"108","author":[{"given":"Alain","family":"Hertz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Robert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00097-0_bib1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1137\/0220012","article-title":"Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs","volume":"20","author":"Balas","year":"1991","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0377-2217(97)00097-0_bib2","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.14.1.52","article-title":"Scheduling to minimize interaction cost","volume":"14","author":"Carlson","year":"1966","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00097-0_bib3","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0377-2217(92)90077-M","article-title":"A survey of algorithms for the generalized assignment problem","volume":"60","author":"Cattrysse","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00097-0_bib4","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/0377-2217(94)90009-4","article-title":"A tabu search algorithm for computing an operational time table","volume":"76","author":"Costa","year":"1994","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0377-2217(97)00097-0_bib5","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(97)00097-0_bib6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-218X(92)90247-8","article-title":"Exchanges procedures for timetabling problems","volume":"35","author":"Ferland","year":"1992","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00097-0_bib7","series-title":"Report ORWP 94\/03","article-title":"An object oriented methodology for solving assignment type problems with neighborhood search techniques","author":"Ferland","year":"1994"},{"key":"10.1016\/S0377-2217(97)00097-0_bib8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02243141","article-title":"STABULUS: A technique for finding stable sets in large graphs with tabu search","volume":"42","author":"Friden","year":"1989","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(97)00097-0_bib9","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0305-0548(90)90048-C","article-title":"TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph","volume":"17","author":"Friden","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00097-0_bib10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0377-2217(81)90279-4","article-title":"A computer timetabling system for secondary schools in the Netherlands","volume":"7","author":"de Gans","year":"1981","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00097-0_bib11","series-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(97)00097-0_bib12","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02023002","article-title":"Solving the maximum clique problem using a tabu search approach","volume":"41","author":"Gendreau","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(97)00097-0_bib13","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search, part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00097-0_bib14","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search, part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"10.1016\/S0377-2217(97)00097-0_bib15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0377-2217(91)90321-L","article-title":"Tabu search for large scale timetabling problems","volume":"54","author":"Hertz","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00097-0_bib16","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(92)90248-9","article-title":"Finding a feasible course schedule using tabu search","volume":"35","author":"Hertz","year":"1992","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00097-0_bib17","article-title":"An exact algorithm for the stable set problem","author":"Mannino","year":"1992","journal-title":"IASI-CNR Report No. 334"},{"key":"10.1016\/S0377-2217(97)00097-0_bib18","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0377-2217(82)90012-1","article-title":"A classroom\/time assignment model","volume":"9","author":"Mulvey","year":"1982","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00097-0_bib19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01580430","article-title":"A branch and bound algorithm for the generalized assignment problem","volume":"8","author":"Ross","year":"1975","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00097-0_bib20","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1057\/jors.1980.116","article-title":"A Lagrangian relaxation approach to course scheduling","volume":"31","author":"Tripathy","year":"1980","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00097-0_bib21","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 Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00097-0_bib22","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01720782","article-title":"Tabu search techniques: A tutorial and an application to neural networks","volume":"11","author":"de Werra","year":"1989","journal-title":"OR Spektrum"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797000970?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797000970?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T12:57:18Z","timestamp":1556110638000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797000970"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0377221797000970"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00097-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}