{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T06:44:13Z","timestamp":1725950653973},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319715827"},{"type":"electronic","value":"9783319715834"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-71583-4_19","type":"book-chapter","created":{"date-parts":[[2018,2,14]],"date-time":"2018-02-14T17:03:45Z","timestamp":1518627825000},"page":"269-295","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Understanding Complexity in a Practical Combinatorial Problem Using Mathematical Programming and Constraint Programming"],"prefix":"10.1007","author":[{"given":"Beatriz B.","family":"Oliveira","sequence":"first","affiliation":[]},{"given":"Maria Ant\u00f3nia","family":"Carravilla","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,15]]},"reference":[{"key":"19_CR1","unstructured":"4COutreachProgram. CSP tutorial (2005), \nhttp:\/\/4c.ucc.ie\/web\/outreach\/tutorial.html"},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"J. Adams, E. Balas, D. Zawack, The shifting bottleneck procedure for job shop scheduling. Manag. Sci. 34, 391\u2013401 (1988)","journal-title":"Manag. Sci."},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D Applegate","year":"1991","unstructured":"D. Applegate, W. Cook, A computational study of the job-shop scheduling instance. ORSA J. Comput. 3, 149\u2013156 (1991)","journal-title":"ORSA J. Comput."},{"key":"19_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615320","volume-title":"Priciples of Constraint Programming","author":"KR APT","year":"2003","unstructured":"K.R. APT, Priciples of Constraint Programming (Cambridge University Press, Cambridge, 2003)"},{"key":"19_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E Balas","year":"1979","unstructured":"E. Balas, Disjunctive programming. Ann. Discret. Math. 5, 3\u201351 (1979)","journal-title":"Ann. Discret. Math."},{"key":"19_CR6","first-page":"225","volume-title":"Industrial Scheduling","author":"H Fisher","year":"1963","unstructured":"H. Fisher, G.L. Thompson, Probabilistic learning combinations of local job-shop scheduling rules, in Industrial Scheduling, ed. by J.F. Muth, G.L. Thompson (Prentice-Hall, Englewood Cliffs, 1963), pp. 225\u2013251"},{"key":"19_CR7","unstructured":"S. Lawrence, Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement), in Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania (1984)"},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","volume":"4","author":"JK Lenstra","year":"1979","unstructured":"J.K. Lenstra, Computational complexity of discrete optimization problems. Ann. Discret. Math. 4, 121\u2013140 (1979)","journal-title":"Ann. Discret. Math."},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1504\/EJIE.2012.047662","volume":"6","author":"J Poppenborg","year":"2012","unstructured":"J. Poppenborg, S. Knust, J. Hertzber, Online scheduling of flexible job-shops with blocking and transportation. Eur. J. Ind. Eng. 6, 497\u2013518 (2012)","journal-title":"Eur. J. Ind. Eng."},{"volume-title":"Handbook of Constraint Programming","year":"2006","key":"19_CR10","unstructured":"F. Rossi, P. van Beek, T. Walsh (eds.), Handbook of Constraint Programming (Elsevier, Amsterdam, 2006)"},{"key":"19_CR11","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"RH Storer","year":"1992","unstructured":"R.H. Storer, S.D. Wu, R. Vaccari, New search spaces for sequencing instances with application to job shop scheduling. Manag. Sci. 38, 1495\u20131509 (1992)","journal-title":"Manag. Sci."},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1504\/EJIE.2015.067451","volume":"9","author":"K Th\u00f6rnblad","year":"2015","unstructured":"K. Th\u00f6rnblad, A.B. Str\u00f6mberg, M. Patriksson, T. Almgren, Scheduling optimisation of a real flexible job shop including fixture availability and preventive maintenance. Eur. J. Ind. Eng. 9, 126\u2013145 (2015)","journal-title":"Eur. J. Ind. Eng."},{"key":"19_CR13","unstructured":"W.J. van Hoeve, Introduction to constraint programming, in ACP Summer School on Theory and Practice of Constraint Programming, September 24\u201328, 2012, Wroc\u0142aw, Poland (2012)"},{"key":"19_CR14","unstructured":"T. Yamada, R. Nakano, A genetic algorithm applicable to large-scale job-shop instances, in PPSN\u20192 Proceedings of the 2nd International Workshop on Parallel Problem Solving from Nature, ed. by R. Manner, B. Manderick (1992), pp. 281\u2013290"}],"container-title":["Springer Proceedings in Mathematics & Statistics","Operational Research"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71583-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,14]],"date-time":"2018-02-14T17:14:29Z","timestamp":1518628469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-71583-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319715827","9783319715834"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71583-4_19","relation":{},"ISSN":["2194-1009","2194-1017"],"issn-type":[{"type":"print","value":"2194-1009"},{"type":"electronic","value":"2194-1017"}],"subject":[],"published":{"date-parts":[[2018]]}}}