{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:01:22Z","timestamp":1780444882888,"version":"3.54.1"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71872158"],"award-info":[{"award-number":["71872158"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71871197"],"award-info":[{"award-number":["71871197"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71571151"],"award-info":[{"award-number":["71571151"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3275533","type":"journal-article","created":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T17:38:05Z","timestamp":1683826685000},"page":"47377-47389","source":"Crossref","is-referenced-by-count":3,"title":["Permutation Flow Shop Scheduling Optimization Method Based on Cooperative Games"],"prefix":"10.1109","volume":"11","author":[{"given":"Tingyi","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Management, Fujian University of Technology, Fuzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9363-4260","authenticated-orcid":false,"given":"Xiaopeng","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Transportation, Fujian University of Technology, Fuzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guojun","family":"Ji","sequence":"additional","affiliation":[{"name":"School of Management, Xiamen University, Xiamen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29821-0_18"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11465-013-0251-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2017.08.068"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMM.809-810.1450"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-016-0261-x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.32.8.1015"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.11.060"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90427-X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585572"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00070-4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0237-6"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01414208"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.09.037"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-2253-8"},{"issue":"1","key":"ref15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1023\/A:1016360404530","article-title":"On a new class of parallel sequencing situations and related games","volume":"109","author":"Calleja","year":"2002","journal-title":"Ann. Oper. Res."},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.09.007"},{"issue":"8","key":"ref17","first-page":"1983","article-title":"Cooperation games on a type of flow shop scheduling problem","volume":"61","author":"Zhou","year":"2010","journal-title":"CIESC J."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-008-0062-z"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-020-00205-9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.03.020"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106458"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.3.566"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01258203"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF01271134"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.02.034"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2474-6"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2021.1004129"},{"issue":"4","key":"ref28","first-page":"769","article-title":"Improved cat swarm optimization for permutation flow shop scheduling problem","volume":"14","author":"Pei","year":"2019","journal-title":"CAAI Trans. Intell. Syst."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.04.009"},{"issue":"3","key":"ref30","first-page":"56","article-title":"Solving permutation flow shop scheduling problem by firefly algorithm","volume":"17","author":"Liu","year":"2012","journal-title":"Ind. Eng. Manag."},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-007-1115-8"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10122967.pdf?arnumber=10122967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T02:00:53Z","timestamp":1705024853000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10122967\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3275533","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}