{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:48:28Z","timestamp":1742982508113,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232188"},{"type":"electronic","value":"9783319232195"}],"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-23219-5_28","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T10:17:33Z","timestamp":1439374653000},"page":"393-402","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Two Clause Learning Approaches for Disjunctive Scheduling"],"prefix":"10.1007","author":[{"given":"Mohamed","family":"Siala","sequence":"first","affiliation":[]},{"given":"Christian","family":"Artigues","sequence":"additional","affiliation":[]},{"given":"Emmanuel","family":"Hebrard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"key":"28_CR1","unstructured":"Best known lower\/upper bounds for Taillard Job Shop instances. http:\/\/optimizizer.com\/TA.php (accessed April 15, 2015)"},{"key":"28_CR2","unstructured":"Taillard, \u00c9.: http:\/\/mistic.heig-vd.ch\/taillard\/problemes.dir\/ordonnancement.dir\/jobshop.dir\/best_lb_up.txt (accessed April 15, 2015)"},{"issue":"1","key":"28_CR3","first-page":"49","volume":"29","author":"J Christopher","year":"2007","unstructured":"Christopher, J.: Beck. Solution-guided multi-point constructive search for job shop scheduling. Journal of Artificial Intelligence Research 29(1), 49\u201377 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Bessiere, C.: Constraint propagation. In: van Beek, P., Rossi, F., Walsh, T. (eds.) Handbook of Constraint Programming, volume 2 of Foundations of Artificial Intelligence, pp. 29\u201383. Elsevier (2006)","DOI":"10.1016\/S1574-6526(06)80007-6"},{"key":"28_CR5","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of the 16th European Conference on Artificial Intelligence, ECAI 2004, Valencia, Spain, pp. 146\u2013150 (2004)"},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J Carlier","year":"1989","unstructured":"Carlier, J., Pinson, \u00c9.: An algorithm for solving the job-shop problem. Management Science 35(2), 164\u2013176 (1989)","journal-title":"Management Science"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/978-3-540-45193-8_59","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"E Danna","year":"2003","unstructured":"Danna, E.: Structured vs. unstructured large neighborhood search: a case study on job-shop scheduling problems with earliness and tardiness costs. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 817\u2013821. Springer, Heidelberg (2003)"},{"key":"28_CR8","unstructured":"Feydy, T., Schutt, A., Stuckey, P.J.: Semantic learning for lazy clause generation. In: Proceedings of TRICS Workshop: Techniques foR Implementing Constraint programming Systems, TRICS 2013, Uppsala, Sweden (2013)"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-04244-7_29","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"T Feydy","year":"2009","unstructured":"Feydy, T., Stuckey, P.J.: Lazy clause generation reengineered. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 352\u2013366. Springer, Heidelberg (2009)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-13520-0_19","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"D Grimes","year":"2010","unstructured":"Grimes, D., Hebrard, E.: Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 147\u2013161. Springer, Heidelberg (2010)"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-23786-7_28","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"D Grimes","year":"2011","unstructured":"Grimes, D., Hebrard, E.: Models and strategies for variants of the job shop scheduling problem. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 356\u2013372. Springer, Heidelberg (2011)"},{"issue":"2","key":"28_CR12","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1287\/ijoc.2014.0625","volume":"27","author":"D Grimes","year":"2015","unstructured":"Grimes, D., Hebrard, E.: Solving variants of the job shop scheduling problem through conflict-directed search. INFORMS Journal on Computing 27(2), 268\u2013284 (2015)","journal-title":"INFORMS Journal on Computing"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-04244-7_33","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"D Grimes","year":"2009","unstructured":"Grimes, D., Hebrard, E., Malapert, A.: Closing the open shop: contradicting conventional wisdom. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 400\u2013408. Springer, Heidelberg (2009)"},{"key":"28_CR14","unstructured":"Lawrence, S.R.: Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Technical report, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA (1984)"},{"issue":"4","key":"28_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. Information Processing Letters 47(4), 173\u2013180 (1993)","journal-title":"Information Processing Letters"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Matthew, W., Moskewicz, C.F., Madigan, Y.Z., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Annual Design Automation Conference, DAC 2001, Las Vegas, Nevada, USA, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"28_CR17","unstructured":"Nuijten, W.: Time and resource constrained scheduling: a constraint satisfaction approach. Ph.D thesis, Eindhoven University of Technology (1994)"},{"issue":"3","key":"28_CR18","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation via Lazy Clause Generation. Constraints 14(3), 357\u2013391 (2009)","journal-title":"Constraints"},{"issue":"4","key":"28_CR19","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":"28_CR20","unstructured":"Sadeh, N.M.: Lookahead techniques for micro-opportunistic job-shop scheduling. Ph.D thesis, Carnegie Mellon University, Pittsburgh, PA, USA (1991)"},{"issue":"3","key":"28_CR21","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10951-012-0285-x","volume":"16","author":"A Schutt","year":"2013","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)","journal-title":"Journal of Scheduling"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP 1998","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"issue":"2","key":"28_CR23","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"\u00c9 Taillard","year":"1993","unstructured":"Taillard, \u00c9.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64(2), 278\u2013285 (1993). Project Management anf Scheduling","journal-title":"European Journal of Operational Research"},{"key":"28_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1007\/978-3-642-04244-7_62","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"P Vil\u00edm","year":"2009","unstructured":"Vil\u00edm, P.: Edge finding filtering algorithm for discrete cumulative resources in $${\\cal O}(kn\\,{\\rm log}\\,(n))$$. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 802\u2013816. Springer, Heidelberg (2009)"},{"key":"28_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/978-3-319-18008-3_30","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"P Vil\u00edm","year":"2015","unstructured":"Vil\u00edm, P., Laborie, P., Shaw, P.: Failure-directed search for constraint-based scheduling. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 437\u2013453. Springer, Heidelberg (2015)"},{"key":"28_CR26","unstructured":"Walsh, T.: Search in a small world. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence, IJCAI 1999, Stockholm, Sweden, pp. 1172\u20131177 (1999)"},{"key":"28_CR27","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.H., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: Proceedings of the 2001 IEEE\/ACM International Conference on Computer-aided Design, ICCAD 2001, San Jose, California, pp. 279\u2013285 (2001)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23219-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T08:02:21Z","timestamp":1676966541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23219-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232188","9783319232195"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23219-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}