{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:57:17Z","timestamp":1757627837536,"version":"3.44.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,12,8]],"date-time":"1999-12-08T00:00:00Z","timestamp":944611200000},"content-version":"vor","delay-in-days":1437,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1016\/0305-0548(95)o0020-t","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:16:12Z","timestamp":1027602972000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"title":["How to avoid stockouts when producing several items on a single facility? What to do if you can't?"],"prefix":"10.1016","volume":"23","author":[{"given":"Guillermo","family":"Gallego","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilkyeong","family":"Moon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(95)O0020-T_BIB1","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1287\/opre.38.6.1079","article-title":"Testing feasibility in the lot scheduling problem","volume":"38","author":"Anderson","year":"1990","journal-title":"Ops Res."},{"year":"1974","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","key":"10.1016\/0305-0548(95)O0020-T_BIB2"},{"key":"10.1016\/0305-0548(95)O0020-T_BIB3","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.35.5.764","article-title":"The economic lot-scheduling problem: achieving feasibility using time-varying lot sizes","volume":"35","author":"Dobson","year":"1987","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(95)O0020-T_BIB4","doi-asserted-by":"crossref","first-page":"1579","DOI":"10.1287\/mnsc.36.12.1579","article-title":"Scheduling the production of several items with random demands in a single facility","volume":"36","author":"Gallego","year":"1990","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)O0020-T_BIB5","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1287\/opre.40.3.614","article-title":"The effect of externalizing setups in the economic lot scheduling problem","volume":"40","author":"Gallego","year":"1992","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(95)O0020-T_BIB6","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1002\/1520-6750(199508)42:5<773::AID-NAV3220420505>3.0.CO;2-F","article-title":"Strategic investments to reduce setup times in the economic lot scheduling problem","volume":"42","author":"Gallego","year":"1995","journal-title":"Nav. Res. Logist."},{"key":"10.1016\/0305-0548(95)O0020-T_BIB7","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1002\/1520-6750(199208)39:5<729::AID-NAV3220390510>3.0.CO;2-N","article-title":"The economic lot scheduling problem with finite backorder costs","volume":"39","author":"Gallego","year":"1992","journal-title":"Nav. Res. Logist."},{"key":"10.1016\/0305-0548(95)O0020-T_BIB8","doi-asserted-by":"crossref","first-page":"2795","DOI":"10.1080\/00207549408957100","article-title":"Multiproduct economic lot size models with investment costs for setup reduction and quality improvement: review and extensions","volume":"32","author":"Moon","year":"1994","journal-title":"Int. J. prod. Res."},{"key":"10.1016\/0305-0548(95)O0020-T_BIB9","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1287\/opre.39.1.56","article-title":"Computational optimal lot sizes in the economic lot scheduling problem","volume":"39","author":"Zipkin","year":"1991","journal-title":"Ops Res."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895O0020T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895O0020T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:56:08Z","timestamp":1757480168000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054895O0020T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["0305054895O0020T"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(95)o0020-t","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[1996,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"How to avoid stockouts when producing several items on a single facility? What to do if you can't?","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0305-0548(95)O0020-T","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}