{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:38:32Z","timestamp":1761896312661},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319422909"},{"type":"electronic","value":"9783319422916"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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-319-42291-6_52","type":"book-chapter","created":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T15:10:22Z","timestamp":1468249822000},"page":"517-526","source":"Crossref","is-referenced-by-count":3,"title":["A Discrete Invasive Weed Optimization Algorithm for the No-Wait Lot-Streaming Flow Shop Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Hong-Yan","family":"Sang","sequence":"first","affiliation":[]},{"given":"Pei-Yong","family":"Duan","sequence":"additional","affiliation":[]},{"given":"Jun-Qing","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,12]]},"reference":[{"issue":"8","key":"52_CR1","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1080\/00207540412331325396","volume":"4","author":"JH Chang","year":"2005","unstructured":"Chang, J.H., Chiu, H.N.: A comprehensive review of lot streaming. Int. J. Prod. Res. 4(8), 1515\u20131536 (2005)","journal-title":"Int. J. Prod. Res."},{"key":"52_CR2","doi-asserted-by":"crossref","first-page":"1301","DOI":"10.1016\/S0305-0548(01)00032-6","volume":"29","author":"SH Yoon","year":"2002","unstructured":"Yoon, S.H., Ventura, J.A.: Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling. Comput. Oper. Res. 29, 1301\u20131315 (2002)","journal-title":"Comput. Oper. Res."},{"key":"52_CR3","first-page":"779","volume":"34","author":"SH Yoon","year":"2002","unstructured":"Yoon, S.H., Ventura, J.A.: An application of genetic algorithms to lot-streaming flow shop scheduling. IIE Trans. 34, 779\u2013787 (2002)","journal-title":"IIE Trans."},{"key":"52_CR4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1243\/09544054JEM334","volume":"221","author":"S Marimuthu","year":"2007","unstructured":"Marimuthu, S., Ponnambalam, S.G., Jawahar, N.: Tabu search and simulated annealing algorithms for scheduling in flow shops with lot streaming. Proc. Inst. Mech. Eng. Part B J. Eng. Manuf. 221, 317\u2013331 (2007)","journal-title":"Proc. Inst. Mech. Eng. Part B J. Eng. Manuf."},{"key":"52_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.rcim.2006.06.007","volume":"24","author":"S Marimulthu","year":"2008","unstructured":"Marimulthu, S., Ponnambalam, S.G., Jawahar, N.: Evolutionary algorithms for scheduling m-machine flow shop with lot streaming. Robot. Comput.-Integr. Manuf. 24, 125\u2013139 (2008)","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"52_CR6","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1016\/j.jmatprotec.2008.03.013","volume":"209","author":"S Marimulthu","year":"2009","unstructured":"Marimulthu, S., Ponnambalam, S.G., Jawaha, N.: Threshold accepting and ant-colony optimization algorithm for scheduling m-machine flow shop with lot streaming. J. Mater. Process. Technol. 209, 1026\u20131041 (2009)","journal-title":"J. Mater. Process. Technol."},{"key":"52_CR7","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.ejor.2007.08.030","volume":"191","author":"CT Tseng","year":"2008","unstructured":"Tseng, C.T., Liao, C.J.: A discrete particle swarm optimization for lot-streaming flow shop scheduling problem. Eur. J. Oper. Res. 191, 360\u2013373 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"52_CR8","first-page":"695","volume":"31","author":"C Sriskandarajah","year":"1999","unstructured":"Sriskandarajah, C., Wagneur, E.: Lot streaming and scheduling multiple products in two-machine no-wait flowshops. IIE Trans. 31(8), 695\u2013707 (1999)","journal-title":"IIE Trans."},{"issue":"1","key":"52_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0360-8352(00)00035-8","volume":"38","author":"S Kumar","year":"2000","unstructured":"Kumar, S., Bagchi, T.P., Sriskandarajah, C.: Lot streaming and scheduling heuristics for m-machine no-wait flowshops. Comput. Ind. Eng. 38(1), 149\u2013172 (2000)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"52_CR10","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1080\/07408170304379","volume":"35","author":"J Chen","year":"2003","unstructured":"Chen, J., Steiner, G.: On discrete lot streaming in no-wait flow shops. IIE Trans. 35(2), 91\u2013101 (2003)","journal-title":"IIE Trans."},{"issue":"4","key":"52_CR11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1023\/A:1024042209719","volume":"6","author":"NG Hall","year":"2003","unstructured":"Hall, N.G., Laporte, G., Selvarajah, E.: Scheduling and lot streaming in flowshops with no-wait in process. J. Sched. 6(4), 339\u2013354 (2003)","journal-title":"J. Sched."},{"issue":"11\u201312","key":"52_CR12","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1007\/s00170-007-1236-0","volume":"44","author":"K Kim","year":"2009","unstructured":"Kim, K., Jeong, I.J.: Flow shop scheduling with no-wait flexible lot streaming using an adaptive genetic algorithm. Int. J. Adv. Manuf. Technol. 44(11\u201312), 1181\u20131190 (2009)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"52_CR13","doi-asserted-by":"crossref","unstructured":"Kim, K.W., Jeong, I.J.: Flow shop scheduling with no-wait flexible lot streaming using adaptive genetic algorithm. In: International Conference on Computational Science and its Applications, ICCSA 2007. IEEE, 474\u2013479 (2007)","DOI":"10.1109\/ICCSA.2007.45"},{"key":"52_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1007\/978-3-319-09339-0_67","volume-title":"Intelligent Computing Methodologies","author":"P Zhang","year":"2014","unstructured":"Zhang, P., Wang, L.: Grouped fruit-fly optimization algorithm for the no-wait lot streaming flow shop scheduling. In: Huang, D.-S., Jo, K.-H., Wang, L. (eds.) ICIC 2014. LNCS, vol. 8589, pp. 664\u2013674. Springer, Heidelberg (2014)"},{"key":"52_CR15","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.ecoinf.2006.07.003","volume":"1","author":"AR Mehrabian","year":"2006","unstructured":"Mehrabian, A.R., Lucas, C.: A novel numerical optimization algorithm inspired from weed colonization. Ecol. Inform. 1, 355\u2013366 (2006)","journal-title":"Ecol. Inform."},{"key":"52_CR16","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1016\/j.neucom.2014.01.078","volume":"151","author":"Y Zhou","year":"2015","unstructured":"Zhou, Y., Luo, Q., Chen, H.: A discrete invasive weed optimization algorithm for solving traveling salesman problem. Neurocomputing 151, 1227\u20131236 (2015)","journal-title":"Neurocomputing"},{"key":"52_CR17","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.swevo.2016.01.001","volume":"28","author":"AR Pouya","year":"2016","unstructured":"Pouya, A.R., Solimanpur, M., Rezaee, M.J.: Solving multi-objective portfolio optimization problem using invasive weed optimization. Swarm Evol. Comput. 28, 42\u201357 (2016)","journal-title":"Swarm Evol. Comput."},{"issue":"Suppl. 1","key":"52_CR18","doi-asserted-by":"crossref","first-page":"205","DOI":"10.2298\/TSCI15S1S05H","volume":"19","author":"E Hetmaniok","year":"2015","unstructured":"Hetmaniok, E., Slota, D., Zielonka, A.: Experimental verification of approximate solution of the inverse Stefan problem obtained by applying the invasive weed optimization algorithm. Therm. Sci. 19(Suppl. 1), 205\u2013212 (2015)","journal-title":"Therm. Sci."},{"key":"52_CR19","doi-asserted-by":"publisher","unstructured":"Sang, H.Y., Pan, Q.K., Duan, P.Y.: An effective discrete invasive weed optimization algorithm for lot-streaming flowshop scheduling problems. J. Intell. Manuf. 1\u201313 (2015). doi: 10.1007\/s10845-015-1182-x","DOI":"10.1007\/s10845-015-1182-x"},{"issue":"5","key":"52_CR20","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.neucom.2013.05.063","volume":"137","author":"Y Zhou","year":"2014","unstructured":"Zhou, Y., Chen, H., Zhou, G.: Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem. Neurocomputing 137(5), 285\u2013292 (2014)","journal-title":"Neurocomputing"},{"key":"52_CR21","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.jfranklin.2009.02.006","volume":"348","author":"AR Mehrabian","year":"2011","unstructured":"Mehrabian, A.R., Koma, A.Y.: A novel technique for optimal placement of piezoelectric actuators on smart structures. J. Franklin Inst. 348, 12\u201323 (2011)","journal-title":"J. Franklin Inst."},{"issue":"1","key":"52_CR22","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E.J.R., Ham, I.: A heuristic algorithm for the m machine, n job flowshop sequencing problem. Omega-Int. J. Manag. Sci. 11(1), 91\u201395 (1983)","journal-title":"Omega-Int. J. Manag. Sci."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42291-6_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T18:11:59Z","timestamp":1498327919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42291-6_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319422909","9783319422916"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42291-6_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}