{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T08:13:02Z","timestamp":1745309582836},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T00:00:00Z","timestamp":1590537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T00:00:00Z","timestamp":1590537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the National Science Foundation of China","award":["11771251","71771138"],"award-info":[{"award-number":["11771251","71771138"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10878-020-00594-0","type":"journal-article","created":{"date-parts":[[2020,5,27]],"date-time":"2020-05-27T15:04:01Z","timestamp":1590591841000},"page":"2167-2179","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time"],"prefix":"10.1007","volume":"44","author":[{"given":"Long","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yuzhong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Qingguo","family":"Bai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,27]]},"reference":[{"key":"594_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":"594_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0377-2217(95)00133-6","volume":"93","author":"ZL Chen","year":"1996","unstructured":"Chen ZL (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":"594_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0548(88)90001-9","volume":"15","author":"TCE Cheng","year":"1988","unstructured":"Cheng TCE (1988) Optimal common due-date with limited completion time deviation. Comput Oper Res 15:91\u201396","journal-title":"Comput Oper Res"},{"key":"594_CR4","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.ijpe.2010.10.005","volume":"135","author":"TCE Cheng","year":"2012","unstructured":"Cheng TCE, Yang SJ, Yang DL (2012) Common due window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity. Int J Prod Econ 135:154\u2013161","journal-title":"Int J Prod Econ"},{"key":"594_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"4","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 4:287\u2013326","journal-title":"Ann Discrete Math"},{"key":"594_CR6","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/0377-2217(93)90239-J","volume":"70","author":"JW Hermann","year":"1993","unstructured":"Hermann JW, Lee CY (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":"594_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0167-6377(94)90078-7","volume":"15","author":"SD Liman","year":"1994","unstructured":"Liman SD, Rawaswamy S (1994) Earliness-tardiness scheduling problems with a common delivery window. Oper Res Lett 15:195\u2013203","journal-title":"Oper Res Lett"},{"key":"594_CR8","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0377-2217(95)00181-6","volume":"93","author":"SD Liman","year":"1996","unstructured":"Liman SD, Rawaswamy S, Thongmee S (1996) Determination of common due window location in a single machine scheduling problem. Eur J Oper Res 93:68\u201374","journal-title":"Eur J Oper Res"},{"key":"594_CR9","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1057\/palgrave.jors.2600601","volume":"49","author":"SD Liman","year":"1998","unstructured":"Liman SD, Rawaswamy S, Thongmee S (1998) Common due window size and location determination in a single machine scheduling problem. J Oper Res Soc 49:1007\u20131010","journal-title":"J Oper Res Soc"},{"key":"594_CR10","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 Combin Optim 33:1454\u20131468","journal-title":"J Combin Optim"},{"key":"594_CR11","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1057\/palgrave.jors.2602439","volume":"59","author":"G Mosheiov","year":"2008","unstructured":"Mosheiov G, Sarig A (2008) A due window assignment problem with position-dependent processing times. J Oper Res Soc 59:997\u20131003","journal-title":"J Oper Res Soc"},{"key":"594_CR12","doi-asserted-by":"publisher","first-page":"2541","DOI":"10.1016\/j.cor.2008.10.007","volume":"36","author":"G Mosheiov","year":"2009","unstructured":"Mosheiov G, Sarig A (2009) Scheduling a maintenance activity and due window assignment on a single machine. Comput Oper Res 36:2541\u20132545","journal-title":"Comput Oper Res"},{"key":"594_CR13","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1287\/opre.1080.0622","volume":"57","author":"E Selvarajah","year":"2009","unstructured":"Selvarajah E, Steiner G (2009) Approximation algorithms for the suppliers supply chain scheduling problem to minimize delivery and inventory holding costs. Oper Res 57:426\u2013438","journal-title":"Oper Res"},{"key":"594_CR14","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10479-013-1522-1","volume":"217","author":"E Selvarajah","year":"2014","unstructured":"Selvarajah E, Zhang R (2014) Supply chain scheduling to minimize holding costs with outsourcing. Ann Oper Res 217:479\u2013490","journal-title":"Ann Oper Res"},{"key":"594_CR15","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1016\/j.cor.2009.11.007","volume":"37","author":"SJ Yang","year":"2010","unstructured":"Yang SJ, Yang DL, Cheng TCE (2010) Single-machine due window assignment and scheduling with job-dependent aging effects and deteriorating maintenance. Comput Oper Res 37:1510\u20131514","journal-title":"Comput Oper Res"},{"key":"594_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1016094508744","volume":"108","author":"WK Yeung","year":"2001","unstructured":"Yeung WK, Oguz C, Cheng TCE (2001) Minimizing weighed number of early and tardy jobs with a common due window involving location penalty. Ann Oper Res 108:33\u201354","journal-title":"Ann Oper Res"},{"key":"594_CR17","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/S0925-5273(03)00044-6","volume":"90","author":"WK Yeung","year":"2004","unstructured":"Yeung WK, Oguz C, Cheng TCE (2004) Two-stage flow shop earliness and tardiness machine scheduling involving a common due window. Int J Prod Econ 90:421\u2013434","journal-title":"Int J Prod Econ"},{"key":"594_CR18","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1002\/nav.20356","volume":"56","author":"WK Yeung","year":"2009","unstructured":"Yeung WK, Oguz C, Cheng TCE (2009) Two-machine flow shop scheduling with due window to minimize weighted number of early and tardy jobs. Nav Res Logist 56:593\u2013599","journal-title":"Nav Res Logist"},{"key":"594_CR19","doi-asserted-by":"publisher","first-page":"2767","DOI":"10.1109\/TAC.2010.2049766","volume":"55","author":"WK Yeung","year":"2010","unstructured":"Yeung WK, Choi TM, Cheng TCE (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":"594_CR20","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":"594_CR21","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":"594_CR22","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":"594_CR23","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":"594_CR24","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 D, 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":"594_CR25","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 Trans 21:126\u2013134 (in Chinese)","journal-title":"Oper Res Trans"},{"key":"594_CR26","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10878-017-0228-8","volume":"37","author":"L Zhang","year":"2019","unstructured":"Zhang L, Zhang Y, Bai Q (2019) Two-stage medical supply chain scheduling with an assignable common due window and shelf life. J Combin Optim 37:319\u2013329","journal-title":"J Combin Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00594-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00594-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00594-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:17:27Z","timestamp":1665778647000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00594-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,27]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["594"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00594-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,27]]},"assertion":[{"value":"27 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}