{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:43:52Z","timestamp":1757313832456,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030539559"},{"type":"electronic","value":"9783030539566"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-53956-6_39","type":"book-chapter","created":{"date-parts":[[2020,7,12]],"date-time":"2020-07-12T11:02:42Z","timestamp":1594551762000},"page":"435-444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-objective Dynamic Scheduling Model of Flexible Job Shop Based on NSGAII Algorithm and Scroll Window Technology"],"prefix":"10.1007","author":[{"given":"Yingli","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiahai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,13]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Mohan, J., Lanka, K., Rao, A.N.: A review of dynamic job shop scheduling techniques. Procedia Manuf. (2019). https:\/\/doi.org\/10.1016\/j.promfg.2019.02.006","key":"39_CR1","DOI":"10.1016\/j.promfg.2019.02.006"},{"doi-asserted-by":"publisher","unstructured":"Zambrano Rey, G., Bekrar, A., Prabhu, V., Trentesaux, D.: Coupling a genetic algorithm with the distributed arrival-time control for the JIT dynamic scheduling of flexible job-shops. Int. J. Prod. Res. (2014). https:\/\/doi.org\/10.1080\/00207543.2014.881575","key":"39_CR2","DOI":"10.1080\/00207543.2014.881575"},{"doi-asserted-by":"publisher","unstructured":"Renna, P.: Job shop scheduling by pheromone approach in a dynamic environment. Int. J. Comput. Integr. Manuf. (2010). https:\/\/doi.org\/10.1080\/09511921003642170","key":"39_CR3","DOI":"10.1080\/09511921003642170"},{"doi-asserted-by":"publisher","unstructured":"Kundakci, N., Kulak, O.: Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem. Comput. Ind. Eng. (2016). https:\/\/doi.org\/10.1016\/j.cie.2016.03.011","key":"39_CR4","DOI":"10.1016\/j.cie.2016.03.011"},{"key":"39_CR5","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-319-53480-0_49","volume-title":"Intelligent Systems Design and Applications","author":"M Al-Behadili","year":"2017","unstructured":"Al-Behadili, M., Ouelhadj, D., Jones, D.: Multi-objective particle swarm optimisation for robust dynamic scheduling in a permutation flow shop. In: Madureira, A.M., Abraham, A., Gamboa, D., Novais, P. (eds.) ISDA 2016. AISC, vol. 557, pp. 498\u2013507. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53480-0_49"},{"doi-asserted-by":"publisher","unstructured":"Naderi, B., Azab, A.: An improved model and novel simulated annealing for distributed job shop problems. Int. J. Adv. Manuf. Technol. (2015). https:\/\/doi.org\/10.1007\/s00170-015-7080-8","key":"39_CR6","DOI":"10.1007\/s00170-015-7080-8"},{"doi-asserted-by":"publisher","unstructured":"Nelson, R.T., Holloway, C.A., Mei-Lun Wong, R.: Centralized scheduling and priority implementation heuristics for a dynamic job shop model. AIIE Trans. (1977). https:\/\/doi.org\/10.1080\/05695557708975127","key":"39_CR7","DOI":"10.1080\/05695557708975127"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.3934\/mbe.2019065","volume":"16","author":"G Zhang","year":"2019","unstructured":"Zhang, G., Sun, J., Liu, X., Wang, G., Yang, Y.: Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm. Math. Biosci. Eng. 16, 1334\u20131347 (2019). https:\/\/doi.org\/10.3934\/mbe.2019065","journal-title":"Math. Biosci. Eng."},{"doi-asserted-by":"publisher","unstructured":"Gao, J., Sun, L., Gen, M.: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput. Oper. Res. (2008). https:\/\/doi.org\/10.1016\/j.cor.2007.01.001","key":"39_CR9","DOI":"10.1016\/j.cor.2007.01.001"},{"doi-asserted-by":"publisher","unstructured":"Wang, X., Gao, L., Zhang, C., Shao, X.: A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem. Int. J. Adv. Manuf. Technol. (2010). https:\/\/doi.org\/10.1007\/s00170-010-2642-2","key":"39_CR10","DOI":"10.1007\/s00170-010-2642-2"},{"doi-asserted-by":"publisher","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. (2002). https:\/\/doi.org\/10.1109\/4235.996017","key":"39_CR11","DOI":"10.1109\/4235.996017"},{"doi-asserted-by":"publisher","unstructured":"Kacem, I., Hammadi, S., Borne, P.: Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math. Comput. Simul. (2002). https:\/\/doi.org\/10.1016\/S0378-4754(02)00019-8","key":"39_CR12","DOI":"10.1016\/S0378-4754(02)00019-8"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53956-6_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,28]],"date-time":"2020-12-28T08:38:49Z","timestamp":1609144729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-53956-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030539559","9783030539566"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53956-6_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgrade","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Serbia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-si.org\/committees\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"127","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":"63","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":"50% - 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","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":"2.4","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}