{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T04:28:55Z","timestamp":1772166535854,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T00:00:00Z","timestamp":1619136000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T00:00:00Z","timestamp":1619136000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"The Project of Educational Commission of Guangdong","award":["2019KTSCX177"],"award-info":[{"award-number":["2019KTSCX177"]}]},{"DOI":"10.13039\/501100013093","name":"Science and Technology Planning Project of Shenzhen Municipality","doi-asserted-by":"crossref","award":["2020A1414010235"],"award-info":[{"award-number":["2020A1414010235"]}],"id":[{"id":"10.13039\/501100013093","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100013093","name":"Science and Technology Planning Project of Shenzhen Municipality","doi-asserted-by":"crossref","award":["2020SC0306023"],"award-info":[{"award-number":["2020SC0306023"]}],"id":[{"id":"10.13039\/501100013093","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Professorial and Doctoral Scientific Research Foundation of Huizhou University","award":["2019JB014"],"award-info":[{"award-number":["2019JB014"]}]},{"name":"Professorial and Doctoral Scientific Research Foundation of Huizhou University","award":["2018JB007"],"award-info":[{"award-number":["2018JB007"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>At present, Multi-Devices-Process Integrated Scheduling Algorithm with Time-Selective Strategy for Process Sequence (MISATPS) is an advanced algorithm in the field of integrated scheduling with multi-devices-process problems. This algorithm ignores the influence of the pre-process on the post-process when solving the multi-devices-process integrated scheduling problem, which leads to the problem of poor closeness between serial processes and poor parallelism between parallel processes. This paper points out that there is no restriction of scheduling sequence between parallel processes on the same processing device. It can be scheduled flexibly of the sequence between parallel processes of the same device. Therefore, based on the scheduling scheme of MISATPS, the algorithm is improved by applying the interchange strategy and the interchange adjustment strategy of multi-device adjacent parallel process. In this way, the influence of the pre-process on the post-process is avoided, the compactness of the serial process and the parallelism of the parallel process are improved, and the scheduling result is optimized.<\/jats:p>","DOI":"10.1186\/s13638-021-01989-1","type":"journal-article","created":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T08:07:25Z","timestamp":1619165245000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An integrated scheduling algorithm for multi-device-processes with the strategy of exchanging adjacent parallel processes of the same device"],"prefix":"10.1186","volume":"2021","author":[{"given":"Zhen","family":"Wang","sequence":"first","affiliation":[]},{"given":"Xiaohuan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yuxiao","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Guoming","family":"Lai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,23]]},"reference":[{"issue":"4","key":"1989_CR1","doi-asserted-by":"publisher","first-page":"126305","DOI":"10.1016\/j.jclepro.2021.126305","volume":"294","author":"Z Liu","year":"2021","unstructured":"Z. Liu, L. Lang, B. Hu, L. Shi, B. Huang, Y. Zhao, Emission reduction decision of agricultural supply chain considering carbon tax and investment cooperation. J Clean Prod 294(4), 126305 (2021)","journal-title":"J Clean Prod"},{"issue":"4","key":"1989_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1504\/IJBIC.2020.112328","volume":"6","author":"C Jiang","year":"2020","unstructured":"C. Jiang, R. Li, T. Chen, C. Xu, L. Li, S. Li, A two-lane mixed traffic flow model with drivers\u2019 intention to change lane based on cellular automata. Int J Bio-Inspired Comput 6(4), 229\u2013240 (2020)","journal-title":"Int J Bio-Inspired Comput"},{"issue":"6","key":"1989_CR3","doi-asserted-by":"publisher","first-page":"4117","DOI":"10.1007\/s11227-017-2227-z","volume":"76","author":"X Dong","year":"2020","unstructured":"X. Dong, M. Qian, R. Jiang, Packet classification based on decision tree with information entropy. J Supercomput 76(6), 4117\u20134131 (2020)","journal-title":"J Supercomput"},{"key":"1989_CR4","first-page":"113360","volume":"152","author":"B Sya","year":"2020","unstructured":"B. Sya, B. Tla, B. Bwa, A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times. Expert SystAppl 152, 113360 (2020)","journal-title":"Expert SystAppl"},{"key":"1989_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TNNLS.2019.2921841","volume":"31","author":"W Huang","year":"2019","unstructured":"W. Huang, L. Gao, A time wave neural network framework for solving time-dependent project scheduling problems. IEEE Trans Neural Netw Learn Syst 31, 1\u201310 (2019)","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1989_CR6","first-page":"1","volume":"99","author":"H Shen","year":"2019","unstructured":"H. Shen, S. Huo, H. Yan et al., Distributed dissipative state estimation for Markov jump genetic regulatory networks subject to round-Robin scheduling. IEEE Trans Neural Netw Learn Syst 99, 1\u201310 (2019)","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1989_CR7","first-page":"113837","volume":"165","author":"C Swlab","year":"2021","unstructured":"C. Swlab, C.Y. Cheng, P. Pourhejazy et al., Multi-temperature simulated annealing for optimizing mixed-blocking permutation flowshop scheduling problems. Expert SystAppl 165, 113837 (2021)","journal-title":"Expert SystAppl"},{"key":"1989_CR8","doi-asserted-by":"publisher","first-page":"105079","DOI":"10.1016\/j.cor.2020.105079","volume":"125","author":"I Mathlouthi","year":"2020","unstructured":"I. Mathlouthi, M. Gendreau, J. Potvin, A metaheuristic based on Tabu search for solving a technician routing and scheduling problem. ComputOper Res 125, 105079 (2020)","journal-title":"ComputOper Res"},{"key":"1989_CR9","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10479-019-03494-7","volume":"296","author":"P Wu","year":"2019","unstructured":"P. Wu, J. Cheng, F. Chu, Large-scale energy-conscious bi-objective single-machine batch scheduling under time-of-use electricity tariffs via effective iterative heuristics. Ann Oper Res 296, 471\u2013494 (2019)","journal-title":"Ann Oper Res"},{"key":"1989_CR10","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.ejor.2020.07.020","volume":"289","author":"D Anghinolfi","year":"2020","unstructured":"D. Anghinolfi, M. Paolucc, R. Ronco, A bi-objective heuristic approach for green identical parallel machine scheduling. Eur J Oper Res 289, 416\u2013434 (2020)","journal-title":"Eur J Oper Res"},{"key":"1989_CR11","first-page":"977","volume":"40","author":"Z Xie","year":"2003","unstructured":"Z. Xie, S. Liu, P. Qiao, Dynamic job-shop scheduling algorithm based on ACPM and BFSM. J Comput Res Dev 40, 977\u2013983 (2003)","journal-title":"J Comput Res Dev"},{"key":"1989_CR12","doi-asserted-by":"publisher","first-page":"406","DOI":"10.3724\/SP.J.1016.2011.00406","volume":"34","author":"Z Xie","year":"2011","unstructured":"Z. Xie, J. Yang, Y. Zhou et al., Dynamic critical paths multi-product manufacturing scheduling algorithm based on operation set. Chin J Comput. 34, 406\u2013412 (2011)","journal-title":"Chin J Comput."},{"key":"1989_CR13","first-page":"1","volume":"2020","author":"X Zhang","year":"2020","unstructured":"X. Zhang, D. Zhang, Z. Wang, Y. Xin, Multi-devices-process integrated scheduling algorithm with time-selective strategy for process sequence. Complexity 2020, 1\u201310 (2020)","journal-title":"Complexity"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-021-01989-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13638-021-01989-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-021-01989-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T08:24:35Z","timestamp":1619166275000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-021-01989-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,23]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["1989"],"URL":"https:\/\/doi.org\/10.1186\/s13638-021-01989-1","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-212997\/v1","asserted-by":"object"}]},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,23]]},"assertion":[{"value":"15 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"104"}}