{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T01:32:01Z","timestamp":1768267921075,"version":"3.49.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030584740","type":"print"},{"value":"9783030584757","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58475-7_36","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"620-636","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Solving the Group Cumulative Scheduling Problem with CPO and ACO"],"prefix":"10.1007","author":[{"given":"Lucas","family":"Groleaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samba N.","family":"Ndiaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Solnon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"issue":"7","key":"36_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N.: Extending chip in order to solve complex scheduling and placement problems. Math. Comput. Model. 17(7), 57\u201373 (1993). https:\/\/doi.org\/10.1016\/0895-7177(93)90068-A","journal-title":"Math. Comput. Model."},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.dam.2017.05.001","volume":"234","author":"P Baptiste","year":"2018","unstructured":"Baptiste, P., Bonifas, N.: Redundant cumulative constraints to compute preemptive bounds. Disc. Appl. Math. 234, 168\u2013177 (2018). https:\/\/doi.org\/10.1016\/j.dam.2017.05.001","journal-title":"Disc. Appl. Math."},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1613\/jair.2169","volume":"29","author":"JC Beck","year":"2007","unstructured":"Beck, J.C.: Solution-guided multi-point constructive search for job shop scheduling. J. Artif. Intell. Res. 29, 49\u201377 (2007)","journal-title":"J. Artif. Intell. Res."},{"issue":"6","key":"36_CR4","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11(6), 4135\u20134151 (2011)","journal-title":"Appl. Soft Comput."},{"key":"36_CR5","unstructured":"Bonifas, N.: A O(n 2 log(n)) propagation for the Energy Reasoning, February 2016"},{"issue":"1","key":"36_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., M\u00f6hring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112(1), 3\u201341 (1999). https:\/\/doi.org\/10.1016\/S0377-2217(98)00204-5","journal-title":"Eur. J. Oper. Res."},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-030-30048-7_9","volume-title":"Principles and Practice of Constraint Programming","author":"G Da Col","year":"2019","unstructured":"Da Col, G., Teppan, E.C.: Industrial size job shop scheduling tackled by present day CP solvers. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 144\u2013160. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_9"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-38516-2_16","volume-title":"Hybrid Metaheuristics","author":"L Di Gaspero","year":"2013","unstructured":"Di Gaspero, L., Rendl, A., Urli, T.: A hybrid ACO+CP for balancing bicycle sharing systems. In: Blesa, M.J., Blum, C., Festa, P., Roli, A., Sampels, M. (eds.) HM 2013. LNCS, vol. 7919, pp. 198\u2013212. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38516-2_16"},{"key":"36_CR9","doi-asserted-by":"publisher","unstructured":"Groleaz, L., Ndiaye, S.N., Solnon, C.: ACO with automatic parameter selection for a scheduling problem with a group cumulative constraint. In: GECCO 2020 - Genetic and Evolutionary Computation Conference, Cancun, Mexico, pp. 1\u20139, July 2020. https:\/\/doi.org\/10.1145\/3377930.3389818","DOI":"10.1145\/3377930.3389818"},{"issue":"2","key":"36_CR10","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/S0377-2217(99)00485-3","volume":"127","author":"S Hartmann","year":"2000","unstructured":"Hartmann, S., Kolisch, R.: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 127(2), 394\u2013407 (2000). https:\/\/doi.org\/10.1016\/S0377-2217(99)00485-3","journal-title":"Eur. J. Oper. Res."},{"key":"36_CR11","unstructured":"Kashiwabara, T.: NP-completeness of the problem of finding a minimal-clique number interval graph containing a given graph as a subgraph. In: Proceedings of 1979 International Symposium Circuit System, pp. 657\u2013660 (1979)"},{"key":"36_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-87527-7_8","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"M Khichane","year":"2008","unstructured":"Khichane, M., Albert, P., Solnon, C.: Integration of ACO in a constraint programming language. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., St\u00fctzle, T., Winfield, A.F.T. (eds.) ANTS 2008. LNCS, vol. 5217, pp. 84\u201395. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87527-7_8"},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-13520-0_26","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"M Khichane","year":"2010","unstructured":"Khichane, M., Albert, P., Solnon, C.: Strong combination of ant colony optimization with constraint programming optimization. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 232\u2013245. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13520-0_26"},{"key":"36_CR14","unstructured":"Kotthoff, L.: LLAMA: leveraging Learning to Automatically Manage Algorithms. arXiv:1306.1031 [cs], June 2013"},{"issue":"2","key":"36_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0004-3702(02)00362-4","volume":"143","author":"P Laborie","year":"2003","unstructured":"Laborie, P.: Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results. Artif. Intell. 143(2), 151\u2013188 (2003). https:\/\/doi.org\/10.1016\/S0004-3702(02)00362-4","journal-title":"Artif. Intell."},{"issue":"2","key":"36_CR16","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","volume":"23","author":"P Laborie","year":"2018","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vil\u00edm, P.: IBM ILOG CP optimizer for scheduling: 20+ years of scheduling with constraints at IBM\/ILOG. Constraints 23(2), 210\u2013250 (2018). https:\/\/doi.org\/10.1007\/s10601-018-9281-x","journal-title":"Constraints"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Maniezzo, V., St\u00fctzle, T., Vo\u00df, S. (eds.): Matheuristics - Hybridizing Metaheuristics and Mathematical Programming. Annals of Information Systems, vol.\u00a010. Springer (2010)","DOI":"10.1007\/978-1-4419-1306-7"},{"issue":"1","key":"36_CR18","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1287\/ijoc.1070.0226","volume":"20","author":"L Mercier","year":"2008","unstructured":"Mercier, L., Van Hentenryck, P.: Edge finding for cumulative scheduling. INFORMS J. Comput. 20(1), 143\u2013153 (2008). https:\/\/doi.org\/10.1287\/ijoc.1070.0226","journal-title":"INFORMS J. Comput."},{"key":"36_CR19","doi-asserted-by":"publisher","unstructured":"Meyer, B.: Hybrids of constructive metaheuristics and constraint programming: a case study with ACO. In: Hybrid Metaheuristics, vol. 114, pp. 151\u2013183. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78295-7_6","DOI":"10.1007\/978-3-540-78295-7_6"},{"key":"36_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-28646-2_15","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"B Meyer","year":"2004","unstructured":"Meyer, B., Ernst, A.: Integrating ACO and constraint propagation. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 166\u2013177. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28646-2_15"},{"issue":"3","key":"36_CR21","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s001860200251","volume":"56","author":"K Neumann","year":"2003","unstructured":"Neumann, K., Schwindt, C.: Project scheduling with inventory constraints. Math. Methods Oper. Res. (ZOR) 56(3), 513\u2013533 (2003). https:\/\/doi.org\/10.1007\/s001860200251","journal-title":"Math. Methods Oper. Res. (ZOR)"},{"key":"36_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-642-40627-0_42","volume-title":"Principles and Practice of Constraint Programming","author":"P Ouellet","year":"2013","unstructured":"Ouellet, P., Quimper, C.-G.: Time-table extended-edge-finding for the cumulative constraint. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 562\u2013577. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_42"},{"key":"36_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling","author":"ML Pinedo","year":"2016","unstructured":"Pinedo, M.L.: Scheduling. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-26580-3"},{"issue":"4","key":"36_CR24","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0167-6377(95)00057-7","volume":"18","author":"J Schutten","year":"1996","unstructured":"Schutten, J.: List scheduling revisited. Oper. Res. Lett. 18(4), 167\u2013170 (1996). https:\/\/doi.org\/10.1016\/0167-6377(95)00057-7","journal-title":"Oper. Res. Lett."},{"key":"36_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming \u2014 CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49481-2_30"},{"key":"36_CR26","volume-title":"Constraint Programming with Ant Colony Optimization","author":"C Solnon","year":"2010","unstructured":"Solnon, C.: Constraint Programming with Ant Colony Optimization. John Wiley, Hoboken (2010). (232 pages)"},{"key":"36_CR27","doi-asserted-by":"publisher","unstructured":"St\u00fctzle, T., Hoos, H.: Improvements on the Ant-System: Introducing the MAX-MIN Ant System, pp. 245\u2013249. Springer, Vienna (1998). https:\/\/doi.org\/10.1007\/978-3-7091-6492-1_54","DOI":"10.1007\/978-3-7091-6492-1_54"},{"issue":"1","key":"36_CR28","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.engappai.2012.03.011","volume":"26","author":"R Tavares Neto","year":"2013","unstructured":"Tavares Neto, R., Godinho Filho, M.: Literature review regarding ant colony optimization applied to scheduling problems: guidelines for implementation and directions for future research. Eng. Appl. Artif. Intell. 26(1), 150\u2013161 (2013). https:\/\/doi.org\/10.1016\/j.engappai.2012.03.011","journal-title":"Eng. Appl. Artif. Intell."},{"key":"36_CR29","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.C. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 230\u2013245. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21311-3_22"}],"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-030-58475-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:38:30Z","timestamp":1619242710000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cp2020.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"122","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.13","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.47","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}