{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:51:34Z","timestamp":1649181094205},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,2,16]],"date-time":"2012-02-16T00:00:00Z","timestamp":1329350400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10852-012-9174-8","type":"journal-article","created":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T02:51:47Z","timestamp":1329274307000},"page":"193-215","source":"Crossref","is-referenced-by-count":1,"title":["Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems"],"prefix":"10.1007","volume":"11","author":[{"given":"Marie-Jos\u00e9","family":"Huguet","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Lopez","sequence":"additional","affiliation":[]},{"given":"Wafa","family":"Karoui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,16]]},"reference":[{"issue":"2","key":"9174_CR1","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.engappai.2010.07.008","volume":"24","author":"C Artigues","year":"2011","unstructured":"Artigues, C., Huguet, M.-J., Lopez, P.: Generalized disjunctive constraint propagation for solving the job shop problem with time lags. Eng. Appl. Artif. Intell. 24(2), 220\u2013231 (2011)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"9174_CR2","doi-asserted-by":"crossref","unstructured":"Beck, J.C., Prosser, P., Wallace, R.: Variable ordering heuristics show promise. In: Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP\u201904), pp. 711\u2013715. Toronto, Canada (2004)","DOI":"10.1007\/978-3-540-30201-8_52"},{"key":"9174_CR3","doi-asserted-by":"crossref","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.-C.: MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In: Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming (CP\u201996), pp. 61\u201375. Cambridge, Massachusetts, USA (1996)","DOI":"10.1007\/3-540-61551-2_66"},{"key":"9174_CR4","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\u201904), pp. 146\u2013150. Valencia, Spain, August (2004)"},{"key":"9174_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0166-218X(99)00015-3","volume":"94","author":"P Brucker","year":"1999","unstructured":"Brucker, P., Hilbig, T., Hurink, J.: A branch and bound algorithm for a single machine scheduling with positive and negative time-lags. Discrete Appl. Math. 94, 77\u201399 (1999)","journal-title":"Discrete Appl. Math."},{"key":"9174_CR6","doi-asserted-by":"crossref","first-page":"2331","DOI":"10.1016\/j.cor.2006.11.007","volume":"35","author":"A Caumond","year":"2008","unstructured":"Caumond, A., Lacomme, P., Tchernev, N.: A memetic algorithm for the job-shop with time-lags. Comput. Oper. Res. 35, 2331\u20132356 (2008)","journal-title":"Comput. Oper. Res."},{"key":"9174_CR7","unstructured":"CSPLib: http\/\/csplib.org"},{"key":"9174_CR8","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"9174_CR9","unstructured":"Frost, D.H., Bessi\u00e8re, C., Dechter, R., R\u00e9gin, J.C.: Random uniform CSP generators. http:\/\/www.lirmm.fr\/~bessiere\/generator.html (1996)"},{"issue":"12","key":"9174_CR10","doi-asserted-by":"crossref","first-page":"2141","DOI":"10.1016\/j.cor.2010.03.003","volume":"37","author":"B Gacias","year":"2010","unstructured":"Gacias, B., Artigues, C., Lopez, P.: Parallel machine scheduling with precedence constraints and setup times. Comput. Oper. Res. 37(12), 2141\u20132151 (2010)","journal-title":"Comput. Oper. Res."},{"key":"9174_CR11","unstructured":"Gent, I.P.: Two results on car-sequencing problems. Research report 02-1998, APES, University of Strathclyde, UK (1998)"},{"key":"9174_CR12","unstructured":"Grimes, D., Wallace, R.J.: Learning from failure in constraint satisfaction search. In: AAAI Workshop on Learning for Search, Boston, Massachusetts, USA (2006)"},{"key":"9174_CR13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R Haralick","year":"1980","unstructured":"Haralick, R., Elliot, G.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14, 263\u2013313 (1980)","journal-title":"Artif. Intell."},{"key":"9174_CR14","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI\u201995), vol.\u00a01, pp. 607\u2013615. Montr\u00e9al, Qu\u00e9bec, Canada (1995)"},{"key":"9174_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0004-3702(92)90006-J","volume":"58","author":"P Hentenryck Van","year":"1992","unstructured":"Van Hentenryck, P., Simonis, H., Dincbas, M.: Constraint satisfaction using constraint logic programming. Artif. Intell. 58, 113\u2013159 (1992)","journal-title":"Artif. Intell."},{"issue":"12","key":"9174_CR16","doi-asserted-by":"crossref","first-page":"2192","DOI":"10.1016\/j.cor.2010.03.009","volume":"37","author":"A Ben Hmida","year":"2010","unstructured":"Ben Hmida, A., Haouari, M., Huguet, M.-J., Lopez, P.: Discrepancy search for the flexible job shop problem. Comput. Oper. Res. 37(12), 2192\u20132201 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9174_CR17","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10601-008-9067-7","volume":"14","author":"WJ Hoeve Van","year":"2009","unstructured":"Van Hoeve, W.J., Pesant, G., Rousseau, L.-M., Sabharwal, A.: New filtering algorithms for combinations of among constraints. Constraints 14(2), 273\u2013292 (2009)","journal-title":"Constraints"},{"key":"9174_CR18","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033036","volume-title":"Logic-based Methods for Optimization: Combining Optimization and Constraint Satisfaction","author":"J Hooker","year":"2000","unstructured":"Hooker, J.: Logic-based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York (2000)"},{"key":"9174_CR19","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0166-218X(00)00315-2","volume":"112","author":"J Hurink","year":"2001","unstructured":"Hurink, J., Keuchel, J.: Local search algorithms for a single-machine scheduling problem with positive and negative time-lags. Discrete Appl. Math. 112, 179\u2013197 (2001)","journal-title":"Discrete Appl. Math."},{"key":"9174_CR20","doi-asserted-by":"crossref","unstructured":"Karoui, W., Huguet, M.-J., Lopez, P., Naanaa, W.: YIELDS: a yet improved limited discrepancy search for CSPs. In: Proceedings of the 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR\u201907), LNCS 4510, Springer, pp. 99\u2013111. Brussels, Belgium (2007)","DOI":"10.1007\/978-3-540-72397-4_8"},{"key":"9174_CR21","unstructured":"Korf, R.E.: Improved limited discrepancy search. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI\u201996) and the 8th Innovative Applications of Artificial Intelligence Conference (IAAI\u201996), pp. 286\u2013291. Portland, Oregon, USA (1996)"},{"key":"9174_CR22","unstructured":"Lacomme, P.: http:\/\/www.isima.fr\/~lacomme\/Job_Shop_TL.html"},{"key":"9174_CR23","unstructured":"Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Last conflict based reasoning. In: Proceedings of the 17th European Conference on Artificial Intelligence (ECAI\u201906), pp. 133\u2013137. Trento, Italy (2006)"},{"key":"9174_CR24","first-page":"69","volume":"1","author":"C Lecoutre","year":"2007","unstructured":"Lecoutre, C., Sais, L., Vion, J.: Using SAT encodings to derive CSP value ordering heuristics. JSAT 1, 69\u2013186 (2007)","journal-title":"JSAT"},{"key":"9174_CR25","unstructured":"Milano, M., Roli, A.: On the relation between complete and incomplete search: an informal discussion. In: Proceedings of the 4th International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR\u201902), pp. 237\u2013250. Le Croisic, France (2002)"},{"key":"9174_CR26","doi-asserted-by":"crossref","unstructured":"Neumann, K., Schwindt, C., Zimmermann, J.: Project Scheduling with Time Windows and Scarce Resources. Springer (2002)","DOI":"10.1007\/978-3-662-22341-3"},{"key":"9174_CR27","doi-asserted-by":"crossref","unstructured":"Prcovic, N., Neveu, B.: Ensuring a relevant visiting order of the leaf nodes during a tree search. In: Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming (CP\u201999), LNCS 1713, Springer, pp. 361\u2013374. Alexandria, Virginia, USA (1999)","DOI":"10.1007\/978-3-540-48085-3_26"},{"key":"9174_CR28","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.-C., Puget, J.-F.: A filtering algorithm for global sequencing constraints. In: Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming (CP\u201997), pp. 32\u201346 (1997)","DOI":"10.1007\/BFb0017428"},{"key":"9174_CR29","doi-asserted-by":"crossref","unstructured":"Sabin, D., Freuder, E.C.: Contradicting conventional wisdom in constraint satisfaction. In: Proceedings of the 2nd Workshop on Principles and Practices of Constraint Programming (PPCP\u201994), LNCS 874, Springer, pp. 10\u201320. Rosario, Orcas Island, Washington, USA (1994)","DOI":"10.1007\/3-540-58601-6_86"},{"key":"9174_CR30","unstructured":"Smith, B.: Succeed-first or fail-first: a case study in variable and value ordering heuristics. In: Proceedings of the 3rd Conference on the Practical Applications of Constraint Technology (PACT\u201997), pp. 321\u2013330. London, UK (1997)"},{"issue":"3","key":"9174_CR31","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1016\/j.ejor.2007.04.033","volume":"191","author":"C Solnon","year":"2008","unstructured":"Solnon, C., Cung, V.D., Nguyen, A., Artigues, C.: The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF\u201905 challenge problem. Eur. J. Oper. Res. 191(3), 912\u2013927 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9174_CR32","volume-title":"Foundations of Constraint Satisfaction","author":"E Tsang","year":"1993","unstructured":"Tsang, E.: Foundations of Constraint Satisfaction. Academic Press Ltd, London (1993)"},{"key":"9174_CR33","unstructured":"Walsh, T.: Depth-bounded discrepancy search. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI\u201997), vol.\u00a02, pp. 1388\u20131395. Nagoya, Japan (1997)"},{"issue":"2","key":"9174_CR34","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0167-6377(94)90064-7","volume":"16","author":"ED Wikum","year":"1994","unstructured":"Wikum, E.D., Llewellyn, D.C., Nemhauser, G.L.: One-machine generalized precedence constrained scheduling problems. Oper. Res. Lett. 16(2), 87\u201399 (1994)","journal-title":"Oper. Res. Lett."},{"key":"9174_CR35","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1016\/j.artint.2007.04.001","volume":"171","author":"K Xu","year":"2007","unstructured":"Xu, K., Boussemart, F., Hemery, F., Lecoutre, C.: Random constraint satisfaction: easy generation of hard (satisfiable) instances. Artif. Intell. 171, 514\u2013534 (2007)","journal-title":"Artif. Intell."},{"key":"9174_CR36","unstructured":"Zhang, Y., Yap, R.H.C.: Making AC-3 an optimal algorithm. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI\u201901), pp. 316\u2013321. Seattle, Washington, USA (2001)"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-012-9174-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-012-9174-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-012-9174-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T14:48:43Z","timestamp":1561301323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-012-9174-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,16]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9174"],"URL":"https:\/\/doi.org\/10.1007\/s10852-012-9174-8","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,16]]}}}