{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T07:01:32Z","timestamp":1777705292678,"version":"3.51.4"},"reference-count":23,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T00:00:00Z","timestamp":1613692800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2021,10,14]]},"abstract":"<jats:p>The customized products such as electromechanical prototype products are a type of product with research and trial manufacturing characteristics. The BOM structures and processing parameters of the products vary greatly, making it difficult for a single shop to meet such a wide range of processing parameters. For the dynamic and fuzzy manufacturing characteristics of the products, not only the coordinated transport time of multiple shops but also the fact that the product has a designated output shop should be considered. In order to solve such Multi-shop Integrated Scheduling Problem with Fixed Output Constraint (MISP-FOC), a constraint programming model is developed to minimize the total tardiness, and then a Multi-shop Integrated Scheduling Algorithm (MISA) based on EGA (Enhanced Genetic Algorithm) and B&amp;B (Branch and Bound) is proposed. MISA is a hybrid optimization method and consists of four parts. Firstly, to deal with the dynamic and fuzzy manufacturing characteristics, the dynamic production process is transformed into a series of time-continuous static scheduling problem according to the proposed dynamic rescheduling mechanism. Secondly, the pre-scheduling scheme is generated by the EGA at each event moment. Thirdly, the jobs in the pre-scheduling scheme are divided into three parts, namely, dispatched jobs, jobs to be dispatched, and jobs available for rescheduling, and at last, the B&amp;B method is used to optimize the jobs available for rescheduling by utilizing the period when the dispatched jobs are in execution. Google OR-Tools is used to verify the proposed constraint programming model, and the experiment results show that the proposed algorithm is effective and feasible.<\/jats:p>","DOI":"10.3233\/jifs-189721","type":"journal-article","created":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T13:43:47Z","timestamp":1614087827000},"page":"4609-4617","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":5,"title":["A multi-shop integrated scheduling algorithm with fixed output constraint"],"prefix":"10.1177","volume":"41","author":[{"given":"Yingchun","family":"Xia","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin, China"}]},{"given":"Zhiqiang","family":"Xie","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin, China"}]},{"given":"Yu","family":"Xin","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer, Ningbo University, Ningbo, China"}]},{"given":"Xiaowei","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin, China"}]}],"member":"179","published-online":{"date-parts":[[2021,2,19]]},"reference":[{"issue":"8","key":"e_1_3_2_2_2","first-page":"695","article-title":"Scheduling: theory, algorithms, and systems, book reviews","volume":"28","author":"Pinedo M.","year":"2016","unstructured":"PinedoM. and HadaviK., Scheduling: theory, algorithms, and systems, book reviews, IIE Transactions28(8) (2016), 695\u2013697.","journal-title":"IIE Transactions"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2019.1709671"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.07.002"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.3901\/JME.2020.09.181"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.13196\/j.cims.2019.08.001"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.3969\/j.issn.1671-7147.2015.03.015"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2009.02.004"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00353-3"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2019.1622052"},{"issue":"8","key":"e_1_3_2_11_2","first-page":"1710","article-title":"No-Wait Integrated Scheduling Algorithm Based on Reversed Order Signal-Driven","volume":"50","author":"Xie Z.Q.","year":"2013","unstructured":"XieZ.Q., XinY. and YangJ., No-Wait Integrated Scheduling Algorithm Based on Reversed Order Signal-Driven, Journal of Computer Research and Development50(8) (2013), 1710\u20131721. DOI: CNKI:SUN:JFYZ.0.2013-08-017","journal-title":"Journal of Computer Research and Development"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1442942"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-018-6805-8"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12305"},{"key":"e_1_3_2_15_2","first-page":"1","article-title":"Hybrid Teaching-Learning-Based Optimization Algorithms for the Integrated Scheduling Problem of Multi-Workshop Collaboration","volume":"2019","author":"Liao B.F.","year":"2019","unstructured":"LiaoB.F., LeiQ., WuW.L., et al., Hybrid Teaching-Learning-Based Optimization Algorithms for the Integrated Scheduling Problem of Multi-Workshop Collaboration, China Mechanical Engineering2019 (2019), 1\u201311. DOI: http:\/\/kns.cnki.net\/kcms\/detail\/42.1294.TH.20191113.1453.031.html","journal-title":"China Mechanical Engineering"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2015.03.099"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.03.001"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218843020400080"},{"key":"e_1_3_2_19_2","unstructured":"Google LLC Google Optimization Tools 2019. https:\/\/developers.google.com\/optimization."},{"key":"e_1_3_2_20_2","unstructured":"IBM Corporation the CPLEX User\u2019s Manual 2017. https:\/\/www.ibm.com\/support\/knowledgecenter\/SSSA5P_12.8.0."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.04.006"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJMOR.2017.080743"},{"key":"e_1_3_2_23_2","unstructured":"LivelyT. LongW. and PagnoniA. Analyzing Branch-and-Bound Algorithms for the Multiprocessor Scheduling Problem arXiv preprint Article ID 1901.07070 2019."},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.13196\/j.cims.2015.09.020"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-189721","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-189721","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-189721","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:43:26Z","timestamp":1777455806000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-189721"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,19]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,10,14]]}},"alternative-id":["10.3233\/JIFS-189721"],"URL":"https:\/\/doi.org\/10.3233\/jifs-189721","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,19]]}}}