{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:34:23Z","timestamp":1740123263004,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T00:00:00Z","timestamp":1508112000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ftirma Kurumu","doi-asserted-by":"crossref","award":["214M661"],"award-info":[{"award-number":["214M661"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10479-017-2646-5","type":"journal-article","created":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T20:58:00Z","timestamp":1508187480000},"page":"101-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Search algorithms for improving the pareto front in a timetabling problem with a solution network-based robustness measure"],"prefix":"10.1007","volume":"275","author":[{"given":"G\u00fclcin","family":"Ermis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1932-7826","authenticated-orcid":false,"given":"Can","family":"Akkan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,16]]},"reference":[{"key":"2646_CR1","doi-asserted-by":"publisher","unstructured":"Akkan, C., & Ermis, G. (2017). Data set for a timetabling problem with a solution network-based robustness measure. \n                    https:\/\/www.researchgate.net\/publication\/317823811\n                    \n                  , doi:\n                    10.13140\/RG.2.2.13165.18407","DOI":"10.13140\/RG.2.2.13165.18407"},{"issue":"2","key":"2646_CR2","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1016\/j.ejor.2015.08.047","volume":"249","author":"C Akkan","year":"2016","unstructured":"Akkan, C., Erdem K\u00fcl\u00fcnk, M., & Kocas, C. (2016). Finding robust timetables for project presentations of student teams. European Journal of Operational Research, 249(2), 560\u2013576. doi:\n                    10.1016\/j.ejor.2015.08.047\n                    \n                  .","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2646_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/EVCO_a_00009","volume":"19","author":"J Bader","year":"2011","unstructured":"Bader, J., & Zitzler, E. (2011). HypE : An algorithm for fast hypervolume-based many-objective optimization. Evolutionary Computation, 19(1), 45\u201376.","journal-title":"Evolutionary Computation"},{"issue":"1","key":"2646_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.sorms.2010.07.001","volume":"16","author":"MO Ball","year":"2011","unstructured":"Ball, M. O. (2011). Heuristics based on mathematical programming. Surveys in Operations Research and Management Science, 16(1), 21\u201338. doi:\n                    10.1016\/j.sorms.2010.07.001\n                    \n                  .","journal-title":"Surveys in Operations Research and Management Science"},{"key":"2646_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-016-2174-8","author":"C Bayliss","year":"2016","unstructured":"Bayliss, C., Maere, G. D., Atkin, J. A. D., & Paelinck, M. (2016). A simulation scenario based mixed integer programming approach to airline reserve crew scheduling under uncertainty. Annals of Operations Research,. doi:\n                    10.1007\/s10479-016-2174-8\n                    \n                  .","journal-title":"Annals of Operations Research"},{"key":"2646_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10479-009-0590-8","volume":"196","author":"EK Burke","year":"2012","unstructured":"Burke, E. K., Li, J., & Qu, R. (2012). A pareto-based search methodology for multi-objective nurse scheduling. Annals of Operations Research, 196, 91\u2013109. doi:\n                    10.1007\/s10479-009-0590-8\n                    \n                  .","journal-title":"Annals of Operations Research"},{"key":"2646_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10479-014-1663-x","volume":"246","author":"D Canca","year":"2016","unstructured":"Canca, D., Barrena, E., Laporte, G., & Ortega, F. A. (2016). A short-turning policy for the management of demand disruptions in rapid transit systems. Annals of Operations Research, 246, 145\u2013166. doi:\n                    10.1007\/s10479-014-1663-x\n                    \n                  .","journal-title":"Annals of Operations Research"},{"issue":"2","key":"2646_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.sorms.2015.08.001","volume":"20","author":"S Chand","year":"2015","unstructured":"Chand, S., & Wagner, M. (2015). Evolutionary many-objective optimization: A quick-start guide. Surveys in Operations Research and Management Science, 20(2), 35\u201342. doi:\n                    10.1016\/j.sorms.2015.08.001\n                    \n                  .","journal-title":"Surveys in Operations Research and Management Science"},{"key":"2646_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-015-2090-3","author":"O Czibula","year":"2015","unstructured":"Czibula, O., Gu, H., Russell, A., & Zinder, Y. (2015). A multi-stage IP-based heuristic for class timetabling and trainer rostering. Annals of Operations Research,. doi:\n                    10.1007\/s10479-015-2090-3\n                    \n                  .","journal-title":"Annals of Operations Research"},{"issue":"4","key":"2646_CR10","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb, K., & Jain, H. (2014). An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraints. IEEE Transactions on Evolutionary Computation, 18(4), 577\u2013601. doi:\n                    10.1109\/TEVC.2013.2281535\n                    \n                  .","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"2646_CR11","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182\u2013197.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"2646_CR12","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10479-012-1235-x","volume":"218","author":"F Della Croce","year":"2014","unstructured":"Della Croce, F., & Salassa, F. (2014). A variable neighborhood search based matheuristic for nurse rostering problems. Annals of Operations Research, 218(1), 185\u2013199. doi:\n                    10.1007\/s10479-012-1235-x\n                    \n                  .","journal-title":"Annals of Operations Research"},{"key":"2646_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10479-010-0809-8","volume":"194","author":"U Dorndorf","year":"2012","unstructured":"Dorndorf, U., Jaehn, F., & Pesch, E. (2012). Flight gate scheduling with respect to a reference schedule. Annals of Operations Research, 194, 177\u2013187. doi:\n                    10.1007\/s10479-010-0809-8\n                    \n                  .","journal-title":"Annals of Operations Research"},{"key":"2646_CR14","doi-asserted-by":"publisher","unstructured":"Dorneles, \u00c1. P., De Ara\u00fajo, O. C. B., & Buriol, L. S. (2014). A fix-and-optimize heuristic for the high school timetabling problem. Computers and Operations Research 52(PART A), 29\u201338. doi:\n                    10.1016\/j.cor.2014.06.023","DOI":"10.1016\/j.cor.2014.06.023"},{"key":"2646_CR15","unstructured":"Fonseca, C. M., & Fleming, P. J. (1993). Genetic algorithms for multiobjective optimization: formulation, disscussion and generalization. In: Proceedings of the fifth international conference on genetic algorithms, San Mateo, California, pp 416\u2013423"},{"key":"2646_CR16","unstructured":"Fourman, M. (1985). Compaction of symbolic layout using genetic algorithms. In: Proceedings of the 1st international conference on genetic algorithms, pp. 141\u2013153"},{"issue":"1","key":"2646_CR17","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.ejor.2006.06.010","volume":"181","author":"MJ Geiger","year":"2007","unstructured":"Geiger, M. J. (2007). On operators and search space topology in multi-objective flow shop scheduling. European Journal of Operational Research, 181(1), 195\u2013206. doi:\n                    10.1016\/j.ejor.2006.06.010\n                    \n                  .","journal-title":"European Journal of Operational Research"},{"key":"2646_CR18","doi-asserted-by":"publisher","unstructured":"Giagkiozis, I., Purshouse, R. C., & Fleming, P. J. (2013). An overview of population-based algorithms for multi-objective optimisation. International Journal of Systems Science pp 1\u201328, doi:\n                    10.1080\/00207721.2013.823526","DOI":"10.1080\/00207721.2013.823526"},{"key":"2646_CR19","volume-title":"Genetic algorithms in search. Optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, D. E. (1989). Genetic algorithms in search. Optimization and machine learning. Boston: Addison-Wesley."},{"issue":"8","key":"2646_CR20","doi-asserted-by":"publisher","first-page":"1599","DOI":"10.1007\/s10951-007-0010-3","volume":"42","author":"W Herroelen","year":"2004","unstructured":"Herroelen, W., & Leus, R. (2004). Robust and reactive project scheduling: A review and classification of procedures. IIE Transactions, 42(8), 1599\u20131620. doi:\n                    10.1007\/s10951-007-0010-3\n                    \n                  .","journal-title":"IIE Transactions"},{"issue":"4","key":"2646_CR21","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1109\/TEVC.2013.2281534","volume":"18","author":"H Jain","year":"2014","unstructured":"Jain, H., & Deb, K. (2014). An evolutionary many-objective optimization algorithm using reference-point based non-dominated sorting approach, part II: Handling constraints and extending to an adaptive approach. IEEE Transactions on Evolutionary Computation, 18(4), 602\u2013622. doi:\n                    10.1109\/TEVC.2013.2281534\n                    \n                  .","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"2646_CR22","doi-asserted-by":"publisher","unstructured":"Kiefer, A., Hartl, L. F., & Schnell, A. (2016). Adaptive large neighborhood search for the curriculum-based course timetabling problem. Annals of Operations Research S.I. : PATAT 2014. doi:\n                    10.1007\/s10479-016-2151-2","DOI":"10.1007\/s10479-016-2151-2"},{"key":"2646_CR23","volume-title":"Matheuristics: Hybridizing metaheuristics and mathematical programming. OR\/CS Interface Series","author":"V Maniezzo","year":"2009","unstructured":"Maniezzo, V., St\u00fctzle, T., & Voss, S. (2009). Matheuristics: Hybridizing metaheuristics and mathematical programming. OR\/CS Interface Series. Heidelberg: Springer."},{"key":"2646_CR24","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-008-0490-3","volume":"180","author":"CL Mumford","year":"2010","unstructured":"Mumford, C. L. (2010). A multiobjective framework for heavily constrained examination timetabling problems. Annals of Operations Research, 180, 3\u201331. doi:\n                    10.1007\/s10479-008-0490-3\n                    \n                  .","journal-title":"Annals of Operations Research"},{"key":"2646_CR25","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10479-007-0202-4","volume":"155","author":"D Parr","year":"2007","unstructured":"Parr, D., & Thompson, J. (2007). Solving the multi-objective nurse scheduling problem with a weighted cost function. Annals of Operations Research, 155, 279\u2013288. doi:\n                    10.1007\/s10479-007-0202-4\n                    \n                  .","journal-title":"Annals of Operations Research"},{"key":"2646_CR26","doi-asserted-by":"publisher","first-page":"365384","DOI":"10.1007\/s10479-010-0808-9","volume":"194","author":"S Petrovic","year":"2012","unstructured":"Petrovic, S., & Vanden\u00a0Berghe, G. (2012). A comparison of two approaches to nurse rostering problems. Annals of Operations Research, 194, 365384. doi:\n                    10.1007\/s10479-010-0808-9\n                    \n                  .","journal-title":"Annals of Operations Research"},{"issue":"2","key":"2646_CR27","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1080\/09511920802209033","volume":"22","author":"I Sabuncuoglu","year":"2009","unstructured":"Sabuncuoglu, I., & Goren, S. (2009). Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research. International Journal of Computer Integrated Manufacturing, 22(2), 138\u2013157. doi:\n                    10.1080\/09511920802209033\n                    \n                  .","journal-title":"International Journal of Computer Integrated Manufacturing"},{"key":"2646_CR28","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02601641","volume":"63","author":"JM Thompson","year":"1996","unstructured":"Thompson, J. M., & Dowsland, K. A. (1996). Variants of simulated annealing for the examination timetabling problem. Annals of Operations Research, 63, 105\u2013128.","journal-title":"Annals of Operations Research"},{"key":"2646_CR29","doi-asserted-by":"publisher","unstructured":"van den Broek, J. J. J., & Hurkens, C. A. J. (2012). An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007. Annals of Operations Research, 194, 439\u2013454. doi:\n                    10.1007\/s10479-010-0708-z\n                    \n                  .","DOI":"10.1007\/s10479-010-0708-z"},{"key":"2646_CR30","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10479-013-1384-6","volume":"218","author":"A Wehrer","year":"2014","unstructured":"Wehrer, A., & Yellen, J. (2014). The design and implementation of an interactive course-timetabling system. Annals of Operations Research, 218, 327\u2013345. doi:\n                    10.1007\/s10479-013-1384-6\n                    \n                  .","journal-title":"Annals of Operations Research"},{"key":"2646_CR31","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., & Li, H. (2007). MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Transactions on Evolutionary Computation, 11, 712\u2013731.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"2646_CR32","unstructured":"Zitzler, E. (1999). Evolutionary algorithms for multiobjective optimization: Methods and applications. PhD thesis, Share Verlag, Aachen, Germany"},{"key":"2646_CR33","doi-asserted-by":"publisher","unstructured":"Zitzler, E., & Thiele, L. (1998). Multiobjective optimization using evolutionary algorithms: A comparative case study. Parallel Problem Solving from Nature\u2014PPSN V pp 292\u2013301. doi:\n                    10.1007\/BFb0056872","DOI":"10.1007\/BFb0056872"},{"issue":"2","key":"2646_CR34","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & Grunert da Fonseca, V. (2003). Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transactions on Evolutionary Computation, 7(2), 117\u2013132.","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2646-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2646-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2646-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T10:37:37Z","timestamp":1589798257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2646-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,16]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["2646"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2646-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2017,10,16]]},"assertion":[{"value":"16 October 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}