{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T03:07:24Z","timestamp":1781752044014,"version":"3.54.5"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,11]],"date-time":"2017-12-11T00:00:00Z","timestamp":1512950400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771251"],"award-info":[{"award-number":["11771251"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71771138"],"award-info":[{"award-number":["71771138"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10878-017-0228-8","type":"journal-article","created":{"date-parts":[[2017,12,11]],"date-time":"2017-12-11T04:58:37Z","timestamp":1512968317000},"page":"319-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Two-stage medical supply chain scheduling with an assignable common due window and shelf life"],"prefix":"10.1007","volume":"37","author":[{"given":"Long","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qingguo","family":"Bai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,12,11]]},"reference":[{"key":"228_CR1","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.asoc.2016.06.005","volume":"47","author":"P Assarzadegan","year":"2016","unstructured":"Assarzadegan P, Rasti-Barzoki M (2016) Minimizing sum of the due date assignment costs, maximum tardiness and distribution costs in a supply chain scheduling problem. Appl Soft Comput 47:343\u2013356","journal-title":"Appl Soft Comput"},{"key":"228_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10479-013-1415-3","volume":"211","author":"B Bilgen","year":"2013","unstructured":"Bilgen B, \u00c7elebi Y (2013) Integrated production scheduling and distribution planning in dairy supply chain by hybrid modelling. Ann Oper Res 211:55\u201382","journal-title":"Ann Oper Res"},{"key":"228_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0377-2217(95)00133-6","volume":"93","author":"Z Chen","year":"1996","unstructured":"Chen Z (1996) Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs. Eur J Oper Res 93:49\u201360","journal-title":"Eur J Oper Res"},{"key":"228_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0548(88)90001-9","volume":"15","author":"T Cheng","year":"1988","unstructured":"Cheng T (1988) Optimal common due-date with limited completion time deviation. Comput Oper Res 15:91\u201396","journal-title":"Comput Oper Res"},{"key":"228_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-27679-3_9","volume":"33","author":"M Entrup","year":"2005","unstructured":"Entrup M, Grunow M, G\u00fcnther H, Beek T (2005) An milp modelling approach for shelf life integrated planning in yoghurt production. Oper Res Proc 33:67\u201375","journal-title":"Oper Res Proc"},{"key":"228_CR6","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1007\/s10878-015-9857-y","volume":"30","author":"J Fan","year":"2015","unstructured":"Fan J, Lu X (2015) Supply chain scheduling problem in the hospital with periodic working time on a single machine. J Comb Optim 30:892\u2013905","journal-title":"J Comb Optim"},{"key":"228_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2015\/464390","volume":"2015","author":"H Gong","year":"2015","unstructured":"Gong H, Zhang B, Peng W (2015) Scheduling and common due date assignment on a single parallel-batching machine with batch delivery. Discrete Dyn Nat Soc 2015:1\u20137","journal-title":"Discrete Dyn Nat Soc"},{"key":"228_CR8","first-page":"163","volume-title":"An milp modelling approach for shelf life integrated planning and scheduling in scalded sausage production","author":"H G\u00fcnther","year":"2006","unstructured":"G\u00fcnther H, Beek P, Grunow M, Entrup M, Zhang S (2006) An milp modelling approach for shelf life integrated planning and scheduling in scalded sausage production. Deutscher Universit\u00e4ts-Verlag, Wiesbaden, pp 163\u2013188"},{"key":"228_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12159-016-0145-8","volume":"9","author":"Z Hammoudan","year":"2016","unstructured":"Hammoudan Z, Grunder O, Boudouh T, El Moudni A (2016) A coordinated scheduling of delivery and inventory in a multi-location hospital supplied with a central pharmacy. Logist Res 9:1\u201318","journal-title":"Logist Res"},{"key":"228_CR10","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/0377-2217(93)90239-J","volume":"70","author":"J Hermann","year":"1993","unstructured":"Hermann J, Lee C (1993) On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date. Eur J Oper Res 70:272\u2013288","journal-title":"Eur J Oper Res"},{"key":"228_CR11","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1016\/j.cie.2011.01.017","volume":"60","author":"C Hsu","year":"2011","unstructured":"Hsu C, Yang S, Yang D (2011) Two due date assignment problems with position-dependent processing time on a single-machine. Comput Ind Eng 60:796\u2013800","journal-title":"Comput Ind Eng"},{"key":"228_CR12","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1007\/s10878-015-9854-1","volume":"30","author":"L Liu","year":"2015","unstructured":"Liu L, Tang G, Fan B, Wang X (2015) Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process. J Comb Optim 30:938\u2013948","journal-title":"J Comb Optim"},{"key":"228_CR13","first-page":"404","volume":"251","author":"M Mohammadi","year":"2015","unstructured":"Mohammadi M, Musa S, Bahreininejad A (2015) Optimization of economic lot scheduling problem with backordering and shelf-life considerations using calibrated metaheuristic algorithms. Appl Math Comput 251:404\u2013422","journal-title":"Appl Math Comput"},{"key":"228_CR14","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1007\/s10878-016-0049-1","volume":"33","author":"B Mor","year":"2017","unstructured":"Mor B, Mosheiov G (2017) A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance. J Comb Optim 33:1454\u20131468","journal-title":"J Comb Optim"},{"key":"228_CR15","first-page":"387","volume":"13","author":"Y Nesterov","year":"1994","unstructured":"Nesterov Y, Nemirovski A (1994) Interior point polynomial methods in convex programming: theory and application. SIAM Stud Appl Math 13:387\u2013402","journal-title":"SIAM Stud Appl Math"},{"key":"228_CR16","doi-asserted-by":"publisher","first-page":"2218","DOI":"10.1016\/j.cor.2010.03.012","volume":"37","author":"D Shabtay","year":"2010","unstructured":"Shabtay D, Itskovich Y, Yedidsion L, Oron D (2010) Optimal due date assignment and resource allocation in a group technology scheduling environment. Comput Oper Res 37:2218\u20132228","journal-title":"Comput Oper Res"},{"key":"228_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/nav.21731","volume":"64","author":"D Wang","year":"2017","unstructured":"Wang D, Yin Y, Cheng T (2017) A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times. Nav Res Logist 64:41\u201363","journal-title":"Nav Res Logist"},{"key":"228_CR18","first-page":"371","volume":"9","author":"Y Wang","year":"2011","unstructured":"Wang Y (2011) Analysis of the management of medicine logistics in China. Guide China Med 9:371\u2013373 (in Chinese)","journal-title":"Guide China Med"},{"key":"228_CR19","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.omega.2012.06.004","volume":"41","author":"C Yan","year":"2013","unstructured":"Yan C, Liao Y, Banerjee A (2013) Multi-product lot scheduling with backordering and shelf-life constraints. Omega 41:510\u2013516","journal-title":"Omega"},{"key":"228_CR20","doi-asserted-by":"publisher","first-page":"2767","DOI":"10.1109\/TAC.2010.2049766","volume":"55","author":"W Yeung","year":"2010","unstructured":"Yeung W, Choi T, Cheng T (2010) Optimal scheduling of a single-supplier single-manufacturer supply chain with common due windows. IEEE Trans Autom Control 55:2767\u20132777","journal-title":"IEEE Trans Autom Control"},{"key":"228_CR21","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.cie.2012.02.015","volume":"63","author":"Y Yin","year":"2012","unstructured":"Yin Y, Cheng T, Xu D, Wu C (2012) Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost. Comput Ind Eng 63:223\u2013234","journal-title":"Comput Ind Eng"},{"key":"228_CR22","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.omega.2012.06.002","volume":"41","author":"Y Yin","year":"2013","unstructured":"Yin Y, Cheng T, Hsu C, Wu C (2013a) Single-machine batch delivery scheduling with an assignable common due window. Omega 41:216\u2013225","journal-title":"Omega"},{"key":"228_CR23","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.disopt.2012.10.003","volume":"10","author":"Y Yin","year":"2013","unstructured":"Yin Y, Cheng T, Wang J, Wu C (2013b) Single-machine common due window assignment and scheduling to minimize the total cost. Discrete Optim 10:42\u201353","journal-title":"Discrete Optim"},{"key":"228_CR24","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1057\/jors.2016.14","volume":"67","author":"Y Yin","year":"2016","unstructured":"Yin Y, Wang D, Cheng T, Wu C (2016a) Bi-criterion single-machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times. J Oper Res Soc 67:1169\u20131183","journal-title":"J Oper Res Soc"},{"key":"228_CR25","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.cie.2015.12.003","volume":"92","author":"Y Yin","year":"2016","unstructured":"Yin Y, Wang Y, Cheng T, Wang D, Wu C (2016b) Two-agent single-machine scheduling to minimize the batch delivery cost. Comput Ind Eng 92:16\u201330","journal-title":"Comput Ind Eng"},{"key":"228_CR26","first-page":"126","volume":"21","author":"L Zhang","year":"2017","unstructured":"Zhang L (2017) Two-stage supply chain scheduling with a limited holding time. Oper Res T 21:126\u2013134 (in Chinese)","journal-title":"Oper Res T"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0228-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0228-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0228-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T00:28:25Z","timestamp":1547857705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0228-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,11]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["228"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0228-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,11]]},"assertion":[{"value":"11 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}