{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:45Z","timestamp":1720640805321},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1016\/j.endm.2018.03.016","type":"journal-article","created":{"date-parts":[[2018,4,12]],"date-time":"2018-04-12T11:23:25Z","timestamp":1523532205000},"page":"119-126","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["A variable neighborhood search for multi-family capacitated lot-sizing problem"],"prefix":"10.1016","volume":"66","author":[{"given":"Jerzy","family":"Duda","sequence":"first","affiliation":[]},{"given":"Adam","family":"Stawowy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2018.03.016_br0010","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.omega.2015.03.002","article-title":"Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems","volume":"56","author":"Chen","year":"2015","journal-title":"Omega"},{"key":"10.1016\/j.endm.2018.03.016_br0020","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1016\/j.cor.2006.05.010","article-title":"Lot sizing and furnace scheduling in small foundries","volume":"35","author":"de Araujo","year":"2008","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.endm.2018.03.016_br0030","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.endm.2017.03.014","article-title":"A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem","volume":"58","author":"Duda","year":"2017","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"10.1016\/j.endm.2018.03.016_br0040","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1057\/palgrave.jors.2602132","article-title":"AI and OR in management of operations: history and trends","volume":"58","author":"Kobbacy","year":"2007","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.endm.2018.03.016_br0050","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.endm.2018.03.016_br0060","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.cor.2012.07.002","article-title":"Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems","volume":"40","author":"Seeanner","year":"2013","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.endm.2018.03.016_br0070","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.endm.2012.10.018","article-title":"A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems","volume":"39","author":"Zhao","year":"2012","journal-title":"Electronic Notes in Discrete Mathematics"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065318300623?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065318300623?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T10:24:21Z","timestamp":1534933461000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065318300623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":7,"alternative-id":["S1571065318300623"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2018.03.016","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2018,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A variable neighborhood search for multi-family capacitated lot-sizing problem","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.endm.2018.03.016","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}