{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T21:34:21Z","timestamp":1725658461581},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642247279"},{"type":"electronic","value":"9783642247286"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24728-6_80","type":"book-chapter","created":{"date-parts":[[2012,2,9]],"date-time":"2012-02-09T21:52:40Z","timestamp":1328824360000},"page":"592-599","source":"Crossref","is-referenced-by-count":1,"title":["Discrete Harmony Search Algorithm for the No Wait Flow Shop Scheduling Problem with Makespan Criterion"],"prefix":"10.1007","author":[{"given":"Kaizhou","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengxian","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junqing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"80_CR1","first-page":"787","volume":"57","author":"B. Qian","year":"2009","unstructured":"Qian, B., Wang, L., Hu, R., Huang, D.X., Wang, X.: A DE-based Approach to No-wait Flow Shop Scheduling. Comput. Oper. Res.\u00a057, 787\u2013805 (2009)","journal-title":"Comput. Oper. Res."},{"key":"80_CR2","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/TEVC.2003.810752","volume":"7","author":"H. Ishibuchi","year":"2003","unstructured":"Ishibuchi, H., Yoshida, I., Murata, T.: Balance Between Genetic Search and Local Search in Memetic Algorithms for Multi-objective Permutation Flow Shop Scheduling. IEEE T. Evolut. Comput.\u00a07, 204\u2013223 (2003)","journal-title":"IEEE T. Evolut. Comput."},{"key":"80_CR3","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1057\/jors.1994.65","volume":"45","author":"C. Rajendran","year":"1994","unstructured":"Rajendran, C.: A No-wait Flowshop Scheduling Heuristic to Minimize Makespan. J. Oper. Res. Soc.\u00a045, 472\u2013478 (1994)","journal-title":"J. Oper. Res. Soc."},{"key":"80_CR4","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"N.G. Hall","year":"1996","unstructured":"Hall, N.G., Sriskandarayah, C.: A Survey of Machine Scheduling Problems with Blocking and No-wait in Process. Oper. Res.\u00a044, 510\u2013525 (1996)","journal-title":"Oper. Res."},{"key":"80_CR5","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0377-2217(99)00224-6","volume":"125","author":"J. Grabowski","year":"2000","unstructured":"Grabowski, J., Pempera, J.: Sequencing of Jobs in Some Production System. Eur. J. Oper. Res.\u00a0125, 535\u2013550 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"80_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0377-2217(99)00285-4","volume":"126","author":"W. Raaymakers","year":"2000","unstructured":"Raaymakers, W., Hoogeveen, J.: Scheduling Multipurpose Batch Process Industries with No-wait Restrictions by Simulated Annealing. Eur. J. Oper. Res.\u00a0126, 131\u2013151 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"80_CR7","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"80_CR8","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1057\/jors.1976.176","volume":"27","author":"M.C. Bonney","year":"1976","unstructured":"Bonney, M.C., Gundry, S.W.: Solutions to the Constrained Flow Shop Sequencing Problem. Oper. Res. Quart.\u00a027, 869\u2013883 (1976)","journal-title":"Oper. Res. Quart."},{"key":"80_CR9","first-page":"343","volume":"18","author":"J.R. King","year":"1980","unstructured":"King, J.R., Spachis, A.S.: Heuristics for Flow Shop Scheduling. Int. J. Prod. Res.\u00a018, 343\u2013357 (1980)","journal-title":"Int. J. Prod. Res."},{"key":"80_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0925-5273(93)90042-J","volume":"32","author":"R. Gangadharan","year":"1993","unstructured":"Gangadharan, R., Rajendran, C.: Heuristic Algorithms for Scheduling in No-wait Flow Shop. Int. J. Prod. Econ.\u00a032, 285\u2013290 (1993)","journal-title":"Int. J. Prod. Econ."},{"key":"80_CR11","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1002\/1520-6750(199010)37:5<695::AID-NAV3220370508>3.0.CO;2-L","volume":"37","author":"C. Rajendran","year":"1990","unstructured":"Rajendran, C., Chaudhuri, D.: Heuristic Algorithms for Continuous Flow-shop Problem. Nav. Res. Log.\u00a037, 695\u2013705 (1990)","journal-title":"Nav. Res. Log."},{"key":"80_CR12","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1016\/S0305-0548(02)00068-0","volume":"30","author":"T. Aldowaisan","year":"2003","unstructured":"Aldowaisan, T., Allahverdi, A.: New Heuristics for No-wait Flowshops to Minimize Makespan. Comput. Oper. Res.\u00a030, 1219\u20131231 (2003)","journal-title":"Comput. Oper. Res."},{"key":"80_CR13","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/S0167-6377(03)00005-1","volume":"31","author":"C.J. Schuster","year":"2003","unstructured":"Schuster, C.J., Framinan, J.M.: Approximative Procedure for No-wait Job Shop Scheduling. Oper. Res. Lett.\u00a031, 308\u2013318 (2003)","journal-title":"Oper. Res. Lett."},{"key":"80_CR14","doi-asserted-by":"publisher","first-page":"2197","DOI":"10.1016\/j.cor.2004.02.009","volume":"32","author":"J. Grabowski","year":"2005","unstructured":"Grabowski, J., Pempera, J.: Some Local Search Algorithms for No-wait Flow-shop Problem with Makespan Criterion. Comput. Oper. Res.\u00a032, 2197\u20132212 (2005)","journal-title":"Comput. Oper. Res."},{"key":"80_CR15","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., Fatih, T.M., Liang, Y.C.: A Discrete Particle Swarm Optimization Algorithm for the No-wait Flow Shop Scheduling Problem. Comput. Oper. Res.\u00a035, 2807\u20132839 (2008)","journal-title":"Comput. Oper. Res."},{"key":"80_CR16","doi-asserted-by":"publisher","first-page":"2498","DOI":"10.1016\/j.cor.2008.10.008","volume":"36","author":"Q.K. Pan","year":"2009","unstructured":"Pan, Q.K., Wang, L., Qian, B.: A Novel Differential Evolution Algorithm for Bi-criteria No-wait Flow Shop Scheduling Problem. Comput. Oper. Res.\u00a036, 2498\u20132511 (2009)","journal-title":"Comput. Oper. Res."},{"key":"80_CR17","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"N.G. Hall","year":"1996","unstructured":"Hall, N.G., Sriskandarayah, C.: A Survey of Machine Scheduling Problems with Blocking and No-wait in process. Oper. Res.\u00a044, 510\u2013525 (1996)","journal-title":"Oper. Res."},{"key":"80_CR18","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":"80_CR19","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. Optimiz.\u00a037, 663\u2013684 (2005)","journal-title":"Eng. Optimiz."},{"key":"80_CR20","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":"80_CR21","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. Optimiz.\u00a038, 259\u2013280 (2006)","journal-title":"Eng. Optimiz."},{"key":"80_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-73007-1_39","volume-title":"Computational and Ambient Intelligence","author":"Z.W. Geem","year":"2007","unstructured":"Geem, Z.W.: Optimal Scheduling of Multiple Dam System Using Harmony Search Algorithm. In: Sandoval, F., Prieto, A.G., Cabestany, J., Gra\u00f1a, M. (eds.) IWANN 2007. LNCS, vol.\u00a04507, pp. 316\u2013323. Springer, Heidelberg (2007)"},{"key":"80_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-74819-9_46","volume-title":"Knowledge-Based Intelligent Information and Engineering Systems","author":"Z.W. Geem","year":"2007","unstructured":"Geem, Z.W.: Harmony Search Algorithm for Solving Sudoku. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part I. LNCS (LNAI), vol.\u00a04692, pp. 371\u2013378. Springer, Heidelberg (2007)"},{"key":"80_CR24","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1016\/j.jmatprotec.2008.05.029","volume":"209","author":"F.M. Zarei","year":"2009","unstructured":"Zarei, F.M., Farshi, B., Jalili, S.R., Rafar, M.R.: Optimization of Multi-pass Face-milling via Harmony Search Algorithm. J. Mater. Process. Tech.\u00a0209, 2386\u20132392 (2009)","journal-title":"J. Mater. Process. Tech."},{"key":"80_CR25","doi-asserted-by":"publisher","first-page":"2526","DOI":"10.1016\/j.chaos.2008.09.028","volume":"41","author":"S.C. Leandro","year":"2009","unstructured":"Leandro, S.C.: An Improved Harmony Search Algorithm for Synchronization of Discrete-time Chaotic System. Chaos Solitons Fract\u00a041, 2526\u20132532 (2009)","journal-title":"Chaos Solitons Fract"},{"key":"80_CR26","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 Algorithms. Expert. Syst. Appl.\u00a037, 7929\u20137936 (2010)","journal-title":"Expert. Syst. Appl."},{"key":"80_CR27","doi-asserted-by":"publisher","first-page":"3252","DOI":"10.1016\/j.eswa.2010.08.111","volume":"38","author":"Q.K. Pan","year":"2011","unstructured":"Pan, Q.K., Suganthan, P.N., Liang, J.J., Tasgetiren, M.: Fatih: A Local-best Harmony Search Algorithm with Dynamic Sub-harmony Memories for Lot-streaming Flow Shop scheduling problem. Expert. Syst. Appl.\u00a038, 3252\u20133259 (2011)","journal-title":"Expert. Syst. Appl."},{"key":"80_CR28","doi-asserted-by":"crossref","unstructured":"Gao, K.Z., Pan, Q.K., Li, J.Q.: Discrete Harmony Search Algorithm for the No-wait Flow Shop Scheduling Problem with Total Flow Time Criterion. Int. J. Adv. Manuf. Technol., doi: 10.1007\/s00170-011-3197-6","DOI":"10.1007\/s00170-011-3197-6"},{"key":"80_CR29","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.ejor.2006.01.036","volume":"178","author":"P.J. Kalczynski","year":"2007","unstructured":"Kalczynski, P.J., Kamburowski, J.: On No-wait and No-idle Flow Shops with Makespan Criterion. Eur. J. Oper. Res.\u00a0178, 677\u2013685 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"80_CR30","doi-asserted-by":"publisher","first-page":"2197","DOI":"10.1016\/j.cor.2004.02.009","volume":"32","author":"J. Grabowski","year":"2005","unstructured":"Grabowski, J., Pempera, J.: Some Local Search Algorithms for No-wait Flow-shop Problem with Makespan Criterion. Comput. Oper. Res.\u00a032, 2197\u20132212 (2005)","journal-title":"Comput. Oper. Res."},{"key":"80_CR31","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s001700300005","volume":"21","author":"L. Wang","year":"2003","unstructured":"Wang, L., Zheng, D.Z.: An Effective Hybrid Heuristic for Flow Shop Scheduling. Int. J. Adv. Manuf. Technol.\u00a021, 38\u201344 (2003)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"80_CR32","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., Ham, I.: A Heuristic Algorithm for the m-machine, n-job Flow Shop Sequencing Problem. Omega\u00a011, 91\u201395 (1983)","journal-title":"Omega"},{"key":"80_CR33","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/S0924-0136(00)00720-2","volume":"107","author":"B. Edy","year":"2000","unstructured":"Edy, B.: Heuristic Algorithm for Scheduling in the No-wait Flow Shop. J. Mater. Process. Tech.\u00a0107, 459\u2013465 (2000)","journal-title":"J. Mater. Process. Tech."},{"key":"80_CR34","doi-asserted-by":"crossref","unstructured":"Bassem, J.M., Eddaly, P.S.: A Hybrid Genetic Algorithm for Solving No-wait Flow Shop Scheduling Problems. Int. J. Adv. Manuf. Technol., doi: 10.1007\/s00170-010-3009-4","DOI":"10.1007\/s00170-010-3009-4"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24728-6_80","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T08:39:55Z","timestamp":1556354395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24728-6_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642247279","9783642247286"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24728-6_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}