{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T10:00:16Z","timestamp":1760781616277},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,10,27]],"date-time":"2009-10-27T00:00:00Z","timestamp":1256601600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1007\/s10601-009-9083-2","type":"journal-article","created":{"date-parts":[[2009,10,26]],"date-time":"2009-10-26T06:59:14Z","timestamp":1256540354000},"page":"54-76","source":"Crossref","is-referenced-by-count":37,"title":["Formal languages for integer programming modeling of shift scheduling problems"],"prefix":"10.1007","volume":"16","author":[{"given":"Marie-Claude","family":"C\u00f4t\u00e9","sequence":"first","affiliation":[]},{"given":"Bernard","family":"Gendron","sequence":"additional","affiliation":[]},{"given":"Claude-Guy","family":"Quimper","sequence":"additional","affiliation":[]},{"given":"Louis-Martin","family":"Rousseau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,27]]},"reference":[{"key":"9083_CR1","volume-title":"Network flows","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows. Englewood Cliffs: Prentice Hall."},{"issue":"4","key":"9083_CR2","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1287\/mnsc.42.4.591","volume":"42","author":"T Aykin","year":"1996","unstructured":"Aykin, T. (1996). Optimal shift scheduling with multiple break windows. Management Science, 42(4), 591\u2013602.","journal-title":"Management Science"},{"issue":"6","key":"9083_CR3","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1057\/palgrave.jors.2600472","volume":"49","author":"T Aykin","year":"1998","unstructured":"Aykin, T. (1998). A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows. Journal of the Operational Research Society, 49(6), 603\u2013615.","journal-title":"Journal of the Operational Research Society"},{"key":"9083_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230200103","volume":"20","author":"A Balakrishan","year":"1990","unstructured":"Balakrishan, A., & Wong, R. (1990). Model for the rotating workforce scheduling problem. Networks, 20, 25\u201342.","journal-title":"Networks"},{"key":"9083_CR5","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/A:1019009928005","volume":"3","author":"H Beaulieu","year":"2000","unstructured":"Beaulieu, H., Ferland, J. A., Gendron, B., & Michelon, P. (2000). A mathematical programming approach for scheduling physicians in the emergency room. Health Care Management Science, 3, 193\u2013200.","journal-title":"Health Care Management Science"},{"issue":"11","key":"9083_CR6","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1287\/mnsc.36.11.1339","volume":"36","author":"S Bechtold","year":"1990","unstructured":"Bechtold, S., & Jacobs, L. (1990). Implicit modeling of flexible break assignment in optimal shift scheduling. Management Science, 36(11), 1339\u20131351.","journal-title":"Management Science"},{"issue":"2","key":"9083_CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1002\/(SICI)1520-6750(199603)43:2<233::AID-NAV5>3.0.CO;2-B","volume":"43","author":"S Bechtold","year":"1996","unstructured":"Bechtold, S., & Jacobs, L. (1996). The equivalence of general set-covering and implicit integer programming formulations for shift scheduling. Naval Research Logistics, 43(2), 233\u2013249.","journal-title":"Naval Research Logistics"},{"key":"9083_CR8","unstructured":"Bouchard, M. (2004). Optimisation des pauses dans le probl\u00e8me de fabrication des horaires avec quarts de travail. Memoire de maitrise, Ecole Polytechnique de Montreal."},{"key":"9083_CR9","unstructured":"\u00c7ezik, T., G\u00fcnl\u00fck, O., & Luss, H. (1999). An integer programming model for the weekly tour scheduling problem. Naval Research Logistic, 48(7)."},{"key":"9083_CR10","unstructured":"Cocke, J., & Schwartz, J. T. (1970). Programming languages and their compilers: Preliminary notes. Technical report, Courant Institute of Mathematical Sciences, New York University."},{"key":"9083_CR11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/opre.2.3.339","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G. (1954). A comment on Edie\u2019s traffic delay at toll booths. Operations Research, 2, 339\u2013341.","journal-title":"Operations Research"},{"key":"9083_CR12","doi-asserted-by":"crossref","unstructured":"Demassey, S., Pesant, G., & Rousseau, L.-M. (2005). Constraint programming based column generation for employee timetabling. In Proceedings of the second international conference on intergretion of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2005) (Vol. 3524, pp. 140\u2013154).","DOI":"10.1007\/11493853_12"},{"issue":"4","key":"9083_CR13","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10601-006-9003-7","volume":"11","author":"S Demassey","year":"2006","unstructured":"Demassey, S., Pesant, G., & Rousseau, L.-M. (2006). A cost-regular based hybrid column generation approach. Constraints, 11(4), 315\u2013333.","journal-title":"Constraints"},{"key":"9083_CR14","unstructured":"Ernst, A., Hourigan, P., Krishnamoorthy, M., Mills, G., Nott, H., & Sier, D. (1999). Rostering ambulance officers. In Proceedings of the fifteenth national conference of the Australian society for operations research, Gold Coast (pp. 470\u2013481)."},{"key":"9083_CR15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/B:ANOR.0000019087.46656.e2","volume":"127","author":"AT Ernst","year":"2004","unstructured":"Ernst, A. T., Jiang, H., Krishnamoorthy, M., Owens, B., & Sier, D. (2004). An annotated bibliography of personnel scheduling and rostering. Annals of Operations Research, 127, 21\u2013144.","journal-title":"Annals of Operations Research"},{"key":"9083_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"AT Ernst","year":"2004","unstructured":"Ernst, A. T., Jiang, H., Krishnamoorthy, M., & Sier, D. (2004). Staff scheduling and rostering: A review of applications, methods and models. European Journal of Operational Research, 153, 3\u201327.","journal-title":"European Journal of Operational Research"},{"key":"9083_CR17","volume-title":"Introduction to automata theory, languages and computation","author":"JE Hopcroft","year":"2001","unstructured":"Hopcroft, J. E., Motwani, R., & Ullman, J. D. (2001). Introduction to automata theory, languages and computation. Reading: Addison Wesley."},{"key":"9083_CR18","unstructured":"Kadioglu, S., & Sellmann, M. (2008). Efficient context-free grammar constraints. In Proceedings of the 23rd national conference on artificial intelligence (pp. 310\u2013316)."},{"key":"9083_CR19","unstructured":"Kasami, T. (1965). An efficient recognition and syntax-analysis algorithm for context-free languages. Technical Report, Scientific report AFCRL-65-758, Air Force Cambridge Research Lab, Bedford, MA."},{"issue":"1","key":"9083_CR20","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0377-2217(80)90036-3","volume":"4","author":"G Laporte","year":"1980","unstructured":"Laporte, G., Nobert, Y., & Biron, J. (1980). Rotating schedules. European Journal of Operational Research, 4(1), 24\u201330.","journal-title":"European Journal of Operational Research"},{"key":"9083_CR21","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/(SICI)1520-6750(200004)47:3<185::AID-NAV1>3.0.CO;2-7","volume":"47","author":"A Mehrotra","year":"2000","unstructured":"Mehrotra, A., Murthy, K., & Trick, M. (2000). Optimal shift scheduling: A branch-and-price approach. Naval Research Logistics, 47, 185\u2013200.","journal-title":"Naval Research Logistics"},{"key":"9083_CR22","doi-asserted-by":"crossref","unstructured":"Menana, J., & Demassey, S. (2009). Sequencing and counting with the multicost-regular constraint. In CPAIOR (pp. 178\u2013192).","DOI":"10.1007\/978-3-642-01929-6_14"},{"issue":"3","key":"9083_CR23","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/S0377-2217(97)00006-4","volume":"104","author":"H Millar","year":"1998","unstructured":"Millar, H., & Kiragu, M. (1998). Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming. European Journal of Operational Research, 104(3), 582\u2013592.","journal-title":"European Journal of Operational Research"},{"key":"9083_CR24","first-page":"299","volume":"6","author":"S Moondra","year":"1976","unstructured":"Moondra, S. (1976). A linear programming model for work force scheduling for banks. Journal of Bank Research, 6, 299\u2013301.","journal-title":"Journal of Bank Research"},{"key":"9083_CR25","doi-asserted-by":"crossref","unstructured":"Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In Proceedings of the tenth international conference on principles and practice of Constraint Programming (CP 2004) (pp. 482\u2013495).","DOI":"10.1007\/978-3-540-30201-8_36"},{"key":"9083_CR26","doi-asserted-by":"crossref","unstructured":"Quimper, C.-G., & Rousseau, L.-M. A large neighborhood search approach to the multi-activity shift scheduling problem. Journal of Heuristics. doi: 10.1007\/s10732-009-9106-6 .","DOI":"10.1007\/s10732-009-9106-6"},{"key":"9083_CR27","doi-asserted-by":"crossref","unstructured":"Quimper, C.-G., & Walsh, T. (2006). Global grammar constraints. In Proceedings of the twelfth international conference on principles and practice of Constraint Programming (CP 2006) (pp. 751\u2013755).","DOI":"10.1007\/11889205_64"},{"key":"9083_CR28","doi-asserted-by":"crossref","unstructured":"Quimper, C.-G., & Walsh, T. (2007). Decomposing global grammar constraints. In Proceedings of the thirteenth international conference on principles and practice of Constraint Programming (CP 2007) (pp. 590\u2013604).","DOI":"10.1007\/978-3-540-74970-7_42"},{"key":"9083_CR29","unstructured":"Rekik, M. (2006). Construction d\u2019horaires de travail dans des environnements hautement flexibles. PhD thesis, \u00c9cole Polytechnique de Montr\u00e9al."},{"key":"9083_CR30","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/B:ANOR.0000019101.29692.2c","volume":"118","author":"M Rekik","year":"2004","unstructured":"Rekik, M., Cordeau, J.-F., & Soumis, F. (2004). Using benders decomposition to implicitly model tour scheduling. Annals of Operations Research, 118, 111\u2013133.","journal-title":"Annals of Operations Research"},{"key":"9083_CR31","unstructured":"Sellmann, M. (2007). The theory of grammar constraints. In Proceedings of the twelfth international conference on principles and practice of Constraint Programming (CP 2006) (pp. 530\u2013544)."},{"key":"9083_CR32","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/B:ANOR.0000019092.76669.a1","volume":"127","author":"MS Sodhi","year":"2003","unstructured":"Sodhi, M. S. (2003). A flexible, fast, and optimal modeling approach applied to crew rostering at London Underground. Annals of Operations Research, 127, 259\u2013281.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"9083_CR33","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/mnsc.41.4.595","volume":"41","author":"G Thompson","year":"1995","unstructured":"Thompson, G. (1995). Improved implicit optimal modelling of the labor shift scheduling problem. Management Science, 41(4), 595\u2013607.","journal-title":"Management Science"},{"issue":"2","key":"9083_CR34","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0019-9958(67)80007-X","volume":"10","author":"DH Younger","year":"1967","unstructured":"Younger, D. H. (1967). Recognition and parsing of context-free languages in time n 3. Information and Control, 10(2), 189\u2013208.","journal-title":"Information and Control"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-009-9083-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-009-9083-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-009-9083-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:14:15Z","timestamp":1559229255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-009-9083-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,27]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["9083"],"URL":"https:\/\/doi.org\/10.1007\/s10601-009-9083-2","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,27]]}}}