{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:16:39Z","timestamp":1743005799030,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642259432"},{"type":"electronic","value":"9783642259449"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25944-9_5","type":"book-chapter","created":{"date-parts":[[2012,1,3]],"date-time":"2012-01-03T01:15:12Z","timestamp":1325553312000},"page":"32-40","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing the Total Flow Time for Lot Streaming Flow Shop Using an Effective Discrete Harmony Search Algorithm"],"prefix":"10.1007","author":[{"given":"Hong-Yan","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1086\/294867","volume":"34","author":"S. Reiter","year":"1966","unstructured":"Reiter, S.: A System for Managing Job Shop Production. J. Business\u00a034, 371\u2013393 (1966)","journal-title":"J. Business"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0167-6377(89)90013-8","volume":"8","author":"C.N. Potts","year":"1989","unstructured":"Potts, C.N., Baker, K.K.: Flow Shop Scheduling with Lot Streaming. Operation Research Letters\u00a08, 297\u2013303 (1989)","journal-title":"Operation Research Letters"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.rcim.2006.06.007","volume":"24","author":"S. Marimuthu","year":"2008","unstructured":"Marimuthu, S., Ponnambalam, S.G., Jawahar, N.: Evolutionary Algorithms for Scheduling M-machine Flow Shop with Lot Streaming. Robot Comput. Integr. Manuf.\u00a024, 125\u2013139 (2008)","journal-title":"Robot Comput. Integr. Manuf."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.ejor.2007.08.030","volume":"191","author":"C.T. Tseng","year":"2008","unstructured":"Tseng, C.T., Liao, C.J.: A Discrete Particle Swarm Optimization for Lot-streaming Flowshop Scheduling Problem. European Journal of Operation Research\u00a0191, 360\u2013373 (2008)","journal-title":"European Journal of Operation Research"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"2807","DOI":"10.1016\/j.cor.2006.12.030","volume":"35","author":"Q.K. Pan","year":"2008","unstructured":"Pan, Q.K., Tasgetiren, M.F., Liang, Y.C.: A Discrete Particle Swarm Optimization Algorithm for the No-wait Flowshop Scheduling Problem. Computers and Operations Research\u00a035, 2807\u20132839 (2008)","journal-title":"Computers and Operations Research"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1016\/j.jmatprotec.2008.03.013","volume":"209","author":"S. Marimuthu","year":"2009","unstructured":"Marimuthu, S., Ponnambalam, S.G., Jawahar, N.: Threshold Accepting and Ant-colony Optimization Algorithm for Scheduling M-machine Flow Shop with Lot Streaming. J. Mater. Process. Technol.\u00a0209, 1026\u20131041 (2009)","journal-title":"J. Mater. Process. Technol."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"Q.K. Pan","year":"2011","unstructured":"Pan, Q.K., Suganthan, P.N., Tasgetiren, M.F., Chua, T.J.: A Novel Artificial Bee Colony Algorithm for a Lot-streaming Flow Shop Scheduling Problem. Information Sciences\u00a0181, 2455\u20132468 (2011)","journal-title":"Information Sciences"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"Z.W. Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J.H., Loganathan, G.V.: A New Heuristic Optimization Algorithm: Harmony Search. Simulation\u00a076, 60\u201368 (2001)","journal-title":"Simulation"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1080\/03052150500211895","volume":"37","author":"K.S. 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.\u00a037, 663\u2013684 (2005)","journal-title":"Eng. Optim."},{"issue":"3","key":"5_CR10","first-page":"1567","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.\u00a0188(3), 1567\u20131579 (2007)","journal-title":"Appl. Math. Comput."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.3844\/ajassp.2005.1552.1557","volume":"2","author":"Z.W. Geem","year":"2005","unstructured":"Geem, Z.W., Lee, K.S., Park, Y.: Application of Harmony Search to Vehicle Routing. Am. J. Appl. Sci.\u00a02, 1552\u20131557 (2005)","journal-title":"Am. J. Appl. Sci."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1080\/03052150500467430","volume":"38","author":"Z.W. Geem","year":"2006","unstructured":"Geem, Z.W.: Optimal Cost Design of Water Distribution Networks using Harmony Search. Eng. Optim.\u00a038, 259\u2013280 (2006)","journal-title":"Eng. Optim."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1016\/j.jmatprotec.2008.05.029","volume":"209","author":"O. Zarei","year":"2009","unstructured":"Zarei, O., Fesanghary, M., Farshi, B., Saffar, R.J., Rafar, M.R.: Optimization of Multi-pass Face-milling via Harmony Search Algorithm. J. Mater. Process. Technol.\u00a0209, 2386\u20132392 (2009)","journal-title":"J. Mater. Process. Technol."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"2526","DOI":"10.1016\/j.chaos.2008.09.028","volume":"41","author":"L.S. Coelho","year":"2009","unstructured":"Coelho, L.S., Bernert, D.L.A.: An Improved Harmony Search Algorithm for Synchronization of Discrete-time Chaotic System. Chaos Soliton Fract.\u00a041, 2526\u20132532 (2009)","journal-title":"Chaos Soliton Fract."},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"7929","DOI":"10.1016\/j.eswa.2010.04.042","volume":"37","author":"L. Wang","year":"2010","unstructured":"Wang, L., Pan, Q.K., Tasgetiren, M.F.: Minimizing the Total Flow Time in a Flow Shop with Blocking by Using Hybrid Harmony Search Slgorithms. Expert Syst. Appl.\u00a037(3), 7929\u20137936 (2010)","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1016\/j.amc.2010.01.088","volume":"206","author":"Q. Pan","year":"2010","unstructured":"Pan, Q., Suganthan, P.N., Tasgetiren, M.F.: A Self-Adaptive Global Best Harmony Search Algorithm for Continuous Optimization Problems. Applied Mathematics and Computation\u00a0206(3), 830\u2013848 (2010)","journal-title":"Applied Mathematics and Computation"},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"3252","DOI":"10.1016\/j.eswa.2010.08.111","volume":"38","author":"Q. Pan","year":"2011","unstructured":"Pan, Q., Suganthan, P.N., Liang, J.J., Tasgetiren, M.F.: A Local-best Harmony Search Algorithm with Dynamic Sub-harmony Memories for Lot-streaming Flow Shop Scheduling Problem. Expert Systems With Applications\u00a038(4), 3252\u20133259 (2011)","journal-title":"Expert Systems With Applications"},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1080\/03052150903104366","volume":"42","author":"Q. Pan","year":"2010","unstructured":"Pan, Q., Suganthan, P.N.: A Local-best Harmony Search Algorithm with Dynamic Neighborhood. Engineering Optimization\u00a042(3), 101\u2013117 (2010)","journal-title":"Engineering Optimization"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, J.: A Heuristic Algorithm for the M-machine, N-job Flow Shop Sequencing Problem. Omega\u00a011, 91\u201395 (1983)","journal-title":"Omega"},{"issue":"3","key":"5_CR20","first-page":"643","volume":"198","author":"G.H. Mahamed","year":"2008","unstructured":"Mahamed, G.H.: Global-best Harmony Search. Applied Mathematics and Computation\u00a0198(3), 643\u2013656 (2008)","journal-title":"Applied Mathematics and Computation"},{"issue":"3","key":"5_CR21","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/03052150701618153","volume":"40","author":"Y.M.. Cheng","year":"2008","unstructured":"Cheng, Y.M.: An Improved Harmony Search Minimization Algorithm Using Different Slip Surface Generation Methods for Slope Stability Analysis. Engineering Optimization\u00a040(3), 95\u2013115 (2008)","journal-title":"Engineering Optimization"},{"issue":"3","key":"5_CR22","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.: An Improved Harmony Search Algorithm for Solving Optimization Problems. Applied Mathematics and Computation\u00a0188(3), 1567\u20131579 (2007)","journal-title":"Applied Mathematics and Computation"},{"issue":"7","key":"5_CR23","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.cor.2008.12.004","volume":"37","author":"L. Wang","year":"2010","unstructured":"Wang, L.: A Novel Hybrid Discrete Differential Evolution Algorithm for Blocking Flow Shop Scheduling Problems. Computers and Operations Research\u00a037(7), 509\u2013520 (2010)","journal-title":"Computers and Operations Research"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25944-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T17:44:07Z","timestamp":1556041447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25944-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642259432","9783642259449"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25944-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}