{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:54Z","timestamp":1740099174056,"version":"3.37.3"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811328282"},{"type":"electronic","value":"9789811328299"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-981-13-2829-9_4","type":"book-chapter","created":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T21:25:14Z","timestamp":1538774714000},"page":"31-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Discrete Harmony Search Algorithm for Flexible Job-Shop Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Xiuli","family":"Wu","sequence":"first","affiliation":[]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,6]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2016.03.009","volume":"73","author":"E Ahmadi","year":"2016","unstructured":"Ahmadi, E., Zandieh, M., Farrokh, M.: A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms. Comput. Oper. Res. 73, 56\u201366 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"4_CR2","first-page":"2329","volume":"34","author":"GH Zhang","year":"2017","unstructured":"Zhang, G.H., Dang, S.J.: Research on flexible job-shop scheduling problem considering job movement time. Appl. Res. Comput. 34(8), 2329\u20132331 (2017)","journal-title":"Appl. Res. Comput."},{"key":"4_CR3","first-page":"11","volume":"1","author":"M Chen","year":"2017","unstructured":"Chen, M., Hu, L.Y., Liu, J.F.: Multi-objective flexible job shop scheduling problem based on particle swarm optimization. Mechatronics 1, 11\u201315 (2017)","journal-title":"Mechatronics"},{"issue":"7","key":"4_CR4","first-page":"145","volume":"50","author":"BX Zhao","year":"2016","unstructured":"Zhao, B.X., Gao, J.M., Chen, K.: Two-stage hybrid pareto ant colony algorithm for multi-objective flexible job shop scheduling. J. Xi\u2019an Jiaotong Univ. 50(7), 145\u2013151 (2016)","journal-title":"J. Xi\u2019an Jiaotong Univ."},{"issue":"5","key":"4_CR5","first-page":"1262","volume":"21","author":"XL Wu","year":"2015","unstructured":"Wu, X.L., Zhang, Z.Q., Du, Y.H.: Improved bacteria foraging optimization algorithm for flexible job shop scheduling problem. Comput. Integr. Manuf. Syst. 21(5), 1262\u20131270 (2015)","journal-title":"Comput. Integr. Manuf. Syst."},{"issue":"12","key":"4_CR6","first-page":"2003","volume":"46","author":"HD Lu","year":"2012","unstructured":"Lu, H.D., He, W.P., Zhou, X.: An integrated tabu search algorithm for the lot streaming problem in flexible job shops. J. Shanghai Jiaotong Univ. 46(12), 2003\u20132008 (2012)","journal-title":"J. Shanghai Jiaotong Univ."},{"issue":"10","key":"4_CR7","first-page":"2481","volume":"19","author":"WL Wang","year":"2013","unstructured":"Wang, W.L., Fan, L.X., Xu, X.L.: Multi-objective differential evolution algorithm for flexible job shop batch scheduling problem. Comput. Integr. Manuf. Syst. 19(10), 2481\u20132492 (2013)","journal-title":"Comput. Integr. Manuf. Syst."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.procs.2017.08.023","volume":"112","author":"A Azzouz","year":"2017","unstructured":"Azzouz, A., Ennigrou, M., Said, L.B.: A self-adaptive hybrid algorithm for solving flexible job-shop problem with sequence dependent setup time. Procedia Comput. Sci. 112, 457\u2013466 (2017)","journal-title":"Procedia Comput. Sci."},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60\u201368 (2001)","journal-title":"Simulation"},{"issue":"36","key":"4_CR10","doi-asserted-by":"publisher","first-page":"3902","DOI":"10.1016\/j.cma.2004.09.007","volume":"194","author":"KS Lee","year":"2005","unstructured":"Lee, K.S., Geem, Z.W.: A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput. Methods Appl. Mech. Eng. 194(36), 3902\u20133933 (2005)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"3259","DOI":"10.1016\/j.asoc.2013.02.013","volume":"13","author":"Y Yuan","year":"2013","unstructured":"Yuan, Y., Xu, H., Yang, J.D.: A hybrid harmony search algorithm for the flexible job shop scheduling problem. Appl. Soft Comput. 13, 3259\u20133272 (2013)","journal-title":"Appl. Soft Comput."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.ins.2014.07.039","volume":"289","author":"KZ Gao","year":"2014","unstructured":"Gao, K.Z., Suganthan, P.N., Pan, Q.K.: Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling. Inf. Sci. 289, 76\u201390 (2014)","journal-title":"Inf. Sci."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.asoc.2016.08.007","volume":"49","author":"A Maroosi","year":"2016","unstructured":"Maroosi, A., Muniyandi, R.C., Sundarajan, E.: A parallel membrane inspired harmony search for optimization problems: a case study based on a flexible job shop scheduling problem. Appl. Soft Comput. 49, 120\u2013136 (2016)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","volume":"32","author":"I Kacem","year":"2002","unstructured":"Kacem, I., Hammadi, S., Bome, P.: Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Syst. Man Cybern. Soc. 32(1), 1\u201313 (2002)","journal-title":"IEEE Syst. Man Cybern. Soc."},{"issue":"3","key":"4_CR15","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)","journal-title":"Ann. Oper. Res."}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-2829-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T21:26:14Z","timestamp":1538774774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-2829-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811328282","9789811328299"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-2829-9_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"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":"Beijing","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2018","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":"bicta2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2018.bicta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}