{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T16:07:30Z","timestamp":1778947650100,"version":"3.51.4"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319180076","type":"print"},{"value":"9783319180083","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","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":[[2015]]},"DOI":"10.1007\/978-3-319-18008-3_30","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T07:32:51Z","timestamp":1429083171000},"page":"437-453","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["Failure-Directed Search for Constraint-Based Scheduling"],"prefix":"10.1007","author":[{"given":"Petr","family":"Vil\u00edm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Laborie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Shaw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2004","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Operations Research Letters 33, 42\u201354 (2004)","journal-title":"Operations Research Letters"},{"issue":"3","key":"30_CR2","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Management Science 34(3), 391\u2013401 (1988)","journal-title":"Management Science"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10951-010-0162-4","volume":"14","author":"A Agnetis","year":"2011","unstructured":"Agnetis, A., Flamini, M., Nicosia, G., Pacifici, A.: A job-shop problem with one additional resource type. Journal of Scheduling 14, 225\u2013237 (2011)","journal-title":"Journal of Scheduling"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Pape, C.L., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers (2001)","DOI":"10.1007\/978-1-4615-1479-4"},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10479-010-0731-0","volume":"184","author":"N Beldiceanu","year":"2011","unstructured":"Beldiceanu, N., Carlsson, M., Demassey, S., Poder, E.: New filtering for the cumulative constraint in the context of non-overlapping rectangles. Annals of Operations Research 184(1), 27\u201350 (2011)","journal-title":"Annals of Operations Research"},{"key":"30_CR6","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sa\u00efs, L.: Boosting systematic search by weighting constraints. In: de M\u00e1ntaras, R.L., Saitta, L. (eds.) ECAI. pp. 146\u2013150. IOS Press (2004)"},{"issue":"1\u20133","key":"30_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49(1\u20133), 61\u201395 (1991)","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"30_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1006314320276","volume":"24","author":"CP Gomes","year":"2000","unstructured":"Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. Autom. Reason. 24(1\u20132), 67\u2013100 (2000)","journal-title":"J. Autom. Reason."},{"key":"30_CR9","unstructured":"Jussien, N., Lhomme, O.: Dynamic domain splitting for numeric CSPs. In: Proc. European Conference on Artificial Intelligence, pp. 224\u2013228 (1998)"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1996","unstructured":"Kolisch, R., Sprecher, A.: PSPLIB - a project scheduling problem library. European Journal of Operational Research 96, 205\u2013216 (1996). http:\/\/www.om-db.wi.tum.de\/psplib\/main.html","journal-title":"European Journal of Operational Research"},{"key":"30_CR11","unstructured":"Laborie, P., Godard, D.: Self-adapting large neighborhood search: application to single-mode scheduling problems. In: Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), pp. 276\u2013284 (2007)"},{"key":"30_CR12","unstructured":"Laborie, P., Rogerie, J.: Reasoning with conditional time-intervals. In: Wilson, D., Lane, H.C. (eds.) Proceedings of the 21st International Florida Artificial Intelligence Research Society Conference, pp. 555\u2013560. AAAI Press (2008)"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Laborie, P., Rogerie, J.: Temporal Linear Relaxation in IBM ILOG CP Optimizer. Journal of Scheduling (2014)","DOI":"10.1007\/s10951-014-0408-7"},{"key":"30_CR14","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vil\u00edm, P.: Reasoning with conditional time-intervals. part II: an algebraical model for resources. In: Lane, H.C., Guesgen, H.W. (eds.) Proceedings of the 22nd International Florida Artificial Intelligence Research Society Conference. AAAI Press, Sanibel Island, Florida, USA, 19\u201321 May 2009"},{"key":"30_CR15","unstructured":"Lecoutre, C., Sa\u00efs, L., Tabary, S., Vidal, V.: Nogood recording from restarts. In: 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 131\u2013136 (2007)"},{"key":"30_CR16","unstructured":"Lhomme, O.: Quick shaving. In: Veloso, M.M., Kambhampati, S. (eds.) AAAI, pp. 411\u2013415. AAAI Press\/The MIT Press (2005)"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s11047-013-9373-x","volume":"13","author":"R Menc\u00eda","year":"2014","unstructured":"Menc\u00eda, R., Sierra, M.R., Menc\u00eda, C., Varela, R.: A genetic algorithm for job-shop scheduling with operators enhanced by weak lamarckian evolution and search space narrowing. Natural Computing 13, 179\u2013192 (2014)","journal-title":"Natural Computing"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-29828-8_15","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"L Michel","year":"2012","unstructured":"Michel, L., Van Hentenryck, P.: Activity-based search for black-box constraint programming solvers. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 228\u2013243. Springer, Heidelberg (2012)"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Annual ACM IEEE Design Automation Conference, pp. 530\u2013535. ACM (2001)","DOI":"10.1145\/378239.379017"},{"key":"30_CR20","unstructured":"Muller, L.F.: An adaptive large neighborhood search algorithm for the multi-mode RCPSP. Tech. Rep. Report 3.2011, Department of Management Engineering, Technical University of Denmark (2011)"},{"issue":"4","key":"30_CR21","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10287-006-0023-y","volume":"3","author":"PM Pardalos","year":"2006","unstructured":"Pardalos, P.M., Shylo, O.V.: An algorithm for the job shop scheduling problem based on global equilibrium search techniques. Computational Management Science 3(4), 331\u2013348 (2006)","journal-title":"Computational Management Science"},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P Refalo","year":"2004","unstructured":"Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557\u2013571. Springer, Heidelberg (2004)"},{"key":"30_CR23","unstructured":"Schnell, A., Hartl, R.F.: Optimizing the multi-mode resource-constrained project scheduling problem with standard and generalized precedence relations by constraint programming and boolean satisfiability solving techniques (working Paper) (2014)"},{"key":"30_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-38171-3_16","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"A Schutt","year":"2013","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J.: Explaining time-table-edge-finding propagation for the cumulative resource constraint. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 234\u2013250. Springer, Heidelberg (2013)"},{"key":"30_CR25","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.: Solving RCPSP\/max by lazy clause generation. Journal of Scheduling 16(3), 273\u2013289 (2013). http:\/\/ww2.cs.mu.oz.au\/pjs\/rcpsp\/rcpspmax_all.html (Accessed 1 November 2014)"},{"key":"30_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-85958-1_4","volume-title":"Principles and Practice of Constraint Programming","author":"H Simonis","year":"2008","unstructured":"Simonis, H., O\u2019Sullivan, B.: Search strategies for rectangle packing. In: Stuckey, P. (ed.) CP 2008. LNCS, vol. 5202, pp. 52\u201366. Springer, Heidelberg (2008)"},{"issue":"10","key":"30_CR27","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"R Storer","year":"1992","unstructured":"Storer, R., Wu, S., Vaccari, R.: New search spaces for sequencing problems with application to job shop scheduling. Management Science 38(10), 1495\u20131509 (1992)","journal-title":"Management Science"},{"key":"30_CR28","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operations Research 64, 278\u2013285 (1993)","journal-title":"European Journal of Operations Research"},{"key":"30_CR29","unstructured":"Torres, P., Lopez, P.: Overview and possible extensions of shaving techniques for job-shop problems. In: Junker, U., Karisch, S., Tsch\u00f6ke, S. (eds.) Proceedings of 2nd International Workshop on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 181\u2013186 (2000)"},{"key":"30_CR30","unstructured":"http:\/\/optimizizer.com\/jobshop.php (Accessed 1 November 2014)"},{"key":"30_CR31","unstructured":"http:\/\/tinyurl.com\/nl85fhy (Accessed 1 November 2014)"},{"key":"30_CR32","unstructured":"http:\/\/tinyurl.com\/kvm8nuk (Accessed 1 November 2014)"},{"key":"30_CR33","unstructured":"http:\/\/tinyurl.com\/nn2j599 (Accessed 1 November 2014)"},{"key":"30_CR34","unstructured":"http:\/\/tinyurl.com\/n8oahua (Accessed 1 November 2014)"},{"key":"30_CR35","unstructured":"Vil\u00edm, P.: Global Constraints in Scheduling. Ph.D. thesis, Charles University in Prague, Faculty of Mathematics and Physics, Department of Theoretical Computer Science and Mathematical Logic (2007)"},{"key":"30_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-21311-3_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P Vil\u00edm","year":"2011","unstructured":"Vil\u00edm, P.: Timetable edge finding filtering algorithm for discrete cumulative resources. In: Achterberg, T., Beck, J. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 230\u2013245. Springer, Heidelberg (2011)"},{"key":"30_CR37","unstructured":"Wolf, A.: Impact-based search in constraint-based scheduling. In: Hegering, H., Lehmann, A., Ohlbach, H.J., Scheideler, C. (eds.) Informatik 2008, Beherrschbare Systeme - dank Informatik, Band 2, Beitr\u00e4ge der 38. Jahrestagung der Gesellschaft f\u00fcr Informatik e.V. (GI), in M\u00fcnchen, 8\u201313 September, LNI, vol. 134, pp. 523\u2013528. GI (2008)"},{"key":"30_CR38","unstructured":"Yamada, T., Nakano, R.: A genetic algorithm applicable to large-scale job-shop problems. In: M\u00e4nner, R., Manderick, B. (eds.) Proc. 2nd International Workshop on Parallel Problem Solving from Nature, pp. 281\u2013290 (1992)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18008-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,30]],"date-time":"2020-12-30T20:07:48Z","timestamp":1609358868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18008-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319180076","9783319180083"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18008-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}