{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:10:21Z","timestamp":1777605021435,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662479254","type":"print"},{"value":"9783662479261","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,8,9]],"date-time":"2015-08-09T00:00:00Z","timestamp":1439078400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-662-47926-1_41","type":"book-chapter","created":{"date-parts":[[2015,8,8]],"date-time":"2015-08-08T10:57:37Z","timestamp":1439031457000},"page":"435-445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Pareto-Based Discrete Harmony Search Algorithm for Bi-objective Reentrant Hybrid Flowshop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Jingnan","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolong","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,9]]},"reference":[{"issue":"1","key":"41_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0360-8352(99)00023-6","volume":"37","author":"R Linn","year":"1999","unstructured":"Linn, R., Zhang, W.: Hybrid flow shop scheduling: a survey. Comput. Ind. Eng. 37(1), 57\u201361 (1999)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"41_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz, R., V\u00e1zquez-Rodr\u00edguez, J.A.: The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205(1), 1\u201318 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"41_CR3","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","volume":"37","author":"I Ribas","year":"2010","unstructured":"Ribas, I., Leisten, R., Frami\u00f1an, J.M.: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput. Oper. Res. 37(8), 1439\u20131454 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"19","key":"41_CR4","doi-asserted-by":"publisher","first-page":"5735","DOI":"10.1080\/00207543.2014.910627","volume":"52","author":"KC Ying","year":"2014","unstructured":"Ying, K.C., Lin, S.W., Wan, S.Y.: Bi-objective reentrant hybrid flowshop scheduling: an iterated Pareto greedy algorithm. Int. J. Prod. Res. 52(19), 5735\u20135747 (2014)","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"41_CR5","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1287\/opre.45.5.702","volume":"45","author":"MY Wang","year":"1997","unstructured":"Wang, M.Y., Sethi, S.P., Van De Velde, S.L.: Minimizing makespan in a class of reentrant shops. Oper. Res. 45(5), 702\u2013712 (1997)","journal-title":"Oper. Res."},{"issue":"9\u201310","key":"41_CR6","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1007\/s00170-008-1656-5","volume":"42","author":"HS Choi","year":"2009","unstructured":"Choi, H.S., Kim, H.W., Lee, D.H., Yoon, J., Yun, C.Y., Chae, K.B.: Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates. Int. J. Adv. Manuf. Technol. 42(9\u201310), 963\u2013973 (2009)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"8","key":"41_CR7","doi-asserted-by":"publisher","first-page":"4530","DOI":"10.1016\/j.asoc.2011.08.013","volume":"11","author":"M Hekmatfar","year":"2011","unstructured":"Hekmatfar, M., Ghomi, S.F., Karimi, B.: Two stage reentrant hybrid flow shop with setup times and the criterion of minimizing makespan. Appl. Soft Comput. 11(8), 4530\u20134539 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"41_CR8","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0377-2217(03)00434-X","volume":"159","author":"S Bertel","year":"2004","unstructured":"Bertel, S., Billaut, J.C.: A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. Eur. J. Oper. Res. 159(3), 651\u2013662 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"41_CR9","doi-asserted-by":"publisher","first-page":"2149","DOI":"10.1080\/00207540500050071","volume":"43","author":"SW Choi","year":"2005","unstructured":"Choi, S.W., Kim, Y.D., Lee, G.C.: Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop. Int. J. Prod. Res. 43(11), 2149\u20132167 (2005)","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"41_CR10","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1243\/09544054JEM1318","volume":"223","author":"HW Kim","year":"2009","unstructured":"Kim, H.W., Lee, D.H.: Heuristic algorithms for re-entrant hybrid flow shop scheduling with unrelated parallel machines. Proc. Inst. Mech. Eng. B. 223(4), 433\u2013442 (2009)","journal-title":"Proc. Inst. Mech. Eng. B."},{"issue":"3","key":"41_CR11","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.cie.2011.04.008","volume":"61","author":"HM Cho","year":"2011","unstructured":"Cho, H.M., Bae, S.J., Kim, J., Jeong, I.J.: Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm. Comput. Ind. Eng. 61(3), 529\u2013541 (2011)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"41_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0925-5273(03)00186-5","volume":"88","author":"WL Pearn","year":"2004","unstructured":"Pearn, W.L., Chung, S.H., Chen, A.Y., Yang, M.H.: A case study on the multistage IC final testing scheduling problem with reentry. Int. J. Prod. Econ. 88(3), 257\u2013267 (2004)","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"41_CR13","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ejor.2009.06.031","volume":"203","author":"F Dugardin","year":"2010","unstructured":"Dugardin, F., Yalaoui, F., Amodeo, L.: New multi-objective method to solve reentrant hybrid flow shop scheduling problem. Eur. J. Oper. Res. 203(1), 22\u201331 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"41_CR14","doi-asserted-by":"publisher","first-page":"3514","DOI":"10.1016\/j.eswa.2010.08.139","volume":"38","author":"HS Choi","year":"2011","unstructured":"Choi, H.S., Kim, J.S., Lee, D.H.: Real-time scheduling for reentrant hybrid flow shops: a decision tree based mechanism and its application to a TFT-LCD line. Exp. Syst. Appl. 38(4), 3514\u20133521 (2011)","journal-title":"Exp. Syst. Appl."},{"issue":"1","key":"41_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJBIC.2011.038700","volume":"3","author":"RS Parpinelli","year":"2011","unstructured":"Parpinelli, R.S., Lopes, H.S.: New inspirations in swarm intelligence: a survey. Int. J. Bio-Inspired Comput. 3(1), 1\u201316 (2011)","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"41_CR16","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. Inform. Sciences. 237, 82\u2013117 (2013)","journal-title":"Inform. Sciences."},{"issue":"2","key":"41_CR17","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. Simul. 76(2), 60\u201368 (2001)","journal-title":"Simul."},{"issue":"36","key":"41_CR18","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. Meth. Appl. Mech. Eng. 194(36), 3902\u20133933 (2005)","journal-title":"Comput. Meth. Appl. Mech. Eng."},{"issue":"8","key":"41_CR19","doi-asserted-by":"publisher","first-page":"1818","DOI":"10.1016\/j.engappai.2013.05.008","volume":"26","author":"D Manjarres","year":"2013","unstructured":"Manjarres, D., Landa-Torres, I., Gil-Lopez, S., Del Ser, J., Bilbao, M.N., Salcedo-Sanz, S., Geem, Z.W.: A survey on applications of the harmony search algorithm. Eng. Appl. Artif. Intell. 26(8), 1818\u20131831 (2013)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"41_CR20","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.compstruc.2011.10.022","volume":"92","author":"SO Degertekin","year":"2012","unstructured":"Degertekin, S.O.: Improved harmony search algorithms for sizing optimization of truss structures. Comput. Struct. 92, 229\u2013241 (2012)","journal-title":"Comput. Struct."},{"issue":"3","key":"41_CR21","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/j.ijepes.2010.12.031","volume":"33","author":"S Sivasubramani","year":"2011","unstructured":"Sivasubramani, S., Swarup, K.S.: Multi-objective harmony search algorithm for optimal power flow problem. Int. J. Electr. Power Energ. Syst. 33(3), 745\u2013752 (2011)","journal-title":"Int. J. Electr. Power Energ. Syst."},{"issue":"3","key":"41_CR22","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1016\/j.ijepes.2010.11.018","volume":"33","author":"AH Khazali","year":"2011","unstructured":"Khazali, A.H., Kalantar, M.: Optimal reactive power dispatch based on harmony search algorithm. Int. J. Electr. Power Energ. Syst. 33(3), 684\u2013692 (2011)","journal-title":"Int. J. Electr. Power Energ. Syst."},{"issue":"6","key":"41_CR23","doi-asserted-by":"publisher","first-page":"1509","DOI":"10.1109\/TSMCB.2012.2193613","volume":"42","author":"R Diao","year":"2012","unstructured":"Diao, R., Shen, Q.: Feature selection with harmony search. IEEE Tran. Syst. Man. Cybernet. B. 42(6), 1509\u20131523 (2012)","journal-title":"IEEE Tran. Syst. Man. Cybernet. B."},{"issue":"1","key":"41_CR24","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.cie.2011.02.013","volume":"61","author":"L Wang","year":"2011","unstructured":"Wang, L., Pan, Q.K., Tasgetiren, M.F.: A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem. Comput. Ind. Eng. 61(1), 76\u201383 (2011)","journal-title":"Comput. Ind. Eng."},{"key":"41_CR25","volume-title":"Statistical Inference","author":"G Casella","year":"2002","unstructured":"Casella, G., Berger, R.L.: Statistical Inference, vol. 2. Duxbury, Pacific Grove (2002)"}],"container-title":["Advances in Intelligent Systems and Computing","Harmony Search Algorithm"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47926-1_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:48:26Z","timestamp":1674568106000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47926-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,9]]},"ISBN":["9783662479254","9783662479261"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47926-1_41","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,9]]},"assertion":[{"value":"9 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}