{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:26:51Z","timestamp":1725499611991},"publisher-location":"London","reference-count":19,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781852339081"},{"type":"electronic","value":"9781846281037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-84628-103-2_6","type":"book-chapter","created":{"date-parts":[[2007,12,31]],"date-time":"2007-12-31T00:09:30Z","timestamp":1199059770000},"page":"81-94","source":"Crossref","is-referenced-by-count":0,"title":["A Non-Binary Constraint Ordering Approach to Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Miguel A.","family":"Salido","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Barber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"T.M. Al-Khamis, S. Vemuri, L. Lemonidis, and J. Yellen, \u2018Unit maintenance scheduling with fuel constraints\u2019, IEEE Trans. on Power Systems, 933\u2013939, (1992).","DOI":"10.1109\/59.141807"},{"key":"6_CR2","unstructured":"R. Bart\u00e1k, \u2018Constraint programming: In pursuit of the holy grail\u2019, in Proceedings of WDS99 (invited lecture), Prague, June, (1999)."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"C. Bessire, \u2018Non-binary constraints\u2019, In Proc. Principles and Practice of Constraint Programming (CP-99), 24\u201327, (1999).","DOI":"10.1007\/978-3-540-48085-3_2"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"C. Bessire, P. Meseguer, E.C. Freuder, and J. Larrosa, \u2018On forward checking for non-binary constraint satisfaction\u2019, Artifical Intelligence, 205\u2013224, (2002).","DOI":"10.1016\/S0004-3702(02)00263-1"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1145\/361219.361224","volume":"18","author":"J.R. Bitner","year":"1975","unstructured":"J.R. Bitner and E.M. Reingold, \u2018Backtracking programming techniques\u2019, Communications of the ACM 18, 651\u2013655, (1975).","journal-title":"Communications of the ACM"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0004-3702(94)90068-X","volume":"68","author":"R. Dechter","year":"1994","unstructured":"R. Dechter and I. Meiri, \u2018Experimental evaluation of preprocessing algorithms for constraints satisfaction problems\u2019, Artificial Intelligence, 68, 211\u2013241, (1994).","journal-title":"Artificial Intelligence"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","volume":"34","author":"R. Dechter","year":"1988","unstructured":"R. Dechter and J. Pearl, \u2018Network-based heuristics for constraint satisfaction problems\u2019, Artificial Intelligence, 34, 1\u201338, (1988).","journal-title":"Artificial Intelligence"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1109\/82.700929","volume":"45","author":"T.C. Denk","year":"1998","unstructured":"T.C. Denk and K.K. Parhi, \u2018Exhaustive scheduling and retiming of digital signal processing systems\u2019, in IEEE Transactions on Circuits and Systems-II: Analog and Digital Signal Processing, 45, 821\u2013837, (1998).","journal-title":"IEEE Transactions on Circuits and Systems-II: Analog and Digital Signal Processing"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"E. Freuder","year":"1982","unstructured":"E. Freuder, \u2018A sufficient condition for backtrack-free search\u2019, Journal of the ACM, 29, 24\u201332, (1982).","journal-title":"Journal of the ACM"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1018906911996","volume":"26","author":"D. Frost","year":"1999","unstructured":"D. Frost and R. Dechter, \u2018Maintenance scheduling problems as benchmarks for constraint algorithms\u2019, Annals of Mathematics and Artificial Intelligence, 26, 149\u2013170, (1999).","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"6_CR11","unstructured":"P.A. Geelen, \u2018Dual viewpoint heuristic for binary constraint satisfaction problems\u2019, In proceeding of European Conference of Artificial Intelligence (ECAI\u201992), 31\u201335, (1992)."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"I.P. Gent, E. MacIntyre, P. Prosser, and T Walsh, \u2018The constrainedness of arc consistency\u2019, Principles and Practice of Constraint Programming, 327\u2013340, (1997).","DOI":"10.1007\/BFb0017449"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R. Haralick","year":"1980","unstructured":"R. Haralick and Elliot G., \u2018Increasing tree efficiency for constraint satisfaction problems\u2019, Artificial Intelligence, 14, 263\u2013314, (1980).","journal-title":"Artificial Intelligence"},{"key":"6_CR14","volume-title":"Algorithms and Heuristics for total and partial Constraint Satisfaction","author":"J. Larrosa","year":"1998","unstructured":"J. Larrosa, Algorithms and Heuristics for total and partial Constraint Satisfaction, Phd Dissertation, UPC, Barcelona, 1998."},{"key":"6_CR15","unstructured":"L. Ros, T. Creemers, E. Tourouta, and J. Riera, \u2018A global constraint model for integrated routeing and scheduling on a transmission network\u2019, in Proc. 7th International Conference on Information Networks, System and Technologies, Minsk, Belarus, (2001)."},{"key":"6_CR16","unstructured":"N. Sadeh and M.S. Fox, \u2018Variable and value ordering heuristics for activity-based jobshop scheduling\u2019, In proc. of Fourth International Conference on Expert Systems in Production and Operations Management, 134\u2013144, (1990)."},{"key":"6_CR17","unstructured":"M.A. Salido and F. Barber, \u2018Distributed constraint satisfaction problems for resource allocation\u2019, In Proceeding of AAMAS Workshop on Representation and approaches for Time-Critical Decentralized Resource\/Role\/Task Allocation, 95\u2013104, (2003)."},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0950-7051(03)00029-7","volume":"16","author":"M.A. Salido","year":"2003","unstructured":"M.A. Salido and F. Barber, \u2018A Polynomial Algorithm for Continuous Non-binary Disjunctive CSPs: Extended DLRs\u2019, Knowledge Based Systems. Ed. Elsevier Science, 16, 277\u2013285, (2003).","journal-title":"Knowledge Based Systems. Ed. Elsevier Science"},{"key":"6_CR19","volume-title":"Foundation of Constraint Satisfaction","author":"E. Tsang","year":"1993","unstructured":"E. Tsang, Foundation of Constraint Satisfaction, Academic Press, London and San Diego, 1993."}],"container-title":["Applications and Innovations in Intelligent Systems XII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-84628-103-2_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:47:30Z","timestamp":1619542050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-84628-103-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9781852339081","9781846281037"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/1-84628-103-2_6","relation":{},"subject":[]}}