{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:04:44Z","timestamp":1742915084072,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811534249"},{"type":"electronic","value":"9789811534256"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-3425-6_31","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"398-407","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Recent Bio-inspired Algorithms for Solving Flexible Job Shop Scheduling Problem: A Comparative Study"],"prefix":"10.1007","author":[{"given":"Dongsheng","family":"Yang","sequence":"first","affiliation":[]},{"given":"Xianyu","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Zhile","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Yanhui","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"issue":"2","key":"31_CR1","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ijpe.2009.11.032","volume":"124","author":"A Baykaso\u011flu","year":"2010","unstructured":"Baykaso\u011flu, A., \u00d6zbak\u0131r, L.: Analyzing the effect of dispatching rules on the scheduling performance through grammar based flexible scheduling system. Int. J. Prod. Econ 124(2), 369\u2013381 (2010)","journal-title":"Int. J. Prod. Econ"},{"issue":"3","key":"31_CR2","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"IA Chaudhry","year":"2015","unstructured":"Chaudhry, I.A., Khan, A.A.: A research survey: review of flexible job shop scheduling techniques. Int. Trans. Oper. Res. 23(3), 551\u2013591 (2015)","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"31_CR3","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1016\/j.apm.2012.03.020","volume":"37","author":"Y Demir","year":"2013","unstructured":"Demir, Y., \u0130\u015fleyen, S.K.: Evaluation of mathematical models for flexible job-shop scheduling problems. Appl. Math. Model. 37(3), 977\u2013988 (2013)","journal-title":"Appl. Math. Model."},{"issue":"3","key":"31_CR4","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1007\/s12206-015-0242-7","volume":"29","author":"I Driss","year":"2015","unstructured":"Driss, I., Mouss, K.N., Laggoun, A.: A new genetic algorithm for flexible job-shop scheduling problems. J. Mech. Sci. Technol. 29(3), 1273\u20131281 (2015). \nhttps:\/\/doi.org\/10.1007\/s12206-015-0242-7","journal-title":"J. Mech. Sci. Technol."},{"issue":"3","key":"31_CR5","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","volume":"18","author":"P Fattahi","year":"2007","unstructured":"Fattahi, P., Mehrabad, M.S., Jolai, F.: Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J. Intell. Manuf. 18(3), 331\u2013342 (2007). \nhttps:\/\/doi.org\/10.1007\/s10845-007-0026-8","journal-title":"J. Intell. Manuf."},{"issue":"2","key":"31_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.cor.2014.01.010","volume":"47","author":"S Jia","year":"2014","unstructured":"Jia, S., Hu, Z.H.: Path-relinking tabu search for the multi-objective flexible job shop scheduling problem. Comput. Oper. Res. 47, 11\u201326 (2014)","journal-title":"Comput. Oper. Res."},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.knosys.2015.07.006","volume":"89","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili, S.: Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl.-Based Syst. 89, 228\u2013249 (2015)","journal-title":"Knowl.-Based Syst."},{"issue":"6","key":"31_CR9","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1016\/j.apm.2009.09.002","volume":"34","author":"C \u00d6zg\u00fcven","year":"2010","unstructured":"\u00d6zg\u00fcven, C., \u00d6zbak\u0131r, L., Yavuz, Y.: Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Appl. Math. Model. 34(6), 1539\u20131548 (2010)","journal-title":"Appl. Math. Model."},{"issue":"10","key":"31_CR10","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Oper. Res. 35(10), 3202\u20133212 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"31_CR11","first-page":"107","volume":"11","author":"R Rao","year":"2020","unstructured":"Rao, R.: Rao algorithms: three metaphor-less simple algorithms for solving optimization problems. Int. J. Ind. Eng. Comput. 11(1), 107\u2013130 (2020)","journal-title":"Int. J. Ind. Eng. Comput."},{"issue":"3","key":"31_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.cad.2010.12.015","volume":"43","author":"RV Rao","year":"2011","unstructured":"Rao, R.V., Savsani, V.J., Vakharia, D.P.: Teaching\u2013learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput.-Aided Des. 43(3), 303\u2013315 (2011)","journal-title":"Comput.-Aided Des."},{"issue":"20","key":"31_CR13","doi-asserted-by":"publisher","first-page":"6247","DOI":"10.1080\/00207543.2013.827806","volume":"51","author":"V Roshanaei","year":"2013","unstructured":"Roshanaei, V., Azab, A., Elmaraghy, H.: Mathematical modelling and a meta-heuristic for flexible job shop scheduling. Int. J. Prod. Res. 51(20), 6247\u20136274 (2013)","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"31_CR14","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/j.ijpe.2014.03.018","volume":"153","author":"G Seebacher","year":"2014","unstructured":"Seebacher, G., Winkler, H.: Evaluating flexibility in discrete manufacturing based on performance and efficiency. Int. J. Prod. Econ. 153(4), 340\u2013351 (2014)","journal-title":"Int. J. Prod. Econ."},{"issue":"3","key":"31_CR15","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.cie.2007.08.008","volume":"54","author":"JC Tay","year":"2008","unstructured":"Tay, J.C., Ho, N.B.: Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput. Ind. Eng. 54(3), 453\u2013473 (2008)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"31_CR16","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ijpe.2004.05.005","volume":"97","author":"SA Torabi","year":"2005","unstructured":"Torabi, S.A., Karimi, B., Ghomi, S.M.T.F.: The common cycle economic lot scheduling in flexible job shops: The finite horizon case. Int. J. Prod. Econ. 97(1), 52\u201365 (2005)","journal-title":"Int. J. Prod. Econ."},{"issue":"23","key":"31_CR17","doi-asserted-by":"publisher","first-page":"6963","DOI":"10.1080\/00207543.2010.526016","volume":"49","author":"G Vilcot","year":"2011","unstructured":"Vilcot, G., Billaut, J.C.: A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem. Int. J. Prod. Res. 49(23), 6963\u20136980 (2011)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"31_CR18","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1109\/TASE.2013.2274517","volume":"12","author":"Y Yuan","year":"2013","unstructured":"Yuan, Y., Xu, H.: Multiobjective flexible job shop scheduling using memetic algorithms. IEEE Trans. Autom. Sci. Eng. 12(1), 336\u2013353 (2013)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"1\u20134","key":"31_CR19","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00170-013-5510-z","volume":"71","author":"M Ziaee","year":"2013","unstructured":"Ziaee, M.: A heuristic algorithm for solving flexible job shop scheduling problem. The International Journal of Advanced Manufacturing Technology 71(1\u20134), 519\u2013528 (2013). \nhttps:\/\/doi.org\/10.1007\/s00170-013-5510-z","journal-title":"The International Journal of Advanced Manufacturing Technology"}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3425-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T11:58:48Z","timestamp":1585915128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3425-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534249","9789811534256"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3425-6_31","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":"2 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.bicta.org","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":"197","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":"121","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":"61% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}