{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:46Z","timestamp":1740122446023,"version":"3.37.3"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T00:00:00Z","timestamp":1622851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T00:00:00Z","timestamp":1622851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Gaspard Monge Program for Optimization, operations research, and their interactions with data science.","award":["project 2018-0062H"],"award-info":[{"award-number":["project 2018-0062H"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10878-021-00758-6","type":"journal-article","created":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T16:03:04Z","timestamp":1622908984000},"page":"2460-2481","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A data structure for efficiently managing a set of energy functions"],"prefix":"10.1007","volume":"44","author":[{"given":"Jacques","family":"Carlier","sequence":"first","affiliation":[]},{"given":"Antoine","family":"Jouglet","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Pinson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1528-4849","authenticated-orcid":false,"given":"Abderrahim","family":"Sahli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,5]]},"reference":[{"key":"758_CR1","first-page":"1259263","volume":"3","author":"G Adelson-Velskii","year":"1962","unstructured":"Adelson-Velskii G, Landis E (1962) An algorithm for the organization of information. Sov Math Dokl 3:1259263","journal-title":"Sov Math Dokl"},{"key":"758_CR2","volume-title":"Constraint-based scheduling, applying constraint programming to scheduling problems, international series in operations research and management science","author":"P Baptiste","year":"2001","unstructured":"Baptiste P, Le Pape C, Nuijten W (2001) Constraint-based scheduling, applying constraint programming to scheduling problems, international series in operations research and management science. Kluwer, Philadelphia"},{"key":"758_CR3","unstructured":"Carlier J (1984) Probl\u00e8mes d\u2019ordonnancement \u00e0 contraintes de ressources : algorithmes et complexit\u00e9. Ph.D. thesis, Universit\u00e9 Pierre et Marie Curie (Paris VI). Doctorat d\u2019\u00e9tat es Sciences"},{"key":"758_CR4","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1016\/j.ejor.2020.03.079","volume":"286","author":"J Carlier","year":"2020","unstructured":"Carlier J, Pinson E, Sahli A, Jouglet A (2020) An $$o(n^2)$$ algorithm for time-bound adjustments for the cumulative scheduling problem. Eur J Oper Res 286:468\u2013476","journal-title":"Eur J Oper Res"},{"key":"758_CR5","unstructured":"Erschler J, Lopez P (1990) Energy-based approach for task scheduling under time and resources constraints. In: Proceedings of the $$2^{\\rm nd}$$ international workshop on project management and scheduling, pp 115\u2013121"},{"key":"758_CR6","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.ejor.2010.11.008","volume":"212","author":"A Jouglet","year":"2011","unstructured":"Jouglet A, Carlier J (2011) Dominance rules in combinatorial optimization problems. Eur J Oper Res 212:433\u2013444. https:\/\/doi.org\/10.1016\/j.ejor.2010.11.008","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00758-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00758-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00758-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:19:29Z","timestamp":1665778769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00758-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,5]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["758"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00758-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,6,5]]},"assertion":[{"value":"15 May 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Authors have received the conference best paper award at IESM\u20192019 on a preliminary version of this paper. The authors declare that they have no other conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}