{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T22:07:30Z","timestamp":1777586850132,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0305-0548(02)00083-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"1555-1572","source":"Crossref","is-referenced-by-count":59,"title":["Constraint programming approach for school timetabling"],"prefix":"10.1016","volume":"30","author":[{"given":"Christos","family":"Valouxis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Efthymios","family":"Housos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00083-7_BIB1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1006576209967","article-title":"A survey of automated timetabling","volume":"13","author":"Schaerf","year":"1999","journal-title":"Artificial Intelligence Review"},{"key":"10.1016\/S0305-0548(02)00083-7_BIB2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1093\/comjnl\/23.4.307","article-title":"Timetable construction\u2014an annotated bibliography","volume":"23","author":"Schmidt","year":"1979","journal-title":"The Computer Journal"},{"key":"10.1016\/S0305-0548(02)00083-7_BIB3","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1287\/inte.16.4.66","article-title":"Timetabling in Germany","volume":"16","author":"Junginger","year":"1986","journal-title":"Interfaces"},{"key":"10.1016\/S0305-0548(02)00083-7_BIB4","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1057\/palgrave.jors.2600480","article-title":"Timetabling for Greek high schools","volume":"48","author":"Birbas","year":"1997","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(02)00083-7_BIB5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0166-218X(92)90253-7","article-title":"Computerized decision aid for timetabling\u2014a case analysis","volume":"35","author":"Tripathy","year":"1992","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0305-0548(02)00083-7_BIB6","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/S0377-2217(00)00052-7","article-title":"Implementation of a university course and examination timetabling system","volume":"130","author":"Dimopoulou","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00083-7_BIB7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01719788","article-title":"Some experiments with a timetabling system","volume":"3","author":"Ostermann","year":"1983","journal-title":"OR Spectrum"},{"key":"10.1016\/S0305-0548(02)00083-7_BIB8","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\/S0305-0548(02)00083-7_BIB9","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/mnsc.37.1.98","article-title":"Constructing school timetables using simulated annealing","volume":"37","author":"Abramson","year":"1991","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(02)00083-7_BIB10","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 timetable","volume":"76","author":"Costa","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00083-7_BIB11","unstructured":"Schaerf A, Schaerf M. Local search techniques for high school timetabling. Proceedings of the First International Conference on the Practice and Theory of Automated Timetabling, 1995. p. 313\u201323."},{"issue":"4","key":"10.1016\/S0305-0548(02)00083-7_BIB12","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1080\/088395100117016","article-title":"University course timetabling using constraint handling rules","volume":"14","author":"Abdennadher","year":"2000","journal-title":"Journal of Applied Artificial Intelligence"},{"issue":"4","key":"10.1016\/S0305-0548(02)00083-7_BIB13","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1142\/S0218213098000196","article-title":"Nearly optimum timetable construction through CLP and intelligent search","volume":"7","author":"Stamatopoulos","year":"1998","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"10.1016\/S0305-0548(02)00083-7_BIB14","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/0377-2217(92)90360-L","article-title":"A logic approach to the resolution of constraints in timetabling","volume":"61","author":"Kang","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00083-7_BIB15","unstructured":"Yoshikawa M, Kaneko K, Nomura Y, Watanabe M. A constrained based approach to high school timetabling problems: a case study. Proceedings of the 12th National Conference On Artificial Intelligence (AAAI-94), 1994. p. 1111\u20136."},{"issue":"5","key":"10.1016\/S0305-0548(02)00083-7_BIB16","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/inte.27.5.68","article-title":"Automatic subproblem optimization for airline crew scheduling","volume":"27","author":"Housos","year":"1997","journal-title":"Interfaces"},{"key":"10.1016\/S0305-0548(02)00083-7_BIB17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/321941.321942","article-title":"An efficient implementation of Edmonds algorithm for maximum matchings on graphs","volume":"23","author":"Gabow","year":"1975","journal-title":"Journal of ACM"},{"key":"10.1016\/S0305-0548(02)00083-7_BIB18","unstructured":"ILOG. ILOG Solver 4.4 Reference Manual, 1999."},{"key":"10.1016\/S0305-0548(02)00083-7_BIB19","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0305-0548(00)00067-8","article-title":"Combined bus and driver scheduling","volume":"29","author":"Valouxis","year":"2002","journal-title":"Computers and Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000837?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000837?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T09:27:16Z","timestamp":1554974836000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802000837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":19,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0305054802000837"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00083-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}