{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:08:34Z","timestamp":1740103714774,"version":"3.37.3"},"reference-count":17,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T00:00:00Z","timestamp":1600041600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Project of Liaoning BaiQianWan Talents Program","award":["LR201945-22","LG201912","71520107004","B16009"],"award-info":[{"award-number":["LR201945-22","LG201912","71520107004","B16009"]}]},{"DOI":"10.13039\/501100007620","name":"Department of Education of Liaoning Province","doi-asserted-by":"publisher","award":["LR201945-22","LG201912","71520107004","B16009"],"award-info":[{"award-number":["LR201945-22","LG201912","71520107004","B16009"]}],"id":[{"id":"10.13039\/501100007620","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["LR201945-22","LG201912","71520107004","B16009"],"award-info":[{"award-number":["LR201945-22","LG201912","71520107004","B16009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013314","name":"111 Project","doi-asserted-by":"crossref","award":["LR201945-22","LG201912","71520107004","B16009"],"award-info":[{"award-number":["LR201945-22","LG201912","71520107004","B16009"]}],"id":[{"id":"10.13039\/501100013314","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,9,14]]},"abstract":"<jats:p>In this paper, we study several coordinated production-delivery scheduling problems with potential disruption motivated by a supply chain in the manufacturing industry. Both single-machine environment and identical parallel-machine environment are considered in the production part. The jobs finished on the machines are delivered to the same customer in batches. Each delivery batch has a capacity and incurs a delivery cost. There is a situation that a possible disruption in the production part may occur at some particular time and will last for a period of time with a probability. We consider both resumable case and nonresumable case where a job does not need (needs) to restart if it is disrupted for a resumable (nonresumable) case. The objective is to find a coordinated schedule of production and delivery that minimizes the expected total flow times plus the delivery costs. We first present some properties and analyze the NP-hard complexity for four various problems. For the corresponding single-machine and parallel-machine scheduling problems, pseudo-polynomial-time algorithms and fully polynomial-time approximation schemes (FPTASs) are presented in this paper, respectively.<\/jats:p>","DOI":"10.1155\/2020\/6840471","type":"journal-article","created":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T23:32:21Z","timestamp":1600126341000},"page":"1-10","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling on a Single Machine and Parallel Machines with Batch Deliveries and Potential Disruption"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2260-4617","authenticated-orcid":true,"given":"Hua","family":"Gong","sequence":"first","affiliation":[{"name":"College of Science, Shenyang Ligong University, Shenyang 110159, China"},{"name":"Key Laboratory of Data Analytics and Optimization for Smart Industry (Northeastern University), Ministry of Education, Shenyang 110819, China"}]},{"given":"Yuyan","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Science, Shenyang Ligong University, Shenyang 110159, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2757-0893","authenticated-orcid":true,"given":"Puyu","family":"Yuan","sequence":"additional","affiliation":[{"name":"College of Science, Shenyang Ligong University, Shenyang 110159, China"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0688"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1504\/ijise.2015.065949"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2016.0726"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1002\/nav.21639"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1002\/nav.21582"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1002\/nav.21715"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-6234-8"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/s0925-5273(99)00105-x"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1040.0325"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2014.01.009"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2006.08.005"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-006-0041-2"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2016.07.006"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2016041"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-5592-7"},{"year":"2010","key":"16"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.12.1.57.11901"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/6840471.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/6840471.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/6840471.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T23:32:24Z","timestamp":1600126344000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/6840471\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,14]]},"references-count":17,"alternative-id":["6840471","6840471"],"URL":"https:\/\/doi.org\/10.1155\/2020\/6840471","relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2020,9,14]]}}}