{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:02:55Z","timestamp":1648674175155},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,12,19]],"date-time":"2008-12-19T00:00:00Z","timestamp":1229644800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s10288-008-0092-6","type":"journal-article","created":{"date-parts":[[2008,12,17]],"date-time":"2008-12-17T23:22:46Z","timestamp":1229556166000},"page":"275-288","source":"Crossref","is-referenced-by-count":5,"title":["Minimum Formwork Stock problem on residential buildings construction sites"],"prefix":"10.1007","volume":"7","author":[{"given":"Thierry","family":"Benoist","sequence":"first","affiliation":[]},{"given":"Antoine","family":"Jeanjean","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Molin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,12,19]]},"reference":[{"key":"92_CR1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D Applegate","year":"1991","unstructured":"Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3:149\u2013156","journal-title":"ORSA J Comput"},{"key":"92_CR2","doi-asserted-by":"crossref","unstructured":"Benoist T (2007) Towards optimal formwork pairing on construction sites. RAIRO Oper Res (To appear)","DOI":"10.1051\/ro:2007035"},{"key":"92_CR3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/0-306-48056-5_2","volume-title":"Handbook of metaheuristics","author":"M Gendreau","year":"2003","unstructured":"Gendreau M (2003) An introduction to tabu search. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. Kluwer Academic Publishers, Boston, pp 37\u201354"},{"key":"92_CR4","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. Complexity of Computer Comput, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"92_CR5","unstructured":"Laburthe F (2000) Choco: implementing a cp kernel. In: Proceedings of TRICS, a post-conference workshop of CP 2000, Singapore, 2000"},{"key":"92_CR6","unstructured":"LePape C, Baptiste P (1999) Unpublished work"},{"key":"92_CR7","doi-asserted-by":"crossref","unstructured":"Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. Technical report, ILOG S.A., Gentilly, France","DOI":"10.1007\/3-540-49481-2_30"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-008-0092-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-008-0092-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-008-0092-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T08:12:55Z","timestamp":1559117575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-008-0092-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,19]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["92"],"URL":"https:\/\/doi.org\/10.1007\/s10288-008-0092-6","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,19]]}}}