{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:38Z","timestamp":1750307798030,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,3,16]],"date-time":"2008-03-16T00:00:00Z","timestamp":1205625600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,3,16]]},"DOI":"10.1145\/1363686.1363727","type":"proceedings-article","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T13:04:11Z","timestamp":1209474251000},"page":"151-155","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Modeling adversary scheduling with QCSP\n            <sup>+<\/sup>"],"prefix":"10.1145","author":[{"given":"Marco","family":"Benedetti","sequence":"first","affiliation":[{"name":"Universit\u00e9 d'Orl\u00e9ans - LIFO, Orl\u00e9ans"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Lallouet","sequence":"additional","affiliation":[{"name":"Universit\u00e9 d'Orl\u00e9ans - LIFO, Orl\u00e9ans"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00e9mie","family":"Vautard","sequence":"additional","affiliation":[{"name":"Universit\u00e9 d'Orl\u00e9ans - LIFO, Orl\u00e9ans"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,3,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(93)90068-A"},{"key":"e_1_3_2_1_2_1","first-page":"275","volume-title":"AAAI","author":"Ans\u00f3tegui C.","year":"2005"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/558174"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"J. F.\n       \n      Bard\n    .\n      \n  \n   \n  Practical Bilevel Optimization: Algorithms and Applications volume \n  30\n   of \n  Nonconvex Optimization and Its Applications\n  . \n  Kluwer Academic Publishers 1999\n  .   J. F. Bard. Practical Bilevel Optimization: Algorithms and Applications volume 30 of Nonconvex Optimization and Its Applications . Kluwer Academic Publishers 1999.","DOI":"10.1007\/978-1-4757-2836-1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"N.\n       \n      Beldiceanu\n     and \n      \n      \n      M.\n       \n      Carlsson\n      \n  \n  . \n  A New Multi-resource Cumulatives Constraint with Negative Heights. In Pascal Van Hentenryck editor CP volume \n  2470\n   of \n  Lecture Notes in Computer Science pages \n  63\n  --\n  79\n  . \n  Springer 2002\n  .   N. Beldiceanu and M. Carlsson. A New Multi-resource Cumulatives Constraint with Negative Heights. In Pascal Van Hentenryck editor CP volume 2470 of Lecture Notes in Computer Science pages 63--79. Springer 2002.","DOI":"10.1007\/3-540-46135-3_5"},{"key":"e_1_3_2_1_6_1","first-page":"38","volume-title":"International Joint Conference on Artificial Intelligence","author":"Benedetti M.","year":"2007"},{"key":"e_1_3_2_1_7_1","first-page":"56","volume-title":"IJCAI","author":"Bidot J.","year":"2007"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"L.\n       \n      Bordeaux\n     and \n      \n      \n      E.\n       \n      Monfroy\n      \n  \n  . \n  Beyond NP: Arc-Consistency for Quantified Constraints. In P. Van Hentenryck editor Principles and Practice of Constraint Programming volume \n  2470\n   of \n  LNCS pages \n  371\n  --\n  386 Ithaca NY USA 2002\n  . \n  Springer\n  .   L. Bordeaux and E. Monfroy. Beyond NP: Arc-Consistency for Quantified Constraints. In P. Van Hentenryck editor Principles and Practice of Constraint Programming volume 2470 of LNCS pages 371--386 Ithaca NY USA 2002. Springer.","DOI":"10.1007\/3-540-46135-3_25"},{"key":"e_1_3_2_1_9_1","series-title":"Operations Research\/Computer Science Interfaces Series","volume-title":"The Next Wave in Computing, Optimization and Decision","author":"Brown G. G.","year":"2005"},{"volume-title":"Morgan Kaufmann","year":"2004","author":"Ghallab M.","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"R. Kolisch C. Schwindt and A. Sprecher. Benchmark Instances for Project Scheduling Problems 1998.  R. Kolisch C. Schwindt and A. Sprecher. Benchmark Instances for Project Scheduling Problems 1998.","DOI":"10.1007\/978-1-4615-5533-9_9"},{"key":"e_1_3_2_1_13_1","first-page":"496","volume":"3258","author":"Policella S. F.","year":"2004","journal-title":"Generating Robust Partial Order Schedules. In M. Wallace, editor, Principles and Practice of Constraint Programming"},{"volume-title":"University of St Andrews","year":"2007","author":"Nightingale P.","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","unstructured":"C. H. Papadimitriou. Computational Complexity. Addison Wesley 1994.  C. H. Papadimitriou. Computational Complexity . Addison Wesley 1994."},{"key":"e_1_3_2_1_16_1","unstructured":"N. Policella. Scheduling with Uncertainty: A Proactive Approach Using Partial Order Schedules. PhD thesis University of Rome \"La Sapienza\" March 2005.  N. Policella. Scheduling with Uncertainty: A Proactive Approach Using Partial Order Schedules . PhD thesis University of Rome \"La Sapienza\" March 2005."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11754602_9"},{"volume-title":"ICAPS 2006 Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems","year":"2006","author":"Wu C. W.","key":"e_1_3_2_1_18_1"}],"event":{"name":"SAC '08: The 2008 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Fortaleza, Ceara Brazil","acronym":"SAC '08"},"container-title":["Proceedings of the 2008 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1363686.1363727","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1363686.1363727","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:28Z","timestamp":1750254988000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1363686.1363727"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,16]]},"references-count":18,"alternative-id":["10.1145\/1363686.1363727","10.1145\/1363686"],"URL":"https:\/\/doi.org\/10.1145\/1363686.1363727","relation":{},"subject":[],"published":{"date-parts":[[2008,3,16]]},"assertion":[{"value":"2008-03-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}