{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T15:16:06Z","timestamp":1787238966589,"version":"3.56.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T00:00:00Z","timestamp":1581552000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T00:00:00Z","timestamp":1581552000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"FWO","award":["S007318N"],"award-info":[{"award-number":["S007318N"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10732-020-09439-9","type":"journal-article","created":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T08:03:01Z","timestamp":1581580981000},"page":"205-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["An automatic constructive matheuristic for the shift minimization personnel task scheduling problem"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8264-244X","authenticated-orcid":false,"given":"Reshma","family":"Chirayil Chandrasekharan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3955-7725","authenticated-orcid":false,"given":"Pieter","family":"Smet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1014-6340","authenticated-orcid":false,"given":"Tony","family":"Wauters","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,2,13]]},"reference":[{"key":"9439_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-662-48350-3_6","volume-title":"Algorithms-ESA 2015","author":"D Baatar","year":"2015","unstructured":"Baatar, D., Krishnamoorthy, M., Ernst, A.T.: A triplet-based exact method for the shift minimisation personnel task scheduling problem. In: Bansal, N., Finocchi, I. (eds.) Algorithms-ESA 2015, pp. 59\u201370. Springer, Berlin (2015)"},{"issue":"1","key":"9439_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1515\/jqas-2017-0118","volume":"15","author":"RC Chandrasekharan","year":"2019","unstructured":"Chandrasekharan, R.C., Toffolo, T.A.M., Wauters, T.: Analysis of a constructive matheuristic for the traveling umpire problem. J. Quant. Anal. Sports 15(1), 41\u201357 (2019)","journal-title":"J. Quant. Anal. Sports"},{"key":"9439_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10479-011-0928-x","volume":"213","author":"F Della Croce","year":"2014","unstructured":"Della Croce, F., Grosso, A., Salassa, F.: A matheuristic approach for the two-machine total completion time flow shop problem. Ann. Oper. Res. 213, 67\u201378 (2014)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"9439_CR4","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ejor.2012.11.029","volume":"226","author":"JV den Bergh","year":"2013","unstructured":"den Bergh, J.V., Beli\u00e9n, J., Bruecker, P.D., Demeulemeester, E., Boeck, L.D.: Personnel scheduling: a literature review. Eur. J. Oper. Res. 226(3), 367\u2013385 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"9439_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1018992120116","volume":"72","author":"D Dowling","year":"1997","unstructured":"Dowling, D., Krishnamoorthy, M., Mackenzie, H., Sier, D.: Staff rostering at a large international airport. Ann. Oper. Res. 72, 125\u2013147 (1997)","journal-title":"Ann. Oper. Res."},{"key":"9439_CR6","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.artint.2014.04.001","volume":"212","author":"J Fages","year":"2014","unstructured":"Fages, J., Lap\u00e8gue, T.: Filtering atmostnvalue with difference constraints: application to the shift minimisation personnel task scheduling problem. Artif. Intell. 212, 116\u2013133 (2014)","journal-title":"Artif. Intell."},{"key":"9439_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program. 98, 23\u201347 (2003)","journal-title":"Math. Program."},{"key":"9439_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.cor.2018.07.010","volume":"100","author":"M Hojati","year":"2018","unstructured":"Hojati, M.: A greedy heuristic for shift minimization personnel task scheduling problem. Comput. Oper. Res. 100, 66\u201376 (2018)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"9439_CR9","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1002\/nav.20231","volume":"54","author":"AW Kolen","year":"2007","unstructured":"Kolen, A.W., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.: Interval scheduling: a survey. Nav. Res. Log. (NRL) 54(5), 530\u2013543 (2007)","journal-title":"Nav. Res. Log. (NRL)"},{"key":"9439_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ejor.2011.11.034","volume":"219","author":"M Krishnamoorthy","year":"2012","unstructured":"Krishnamoorthy, M., Ernst, A., Baatar, D.: Algorithms for large scale shift minimisation personnel task scheduling problems. Eur. J. Oper. Res. 219, 34\u201348 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"9439_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.ejor.2014.01.035","volume":"237","author":"S Lin","year":"2014","unstructured":"Lin, S., Ying, K.: Minimizing shifts for personnel task scheduling problems: a three-phase algorithm. Eur. J. Oper. Res. 237, 323\u2013334 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"9439_CR12","volume-title":"Matheuristics: Hybridizing Metaheuristics and Mathematical Programming","author":"V Maniezzo","year":"2009","unstructured":"Maniezzo, V., St\u00fctzle, T., Vo\u00df, S.: Matheuristics: Hybridizing Metaheuristics and Mathematical Programming, 1st edn. Springer, Berlin (2009). ISBN 144191305X, 9781441913050","edition":"1"},{"key":"9439_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-55914-8_4","volume-title":"Data and Decision Sciences in Action","author":"DN Ramesh","year":"2018","unstructured":"Ramesh, D.N., Krishnamoorthy, M., Ernst, A.T.: Efficient models, formulations and algorithms for some variants of fixed interval scheduling problems. In: Sarker, R., Abbass, H.A., Dunstall, S., Kilby, P., Davis, R., Young, L. (eds.) Data and Decision Sciences in Action, pp. 43\u201369. Springer, Cham (2018)"},{"key":"9439_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10479-014-1594-6","volume":"239","author":"HG Santos","year":"2016","unstructured":"Santos, H.G., Toffolo, T.A.M., Gomes, R.A.M., Ribas, S.: Integer programming techniques for the nurse rostering problem. Ann. Oper. Res. 239, 225\u2013251 (2016)","journal-title":"Ann. Oper. Res."},{"key":"9439_CR15","unstructured":"Smet, P., Vanden Berghe, G.: A matheuristic approach to the shift minimisation personnel task scheduling problem. In: Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling, PATAT, 2012, pp. 145\u2013151 (2012)"},{"key":"9439_CR16","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.omega.2014.02.003","volume":"46","author":"P Smet","year":"2014","unstructured":"Smet, P., Wauters, T., Mihaylov, M., Berghe, G.V.: The shift minimisation personnel task scheduling problem: a new hybrid approach and computational insights. Omega 46, 64\u201373 (2014)","journal-title":"Omega"},{"issue":"2","key":"9439_CR17","first-page":"115","volume":"34","author":"O Solyali","year":"2016","unstructured":"Solyali, O.: The shift minimization personnel task scheduling problem: an effective lower bounding procedure. Hacettepe \u00daniversitesi \u0130ktisadi ve \u0130dari Bilimler Fak\u00faltesi Dergisi 34(2), 115\u2013132 (2016)","journal-title":"Hacettepe \u00daniversitesi \u0130ktisadi ve \u0130dari Bilimler Fak\u00faltesi Dergisi"},{"key":"9439_CR18","volume-title":"Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1998). ISBN 0471283665"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-020-09439-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-020-09439-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-020-09439-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,3]],"date-time":"2021-04-03T05:07:40Z","timestamp":1617426460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-020-09439-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,13]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["9439"],"URL":"https:\/\/doi.org\/10.1007\/s10732-020-09439-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,13]]},"assertion":[{"value":"15 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}