{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:06:23Z","timestamp":1742929583311,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030880804"},{"type":"electronic","value":"9783030880811"}],"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-88081-1_26","type":"book-chapter","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T11:07:08Z","timestamp":1632913628000},"page":"347-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Population-Based Framework for Solving the Job Shop Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6104-1381","authenticated-orcid":false,"given":"Piotr","family":"Jedrzejowicz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3697-6668","authenticated-orcid":false,"given":"Ewa","family":"Ratajczak-Ropel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4818-4841","authenticated-orcid":false,"given":"Izabela","family":"Wierzbowska","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"key":"26_CR1","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":"26_CR2","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":"26_CR3","doi-asserted-by":"publisher","unstructured":"Dabah, A., Bendjoudi, A., AitZai, A., Nouali-Taboudjemat, N.: Efficient parallel tabu search for the blocking job shop scheduling problem. Soft Comput. 23 (2019). https:\/\/doi.org\/10.1007\/s00500-019-03871-1","DOI":"10.1007\/s00500-019-03871-1"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.2507\/IJSIMM17(2)CO8","volume":"17","author":"H Hu","year":"2018","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","journal-title":"Int. J. Simul. Model."},{"key":"26_CR5","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":"26_CR6","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":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-030-77967-2_34","volume-title":"Computational Science \u2013 ICCS 2021","author":"P Jedrzejowicz","year":"2021","unstructured":"Jedrzejowicz, P., Wierzbowska, I.: The power of a collective: team of agents solving instances of the flow shop and job shop problems. In: Paszynski, M., Kranzlm\u00fcller, D., Krzhizhanovskaya, V.V., Dongarra, J.J., Sloot, P.M.A. (eds.) ICCS 2021. LNCS, vol. 12744, pp. 406\u2013419. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77967-2_34"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"310","DOI":"10.37398\/JSR.2020.640157","volume":"64","author":"Y Kalshetty","year":"2020","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","journal-title":"J. Sci. Res."},{"key":"26_CR9","doi-asserted-by":"publisher","unstructured":"Kurdi, M.: An effective genetic algorithm with a critical-path-guided giffler and thompson crossover operator for job shop scheduling problem. Int. J. Intell. Syst. Appl. Eng. 7(1), 13\u201318 (2019). https:\/\/doi.org\/10.18201\/ijisae.2019751247, https:\/\/www.ijisae.org\/IJISAE\/article\/view\/790","DOI":"10.18201\/ijisae.2019751247"},{"key":"26_CR10","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":"26_CR11","doi-asserted-by":"publisher","first-page":"105954","DOI":"10.1016\/j.asoc.2019.105954","volume":"87","author":"M Liu","year":"2020","unstructured":"Liu, M., Yao, X., Li, Y.: Hybrid whale optimization algorithm enhanced with l\u00e9vy flight and differential evolution for job shop scheduling problems. Appl. Soft Comput. 87, 105954 (2020)","journal-title":"Appl. Soft Comput."},{"key":"26_CR12","doi-asserted-by":"publisher","unstructured":"Piroozfard, H., Wong, K., Derakhshanasl, A.: A hybrid harmony search algorithm for the job shop scheduling problems, pp. 48\u201352 (2015). https:\/\/doi.org\/10.1109\/ASEA.2015.23","DOI":"10.1109\/ASEA.2015.23"},{"key":"26_CR13","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":"26_CR14","doi-asserted-by":"publisher","unstructured":"Rameshkumar, K., Rajendran, C.: A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan. In: IOP Conference Series: Materials Science and Engineering, vol. 310, p. 012143 (2018). https:\/\/doi.org\/10.1088\/1757-899x\/310\/1\/012143","DOI":"10.1088\/1757-899x\/310\/1\/012143"},{"key":"26_CR15","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. Ind. Eng. 128, 894\u2013904 (2019). https:\/\/doi.org\/10.1016\/j.cie.2018.09.025","journal-title":"Comput. Ind. Eng."},{"key":"26_CR16","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":"26_CR17","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"},{"issue":"18","key":"26_CR18","doi-asserted-by":"publisher","first-page":"5440","DOI":"10.3390\/s20185440","volume":"20","author":"MS Viana","year":"2020","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","journal-title":"Sensors"},{"key":"26_CR19","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":"26_CR20","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 (2019)","DOI":"10.1109\/ICCAR.2019.8813444"},{"key":"26_CR21","unstructured":"Yamada, T.: Studies on metaheuristics for jobshop and flowshop scheduling problems (2003)"},{"key":"26_CR22","doi-asserted-by":"publisher","unstructured":"Yu, H., Gao, Y., Wang, L., Meng, J.: A hybrid particle swarm optimization algorithm enhanced with nonlinear inertial weight and gaussian mutation for job shop scheduling problems. Mathematics 8(8) (2020). https:\/\/doi.org\/10.3390\/math8081355, https:\/\/www.mdpi.com\/2227-7390\/8\/8\/1355","DOI":"10.3390\/math8081355"},{"key":"26_CR23","doi-asserted-by":"publisher","first-page":"699","DOI":"10.2507\/IJSIMM18(4)CO18","volume":"18","author":"Z Zhang","year":"2019","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","journal-title":"Int. J. Simul. Model."},{"key":"26_CR24","doi-asserted-by":"publisher","first-page":"521","DOI":"10.2507\/IJSIMM18(3)CO13","volume":"18","author":"J Zhu","year":"2019","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","journal-title":"Int. J. Simul. Model."}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88081-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T11:16:38Z","timestamp":1632914198000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88081-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030880804","9783030880811"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88081-1_26","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":"30 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rhodos","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"29 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2021\/","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":"231","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":"58","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":"0","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":"25% - 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":"3","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","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}