{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:18:46Z","timestamp":1753881526973,"version":"3.41.2"},"reference-count":25,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T00:00:00Z","timestamp":1615248000000},"content-version":"vor","delay-in-days":67,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012245","name":"Science and Technology Planning Project of Guangdong Province","doi-asserted-by":"publisher","award":["2020A1414010235"],"award-info":[{"award-number":["2020A1414010235"]}],"id":[{"id":"10.13039\/501100012245","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006410","name":"Huizhou University","doi-asserted-by":"publisher","award":["2019JB014","2018JB007"],"award-info":[{"award-number":["2019JB014","2018JB007"]}],"id":[{"id":"10.13039\/501100006410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>The integrated scheduling algorithm of process sequence time\u2010selective strategy (ISAOPSTSS) is an advanced algorithm in the field of integrated scheduling. The proposed algorithm points out the shortcomings of the process sequence time\u2010selective strategy. Generally, there are too many \u201ctrial scheduling\u201d times. The authors propose that there is no need to make \u201ctrial scheduling\u201d at every \u201cquasi\u2010scheduling time point.\u201d In fact, the process scheduling scheme can be obtained by trial scheduling on some \u201cquasi\u2010scheduling time points.\u201d The scheduling result is the same as that of the sequence timing strategy. The proposed algorithm reduces the runtime of scheduling algorithm and improves the performance of the algorithm without reducing the optimization effect.<\/jats:p>","DOI":"10.1155\/2021\/5570575","type":"journal-article","created":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T22:20:07Z","timestamp":1615328407000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Integrated Scheduling Algorithm with Process Sequence Time\u2010Selective Strategy"],"prefix":"10.1155","volume":"2021","author":[{"given":"Zhen","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3729-6055","authenticated-orcid":false,"given":"Xiaohuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2021,3,9]]},"reference":[{"key":"e_1_2_12_1_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12599-019-00590-7"},{"key":"e_1_2_12_2_2","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/8683472"},{"key":"e_1_2_12_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2018.10.007"},{"key":"e_1_2_12_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2018.10.008"},{"key":"e_1_2_12_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.02.027"},{"key":"e_1_2_12_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2018.2817240"},{"key":"e_1_2_12_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2019.2895562"},{"key":"e_1_2_12_8_2","article-title":"A NSGA-II algorithm hybridizing local simulated-annealing operators for a Bi-criteria robust job-shop scheduling problem under scenarios","volume":"27","author":"Wang B.","year":"2018","journal-title":"IEEE Transactions on Fuzzy Systems"},{"key":"e_1_2_12_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.04.017"},{"key":"e_1_2_12_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113348"},{"key":"e_1_2_12_11_2","first-page":"1","article-title":"A genetic programming-based scheduling approach for hybrid flow shop with a batch processor and waiting time constraint","volume":"18","author":"Qin M.","year":"2019","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"e_1_2_12_12_2","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12719"},{"key":"e_1_2_12_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113716"},{"key":"e_1_2_12_14_2","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/2862186"},{"key":"e_1_2_12_15_2","doi-asserted-by":"publisher","DOI":"10.1080\/0951192X.2015.1067907"},{"key":"e_1_2_12_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125533"},{"key":"e_1_2_12_17_2","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/8565921"},{"key":"e_1_2_12_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2019.103413"},{"key":"e_1_2_12_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106511"},{"key":"e_1_2_12_20_2","first-page":"977","article-title":"Dynamic job-shop scheduling algorithm based on ACPM and BFSM","volume":"40","author":"Zhi-Qiang X.","year":"2003","journal-title":"Journal of Computer Research and Development"},{"key":"e_1_2_12_21_2","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1016.2008.00502"},{"key":"e_1_2_12_22_2","doi-asserted-by":"publisher","DOI":"10.3724\/sp.j.1016.2011.00406"},{"key":"e_1_2_12_23_2","doi-asserted-by":"publisher","DOI":"10.3901\/jme.2011.11.139"},{"key":"e_1_2_12_24_2","doi-asserted-by":"publisher","DOI":"10.3724\/sp.j.1004.2011.00371"},{"key":"e_1_2_12_25_2","doi-asserted-by":"publisher","DOI":"10.3901\/jme.2018.06.191"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/5570575.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/5570575.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/5570575","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T21:54:24Z","timestamp":1723240464000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/5570575"}},"subtitle":[],"editor":[{"given":"Abd E.I.-Baset","family":"Hassanien","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/5570575"],"URL":"https:\/\/doi.org\/10.1155\/2021\/5570575","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-02-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-27","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"5570575"}}