{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:46:11Z","timestamp":1725594371868},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/wsc40007.2019.9004780","type":"proceedings-article","created":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T01:30:05Z","timestamp":1582248605000},"page":"2131-2141","source":"Crossref","is-referenced-by-count":1,"title":["Throughput Control and Giveaway Minimization of a Poultry Product Batcher"],"prefix":"10.1109","author":[{"given":"Kay","family":"Peeters","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivo","family":"Adan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tugce","family":"Martagan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(84)90004-X"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-009-0116-x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2307\/1910412"},{"key":"ref6","first-page":"557","article-title":"Better approximation algorithms for bin covering","author":"csirik","year":"2001","journal-title":"Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.04.005"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1108\/00070700410561414"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.02.003"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972863.8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2017.8248093"},{"key":"ref1","article-title":"On-line Algorithms for Bin-covering Problems with Known Item Distributions","author":"asgeirsson","year":"2014","journal-title":"Ph D thesis"}],"event":{"name":"2019 Winter Simulation Conference (WSC)","start":{"date-parts":[[2019,12,8]]},"location":"National Harbor, MD, USA","end":{"date-parts":[[2019,12,11]]}},"container-title":["2019 Winter Simulation Conference (WSC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8977453\/9004651\/09004780.pdf?arnumber=9004780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T17:49:26Z","timestamp":1658080166000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9004780\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/wsc40007.2019.9004780","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}