{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:07:48Z","timestamp":1742940468748,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662479254"},{"type":"electronic","value":"9783662479261"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-47926-1_11","type":"book-chapter","created":{"date-parts":[[2015,8,8]],"date-time":"2015-08-08T06:57:37Z","timestamp":1439017057000},"page":"97-108","source":"Crossref","is-referenced-by-count":5,"title":["An Improved Harmony Search Algorithm for the Distributed Two Machine Flow-Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Jin","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingnan","family":"Shen","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":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Nav. Res. Logist. Quart. 1, 61\u201368 (1954)","journal-title":"Nav. Res. Logist. Quart."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/opre.34.1.130","volume":"34","author":"PS Ku","year":"1986","unstructured":"Ku, P.S., Niu, S.C.: On Johnson\u2019s two-machine flow shop with random processing times. Oper. Res. 34, 130\u2013136 (1986)","journal-title":"Oper. Res."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0377-2217(95)00351-7","volume":"90","author":"The two-machine total completion time flow shop problem","year":"1996","unstructured":"The two-machine total completion time flow shop problem: Della Croce, F., Narayan, V., Tadei, R. Eur. J. Oper. Res. 90, 227\u2013237 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/S0377-2217(98)00009-5","volume":"113","author":"S Sayin","year":"1999","unstructured":"Sayin, S., Karabati, S.: Theory and Methodology: a bicriteria approach to the two-machine flow shop scheduling problem. Eur. J. Oper. Res. 113, 435\u2013449 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0377-2217(01)00374-5","volume":"139","author":"Della Croce","year":"2002","unstructured":"Croce, Della: F., Ghirardi, M., Tadei, R.: An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. Eur. J. Oper. Res. 139, 293\u2013301 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/S0305-0548(00)00090-3","volume":"29","author":"JCH Pan","year":"2002","unstructured":"Pan, J.C.H., Chen, J.S., Chao, C.M.: Minimizing tardiness in a two-machine flow-shop. Comput. Oper. Res. 29, 869\u2013885 (2002)","journal-title":"Comput. Oper. Res."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/S0377-2217(03)00192-9","volume":"157","author":"B Tokta\u015f","year":"2004","unstructured":"Tokta\u015f, B., Azizo\u011flu, M., K\u00f6ksalan, S.K.: Two-machine flow shop scheduling with two criteria: maximum earliness and makespan. Eur. J. Oper. Res. 157, 286\u2013295 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1016\/j.cor.2006.03.021","volume":"35","author":"J Blazewicz","year":"2008","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., Werner, F.: Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date. Comput. Oper. Res. 35, 574\u2013599 (2008)","journal-title":"Comput. Oper. Res."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cor.2009.03.019","volume":"37","author":"CT Ng","year":"2010","unstructured":"Ng, C.T., Wang, J.B., Cheng, T.C.E., Liu, L.L.: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs. Comput. Oper. Res. 37, 83\u201390 (2010)","journal-title":"Comput. Oper. Res."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ejor.2011.08.029","volume":"217","author":"A Kasperski","year":"2012","unstructured":"Kasperski, A., Kurpisz, A., Zieli\u0144ski, P.: Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. Eur. J. Oper. Res. 217, 36\u201343 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1024653810491","volume":"14","author":"HZ Jia","year":"2003","unstructured":"Jia, H.Z., Nee, A.Y.C., Fuh, J.Y.H., Zhang, Y.F.: A modified genetic algorithm for distributed scheduling problems. J. Intell. Manuf. 14, 351\u2013362 (2003)","journal-title":"J. Intell. Manuf."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.cie.2005.01.016","volume":"48","author":"C Moon","year":"2005","unstructured":"Moon, C., Seo, Y.: Evolutionary algorithm for advanced process planning and scheduling in a multi-plant. Comput. Ind. Eng. 48, 311\u2013325 (2005)","journal-title":"Comput. Ind. Eng."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1080\/00207540500319229","volume":"44","author":"FTS Chan","year":"2006","unstructured":"Chan, F.T.S., Chung, S.H., Chan, P.L.Y.: Application of genetic algorithms with dominant genes in a distributed scheduling problem in flexible manufacturing systems. Int. J. Prod. Res. 44, 523\u2013543 (2006)","journal-title":"Int. J. Prod. Res."},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1016\/j.cor.2009.06.019","volume":"37","author":"B Naderi","year":"2010","unstructured":"Naderi, B., Ruiz, R.: The distributed permutation flowshop scheduling problem. Comput. Oper. Res. 37, 754\u2013768 (2010)","journal-title":"Comput. Oper. Res."},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.ins.2012.07.020","volume":"219","author":"J Behnamian","year":"2013","unstructured":"Behnamian, J.: Fatemi Ghomi, S.M.T.: The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine. Inf. Sci. 219, 181\u2013196 (2013)","journal-title":"Inf. Sci."},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"5292","DOI":"10.1080\/00207543.2013.807955","volume":"51","author":"S Hatami","year":"2013","unstructured":"Hatami, S., Ruiz, R., Andr\u00e9s-Romano, C.: The distributed assembly permutation flowshop scheduling problem. Int. J. Prod. Res. 51, 5292\u20135308 (2013)","journal-title":"Int. J. Prod. Res."},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.ijpe.2013.05.004","volume":"145","author":"SY Wang","year":"2013","unstructured":"Wang, S.Y., Wang, L., Liu, M., Xu, Y.: An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem. Int. J. Prod. Econ. 145, 387\u2013396 (2013)","journal-title":"Int. J. Prod. Econ."},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"7754","DOI":"10.1016\/j.eswa.2014.06.023","volume":"41","author":"B Naderi","year":"2014","unstructured":"Naderi, B., Azab, A.: Modeling and heuristics for scheduling of distributed job shops. Expert Syst. Appl. 41, 7754\u20137763 (2014)","journal-title":"Expert Syst. Appl."},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: \u201cStrong\u201d NP-completeness results: motivation, examples, and implications. J. ACM 25, 499\u2013508 (1978)","journal-title":"J. ACM"},{"key":"11_CR20","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, 60\u201368 (2001)","journal-title":"Simul."},{"key":"11_CR21","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, 3902\u20133933 (2005)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.3844\/ajassp.2005.1552.1557","volume":"2","author":"ZW Geem","year":"2005","unstructured":"Geem, Z.W., Lee, K.S., Park, Y.: Application of harmony search to vehicle routing. Am. J. Appl. Sci. 2, 1552 (2005)","journal-title":"Am. J. Appl. Sci."},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.compstruc.2009.01.003","volume":"87","author":"A Kaveh","year":"2009","unstructured":"Kaveh, A., Talatahari, S.: Particle swarm optimizer, ant colony strategy and harmony search scheme hybridized for optimization of truss structures. Comput. Struct. 87, 267\u2013283 (2009)","journal-title":"Comput. Struct."},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1080\/03052150802449227","volume":"41","author":"ZW Geem","year":"2009","unstructured":"Geem, Z.W.: Particle-swarm harmony search for water network design. Eng. Optim. 41, 297\u2013311 (2009)","journal-title":"Eng. Optim."},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1109\/IDAMS.2010.2076839","volume":"26","author":"Srinivasa Rao","year":"2011","unstructured":"Rao, Srinivasa: R., Narasimham, S.V.L., Ramalinga Raju, M., Srinivasa Rao, A.: Optimal network reconfiguration of large-scale distribution system using harmony search algorithm. IEEE Trans. Power Syst. 26, 1080\u20131088 (2011)","journal-title":"IEEE Trans. Power Syst."},{"key":"11_CR26","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, 76\u201383 (2011)","journal-title":"Comput. Ind. Eng."},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1080\/03052150500211895","volume":"37","author":"KS Lee","year":"2005","unstructured":"Lee, K.S., Geem, Z.W., Lee, S.H., Bae, K.W.: The harmony search heuristic algorithm for discrete structural optimization. Eng. Optim. 37, 663\u2013684 (2005)","journal-title":"Eng. Optim."},{"key":"11_CR28","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1016\/j.amc.2006.11.033","volume":"188","author":"M Mahdavi","year":"2007","unstructured":"Mahdavi, M., Fesanghary, M., Damangir, E.: An improved harmony search algorithm for solving optimization problems. Appl. Math. Comput. 188, 1567\u20131579 (2007)","journal-title":"Appl. Math. Comput."},{"key":"11_CR29","volume-title":"Introduction to Sequencing and Scheduling","author":"KR Baker","year":"1974","unstructured":"Baker, K.R.: Introduction to Sequencing and Scheduling. Wiley, New York (1974)"},{"key":"11_CR30","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.amc.2007.09.004","volume":"198","author":"MGH Omran","year":"2008","unstructured":"Omran, M.G.H., Mahdavi, M.: Global-best harmony search. Appl. Math. Comput. 198, 643\u2013656 (2008)","journal-title":"Appl. Math. Comput."}],"container-title":["Advances in Intelligent Systems and Computing","Harmony Search Algorithm"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47926-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T11:39:09Z","timestamp":1559216349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-47926-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,9]]},"ISBN":["9783662479254","9783662479261"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47926-1_11","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015,8,9]]}}}