{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T13:59:14Z","timestamp":1760623154904,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030501457"},{"type":"electronic","value":"9783030501464"}],"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-50146-4_19","type":"book-chapter","created":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T17:04:54Z","timestamp":1591376694000},"page":"241-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Artificial Bee Colony Algorithm Applied to Dynamic Flexible Job Shop Problems"],"prefix":"10.1007","author":[{"given":"In\u00eas C.","family":"Ferreira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9562-1808","authenticated-orcid":false,"given":"Bernardo","family":"Firme","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6285-8737","authenticated-orcid":false,"given":"Miguel S. E.","family":"Martins","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8927-6577","authenticated-orcid":false,"given":"Tiago","family":"Coito","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8451-2879","authenticated-orcid":false,"given":"Joaquim","family":"Viegas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6569-6470","authenticated-orcid":false,"given":"Jo\u00e3o","family":"Figueiredo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7961-1004","authenticated-orcid":false,"given":"Susana M.","family":"Vieira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8030-4746","authenticated-orcid":false,"given":"Jo\u00e3o M. C.","family":"Sousa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,5]]},"reference":[{"key":"19_CR1","unstructured":"American Society for Quality: Manufacturing outlook survey. Technical report (2013)"},{"issue":"4","key":"19_CR2","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.rcim.2011.02.004","volume":"27","author":"A Azevedo","year":"2011","unstructured":"Azevedo, A., Almeida, A.: Factory templates for digital factories framework. Rob. Comput. Integr. Manuf. 27(4), 755\u2013771 (2011)","journal-title":"Rob. Comput. Integr. Manuf."},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(3), 157\u2013183 (1993). \nhttps:\/\/doi.org\/10.1007\/BF02023073","journal-title":"Ann. Oper. Res."},{"key":"19_CR4","unstructured":"Company - PWC: Deutschland hinkt bei industrie 4.0 hinterher \u2013 smart factory (2013). \nhttp:\/\/www.pwc.de\/de\/pressemitteilungen\/2013\/deutschland-hinkt-bei-industrie-4-0-hinterher-smart-factory-etabliert-sichnur-langsam.jhtml\n\n. Accessed 28 Aug 2018"},{"key":"19_CR5","unstructured":"Cunha, M.: Scheduling of Flexible Job Shop Problem in Dynamic Environments. Master\u2019s thesis, Instituto Superior T\u00e9cnico (2017)"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.ejor.2006.04.007","volume":"179","author":"NB Ho","year":"2007","unstructured":"Ho, N.B., Tay, J.C., Lai, E.M.K.: An effective architecture for learning and evolving flexible job-shop schedules. Eur. J. Oper. Res. 179(2), 316\u2013333 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"19_CR7","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1080\/0951192031000077870","volume":"16","author":"Y Honghong","year":"2003","unstructured":"Honghong, Y., Zhiming, W.: The application of adaptive genetic algorithms in FMS dynamic rescheduling. Int. J. Comput. Integr. Manuf. 16(6), 382\u2013397 (2003)","journal-title":"Int. J. Comput. Integr. Manuf."},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1080\/00207543.2014.999958","volume":"54","author":"D Ivanov","year":"2016","unstructured":"Ivanov, D., Dolgui, A., Sokolov, B., Werner, F., Ivanova, M.: A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0. Int. J. Prod. Res. 54(2), 386\u2013402 (2016)","journal-title":"Int. J. Prod. Res."},{"issue":"5\u20138","key":"19_CR9","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00170-010-2743-y","volume":"52","author":"JQ Li","year":"2011","unstructured":"Li, J.Q., Pan, Q.K., Suganthan, P., Chua, T.: A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. Int. J. Adv. Manuf. Technol. 52(5\u20138), 683\u2013697 (2011). \nhttps:\/\/doi.org\/10.1007\/s00170-010-2743-y","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"19_CR10","unstructured":"Shrouf, F., Ordieres, J., Miragliotta, G.: Smart factories in industry 4.0: a review of the concept and of energy management approached in production based on the internet of things paradigm. In: International Conference on Industrial Engineering and Engineering Management (IEEM), 2014 IEEE, pp. 697\u2013701. IEEE (2014)"},{"issue":"1\u20134","key":"19_CR11","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00170-011-3610-1","volume":"60","author":"L Wang","year":"2012","unstructured":"Wang, L., Zhou, G., Xu, Y., Wang, S., Liu, M.: An effective artificial bee colony algorithm for the flexible job-shop scheduling problem. Int. J. Adv. Manuf. Technol. 60(1\u20134), 303\u2013315 (2012)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1016\/j.asoc.2009.10.006","volume":"10","author":"LN Xing","year":"2010","unstructured":"Xing, L.N., Chen, Y.W., Wang, P., Zhao, Q.S., Xiong, J.: A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl. Soft Comput. 10(3), 888\u2013896 (2010)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1016\/j.eswa.2009.06.007","volume":"37","author":"M Yazdani","year":"2010","unstructured":"Yazdani, M., Amiri, M., Zandieh, M.: Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Syst. Appl. 37(1), 678\u2013687 (2010)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"19_CR14","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1016\/j.cie.2011.12.001","volume":"62","author":"Z Zakaria","year":"2012","unstructured":"Zakaria, Z., Petrovic, S.: Genetic algorithms for match-up rescheduling of the flexible manufacturing systems. Comput. Ind. Eng. 62(2), 670\u2013686 (2012)","journal-title":"Comput. Ind. Eng."}],"container-title":["Communications in Computer and Information Science","Information Processing and Management of Uncertainty in Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50146-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T18:05:35Z","timestamp":1591380335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50146-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030501457","9783030501464"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50146-4_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"5 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPMU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"15 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipmu2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipmu2020.inesc-id.pt\/","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":"213","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":"146","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":"27","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":"69% - 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,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":"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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The IPMU 2020 was held virtually due to the coronavirus 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"}]}}