{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T22:40:09Z","timestamp":1749508809294,"version":"3.41.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030779665"},{"type":"electronic","value":"9783030779672"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77967-2_34","type":"book-chapter","created":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T13:25:58Z","timestamp":1623331558000},"page":"406-419","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Power of a Collective: Team of Agents Solving Instances of the Flow Shop and Job Shop Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6104-1381","authenticated-orcid":false,"given":"Piotr","family":"Jedrzejowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4818-4841","authenticated-orcid":false,"given":"Izabela","family":"Wierzbowska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","unstructured":"Anuar, N.I., Fauadi, M.H.F.M., Saptari, A.: Performance evaluation of continuous and discrete particle swarm optimization in job-shop scheduling problems. In: Materials Science and Engineering Conference Series. Materials Science and Engineering Conference Series, vol. 530, p. 012044 (June 2019). https:\/\/doi.org\/10.1088\/1757-899X\/530\/1\/012044","DOI":"10.1088\/1757-899X\/530\/1\/012044"},{"key":"34_CR2","doi-asserted-by":"publisher","unstructured":"Balande, U., Shrimankar, D.: A modified teaching learning metaheuristic algorithm with opposite-based learning for permutation flow-shop scheduling problem. Evol. Intell. 1\u201323 (2020). https:\/\/doi.org\/10.1007\/s12065-020-00487-5","DOI":"10.1007\/s12065-020-00487-5"},{"key":"34_CR3","doi-asserted-by":"publisher","unstructured":"Barbucha, D., Czarnowski, I., Jedrzejowicz, P., Ratajczak, E., Wierzbowska, I.: Jade-based a-team as a tool for implementing population-based algorithms. In: Sixth International Conference on Intelligent Systems Design and Applications, vol. 3, pp. 144\u2013149 (2006). https:\/\/doi.org\/10.1109\/ISDA.2006.31","DOI":"10.1109\/ISDA.2006.31"},{"key":"34_CR4","doi-asserted-by":"publisher","unstructured":"Belabid, J., Aqil, S., Allali, K.: Solving permutation flow shop scheduling problem with sequence-independent setup time. J. Appl. Math. 2020, 1\u201311 (2020). https:\/\/doi.org\/10.1155\/2020\/7132469","DOI":"10.1155\/2020\/7132469"},{"key":"34_CR5","doi-asserted-by":"publisher","unstructured":"Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling computer and manufacturing processes, Springer, Berlin (1996). https:\/\/doi.org\/10.1007\/978-3-662-03217-6","DOI":"10.1007\/978-3-662-03217-6"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ins.2013.02.041","volume":"237","author":"I Boussa\u00efd","year":"2013","unstructured":"Boussa\u00efd, I., Lepagnot, J., Siarry, P.: A survey on optimization metaheuristics. Inf. Sci. 237, 82\u2013117 (2013). https:\/\/doi.org\/10.1016\/j.ins.2013.02.041","journal-title":"Inf. Sci."},{"key":"34_CR7","doi-asserted-by":"publisher","unstructured":"Chen, X., Zhang, B., Gao, D.: Algorithm based on improved genetic algorithm for job shop scheduling problem, pp. 951\u2013956 (2019). https:\/\/doi.org\/10.1109\/ICMA.2019.8816334","DOI":"10.1109\/ICMA.2019.8816334"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cam.2014.02.022","volume":"270","author":"E Danovaro","year":"2014","unstructured":"Danovaro, E., Clematis, A., Galizia, A., Ripepi, G., Quarati, A., D\u2019Agostino, D.: Heterogeneous architectures for computational intensive applications: a cost-effectiveness analysis. J. Comput. Appl. Math. 270, 63\u201377 (2014). https:\/\/doi.org\/10.1016\/j.cam.2014.02.022","journal-title":"J. Comput. Appl. Math."},{"key":"34_CR9","doi-asserted-by":"publisher","unstructured":"Dodu, C., Ancau, M.: A tabu search approach for permutation flow shop scheduling. Studia Universitatis Babes-Bolyai Informatica 65, 104\u2013115 (2020). https:\/\/doi.org\/10.24193\/subbi.2020.1.08","DOI":"10.24193\/subbi.2020.1.08"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976). http:\/\/www.jstor.org\/stable\/3689278","DOI":"10.1287\/moor.1.2.117"},{"key":"34_CR11","doi-asserted-by":"publisher","unstructured":"Hu, H., Lei, W., Gao, X., Zhang, Y.: Job-shop scheduling problem based on improved cuckoo search algorithm. Int. J. Simul. Model. 17, 337\u2013346 (2018). https:\/\/doi.org\/10.2507\/IJSIMM17(2)CO8","DOI":"10.2507\/IJSIMM17(2)CO8"},{"key":"34_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-030-28377-3_43","volume-title":"Computational Collective Intelligence","author":"P Jedrzejowicz","year":"2019","unstructured":"Jedrzejowicz, P.: Current trends in the population-based optimization. In: Nguyen, N.T., Chbeir, R., Exposito, E., Aniort\u00e9, P., Trawi\u0144ski, B. (eds.) ICCCI 2019. LNCS (LNAI), vol. 11683, pp. 523\u2013534. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-28377-3_43"},{"issue":"6","key":"34_CR13","doi-asserted-by":"publisher","first-page":"142","DOI":"10.3390\/a13060142","volume":"13","author":"P Jedrzejowicz","year":"2020","unstructured":"Jedrzejowicz, P., Wierzbowska, I.: Parallelized swarm intelligence approach for solving tsp and jssp problems. Algorithms 13(6), 142 (2020). https:\/\/doi.org\/10.3390\/a13060142","journal-title":"Algorithms"},{"key":"34_CR14","doi-asserted-by":"publisher","unstructured":"Kalshetty, Y., Adamuthe, A., Kumar, S.: Genetic algorithms with feasible operators for solving job shop scheduling problem. J. Sci. Res. 64, 310\u2013321 (2020). https:\/\/doi.org\/10.37398\/JSR.2020.640157","DOI":"10.37398\/JSR.2020.640157"},{"key":"34_CR15","unstructured":"Lawrence, S.: Resource constrained project scheduling - technical report (1984)"},{"key":"34_CR16","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J Lenstra","year":"1977","unstructured":"Lenstra, J., Rinnooy Kan, A., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343\u2013362 (1977). https:\/\/doi.org\/10.1016\/S0167-5060(08)70743-X","journal-title":"Ann. Discrete Math."},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ijpe.2017.06.026","volume":"193","author":"W Liu","year":"2017","unstructured":"Liu, W., Jin, Y., Price, M.: A new improved NEH heuristic for permutation flowshop scheduling problems. Int. J. Prod. Econ. 193, 21\u201330 (2017). https:\/\/doi.org\/10.1016\/j.ijpe.2017.06.026","journal-title":"Int. J. Prod. Econ."},{"key":"34_CR18","doi-asserted-by":"publisher","unstructured":"Lopes Silva, M.A., de Souza, S.R., Freitas Souza, M.J., Bazzan, A.L.C.: A reinforcement learning-based multi-agent framework applied for solving routing and scheduling problems. Exp. Syst. Appl. 131, 148\u2013171 (2019). https:\/\/doi.org\/10.1016\/j.eswa.2019.04.056","DOI":"10.1016\/j.eswa.2019.04.056"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.asoc.2018.06.050","volume":"71","author":"MA Lopes Silva","year":"2018","unstructured":"Lopes Silva, M.A., de Souza, S.R., Freitas Souza, M.J., de Fran\u00e7a Filho, M.F.: Hybrid metaheuristics and multi-agent systems for solving optimization problems: A review of frameworks and a comparative analysis. Appl. Soft. Comput. 71, 433\u2013459 (2018). https:\/\/doi.org\/10.1016\/j.asoc.2018.06.050","journal-title":"Appl. Soft. Comput."},{"issue":"3","key":"34_CR20","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1109\/TEVC.2018.2868770","volume":"23","author":"X Ma","year":"2019","unstructured":"Ma, X., et al.: A survey on cooperative co-evolutionary algorithms. IEEE Trans. Evol. Comput. 23(3), 421\u2013441 (2019). https:\/\/doi.org\/10.1109\/TEVC.2018.2868770","journal-title":"IEEE Trans. Evol. Comput."},{"key":"34_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2020\/3489209","volume":"2020","author":"P Pongchairerks","year":"2020","unstructured":"Pongchairerks, P.: An enhanced two-level metaheuristic algorithm with adaptive hybrid neighborhood structures for the job-shop scheduling problem. Complexity 2020, 1\u201315 (2020). https:\/\/doi.org\/10.1155\/2020\/3489209","journal-title":"Complexity"},{"key":"34_CR22","doi-asserted-by":"publisher","unstructured":"Salloum, S., Dautov, R., Chen, X., Peng, P., Huang, J.: Big data analytics on apache spark. Int. J. Data Sci. Anal. 1 (2016). https:\/\/doi.org\/10.1007\/s41060-016-0027-9","DOI":"10.1007\/s41060-016-0027-9"},{"key":"34_CR23","doi-asserted-by":"publisher","unstructured":"Sharma, S., Jeet, K., Nailwal, K., Gupta, D.: An improvement heuristic for permutation flow shop scheduling. Int. J. Process. Manage. Benchmarking 9, 124 (2019). https:\/\/doi.org\/10.1504\/IJPMB.2019.10019077","DOI":"10.1504\/IJPMB.2019.10019077"},{"key":"34_CR24","doi-asserted-by":"publisher","unstructured":"Soltysova, Z., Semanco, P., Modrak, J.: Exploring heuristic techniques for flow shop scheduling. Manage. Prod. Eng. Rev. 10(3), 54\u201360 (2019) https:\/\/doi.org\/10.24425\/mper.2019.129598","DOI":"10.24425\/mper.2019.129598"},{"key":"34_CR25","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1016\/j.cie.2018.09.025","volume":"128","author":"L Sun","year":"2019","unstructured":"Sun, L., Lin, L., Li, H., Gen, M.: Large scale flexible scheduling optimization by a distributed evolutionary algorithm. Comput. Indus. Eng. 128, 894\u2013904 (2019). https:\/\/doi.org\/10.1016\/j.cie.2018.09.025","journal-title":"Comput. Indus. Eng."},{"key":"34_CR26","unstructured":"Taillard, E.: Summary of best known lower and upper bounds of Taillard\u2019s instances. http:\/\/mistic.heig-vd.ch\/taillard\/problemes.dir\/ordonnancement.dir\/ordonnancement.html (2015). Accessed 23 Nov 2020"},{"key":"34_CR27","doi-asserted-by":"publisher","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993). https:\/\/doi.org\/10.1016\/0377-2217(93)90182-M, project Management anf Scheduling","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"34_CR28","doi-asserted-by":"publisher","unstructured":"Tsai, C.W., Chang, H.C., Hu, K.C., Chiang, M.C.: Parallel coral reef algorithm for solving jsp on spark. In: 2016 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2016, Budapest, Hungary, 9\u201312 October 2016, pp. 1872\u20131877. IEEE (2016). https:\/\/doi.org\/10.1109\/SMC.2016.7844511","DOI":"10.1109\/SMC.2016.7844511"},{"key":"34_CR29","doi-asserted-by":"publisher","unstructured":"\u00c7ali\u015f Uslu, B., Bulkan, S.: A research survey: review of ai solution strategies of job shop scheduling problem. J. Intell. Manuf. 26 (2013). https:\/\/doi.org\/10.1007\/s10845-013-0837-8","DOI":"10.1007\/s10845-013-0837-8"},{"key":"34_CR30","doi-asserted-by":"publisher","unstructured":"Viana, M.S., Morandin Junior, O., Contreras, R.C.: A modified genetic algorithm with local search strategies and multi-crossover operator for job shop scheduling problem. Sensors 20(18), 5440 (2020). https:\/\/doi.org\/10.3390\/s20185440","DOI":"10.3390\/s20185440"},{"key":"34_CR31","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.jmsy.2019.11.010","volume":"54","author":"A Vital-Soto","year":"2020","unstructured":"Vital-Soto, A., Azab, A., Baki, M.F.: Mathematical modeling and a hybridized bacterial foraging optimization algorithm for the flexible job-shop scheduling problem with sequencing flexibility. J. Manuf. Syst. 54, 74\u201393 (2020). https:\/\/doi.org\/10.1016\/j.jmsy.2019.11.010","journal-title":"J. Manuf. Syst."},{"key":"34_CR32","doi-asserted-by":"crossref","unstructured":"Wang, F., Tian, Y., Wang, X.: A discrete wolf pack algorithm for job shop scheduling problem. In: Proceedings of the 2019 5th International Conference on Control, Automation and Robotics (ICCAR), Beijing, China, pp. 19\u201322 (April 2019)","DOI":"10.1109\/ICCAR.2019.8813444"},{"key":"34_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/978-3-030-26766-7_70","volume-title":"Intelligent Computing Methodologies","author":"J-Y Wu","year":"2019","unstructured":"Wu, J.-Y., Wu, X., Lu, X.-Q., Du, Y.-C., Zhang, M.-X.: Water wave optimization for flow-shop scheduling. In: Huang, D.-S., Huang, Z.-K., Hussain, A. (eds.) ICIC 2019. LNCS (LNAI), vol. 11645, pp. 771\u2013783. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26766-7_70"},{"key":"34_CR34","doi-asserted-by":"publisher","unstructured":"Yang, L., Wang, C., Gao, L., Song, Y., Li, X.: An improved simulated annealing algorithm based on residual network for permutation flow shop scheduling. Complex Intell. Syst. 1\u201311 (2020). https:\/\/doi.org\/10.1007\/s40747-020-00205-9","DOI":"10.1007\/s40747-020-00205-9"},{"key":"34_CR35","doi-asserted-by":"publisher","first-page":"174830262096240","DOI":"10.1177\/1748302620962403","volume":"14","author":"L Zhang","year":"2020","unstructured":"Zhang, L., Yu, Y., Luo, Y., Zhang, S.: Improved cuckoo search algorithm and its application to permutation flow shop scheduling problem. J. Algorithms Comput. Technol. 14, 1748302620962403 (2020). https:\/\/doi.org\/10.1177\/1748302620962403","journal-title":"J. Algorithms Comput. Technol."},{"key":"34_CR36","doi-asserted-by":"publisher","unstructured":"Zhang, Z., Guan, Z., Zhang, J., Xie, X.: A novel job-shop scheduling strategy based on particle swarm optimization and neural network. Int. J. Simul. Model. 18, 699\u2013707 (2019). https:\/\/doi.org\/10.2507\/IJSIMM18(4)CO18","DOI":"10.2507\/IJSIMM18(4)CO18"},{"key":"34_CR37","doi-asserted-by":"publisher","unstructured":"Zhu, J., Shao, Z., Chen, C.: An improved whale optimization algorithm for job-shop scheduling based on quantum computing. Int. J. Simul. Model. 18, 521\u2013530 (2019). https:\/\/doi.org\/10.2507\/IJSIMM18(3)CO13","DOI":"10.2507\/IJSIMM18(3)CO13"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77967-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T22:03:37Z","timestamp":1749506617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77967-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030779665","9783030779672"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77967-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"156","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"212 full and 43 short papers were selected from 479 submissions to the workshops\/ thematic tracks. The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}