{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T03:56:07Z","timestamp":1769918167314,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,12,19]],"date-time":"2015-12-19T00:00:00Z","timestamp":1450483200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61174187"],"award-info":[{"award-number":["61174187"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10845-015-1182-x","type":"journal-article","created":{"date-parts":[[2015,12,19]],"date-time":"2015-12-19T10:28:09Z","timestamp":1450520889000},"page":"1337-1349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":59,"title":["An effective discrete invasive weed optimization algorithm for lot-streaming flowshop scheduling problems"],"prefix":"10.1007","volume":"29","author":[{"given":"Hong-Yan","family":"Sang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quan-Ke","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pei-Yong","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun-Qing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,19]]},"reference":[{"key":"1182_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10845-013-0775-5","volume":"26","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi, A., & Aydilek, H. (2015). Harun the two stage assembly flowshop scheduling problem to minimize total tardiness. Journal of Intelligent Manufacturing, 26, 225\u2013237.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"1182_CR2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.cor.2014.06.003","volume":"51","author":"A Allahverdi","year":"2014","unstructured":"Allahverdi, A., Aydilek, H., & Aydilek, A. (2014). Single machine scheduling problem with interval processing times to minimize mean weighted completion time. Computers & Operations Research, 51, 200\u2013207.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"1182_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A Allahverdi","year":"1999","unstructured":"Allahverdi, A., Gupta, J. N. D., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega-International Journal of Management Science, 27(2), 219\u2013239.","journal-title":"Omega-International Journal of Management Science"},{"key":"1182_CR4","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.cor.2012.06.002","volume":"40","author":"U Benlic","year":"2013","unstructured":"Benlic, U., & Hao, J.-K. (2013). Breakout local search for maximum clique problems. Computers & Operations Research, 40, 192\u2013206.","journal-title":"Computers & Operations Research"},{"issue":"5","key":"1182_CR5","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1080\/00207543.2013.848304","volume":"52","author":"G Vijay Chakaravarthy","year":"2014","unstructured":"Chakaravarthy, G. Vijay, Marimuthu, S., Ponnambalam, S. G., & Kanagaraj, G. (2014). Improved sheep flock heredity algorithm and artificial bee colony algorithm for scheduling $$m$$ m -machine flow shops lot streaming with equal size sublot problems. International Journal of Production Research, 52(5), 1509\u20131527.","journal-title":"International Journal of Production Research"},{"issue":"6","key":"1182_CR6","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1080\/18756891.2012.747713","volume":"5","author":"G Vijay Chakaravarthy","year":"2012","unstructured":"Chakaravarthy, G. Vijay, Marimuthu, S., & Sait, A. Naveen. (2012). Comparison of firefly algorithm and artificial immune system algorithm for lot streaming in $$m$$ m -machine flow shop scheduling. International Journal of Computational Intelligence Systems, 5(6), 1184\u20131199.","journal-title":"International Journal of Computational Intelligence Systems"},{"key":"1182_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10845-011-0552-2","volume":"24","author":"G Vijay Chakaravarthy","year":"2013","unstructured":"Chakaravarthy, G. Vijay, Marimuthu, S., & Sait, A. Naveen. (2013). Performance evaluation of proposed differential evolution and particle swarm optimization algorithms for scheduling $$m$$ m -machine flow shops with lot streaming. Journal of Intelligent Manufacturing, 24, 175\u2013191.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"8","key":"1182_CR8","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1080\/00207540412331325396","volume":"43","author":"JH Chang","year":"2005","unstructured":"Chang, J. H., & Chiu, H. N. (2005). A comprehensive review of lot streaming. International Journal of Production Research, 43(8), 1515\u20131536.","journal-title":"International Journal of Production Research"},{"issue":"23\u201324","key":"1182_CR9","doi-asserted-by":"crossref","first-page":"7023","DOI":"10.1080\/00207543.2013.774506","volume":"51","author":"M Cheng","year":"2013","unstructured":"Cheng, M., Mukherjee, N. J., & Sarin, S. C. (2013). A review of lot streaming. International Journal of Production Research, 51(23\u201324), 7023\u20137046.","journal-title":"International Journal of Production Research"},{"issue":"6","key":"1182_CR10","doi-asserted-by":"crossref","first-page":"1705","DOI":"10.1080\/00207540802660544","volume":"48","author":"FM Defersha","year":"2010","unstructured":"Defersha, F. M., & Chen, M. (2010). A hybrid genetic algorithm for flowshop lot streaming with setups and variable sublots. International Journal of Production Research, 48(6), 1705\u20131726.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"1182_CR11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"key":"1182_CR12","unstructured":"Ghalenoei, M. R., Hajimirsadeghi, H., & Lucas C. (2009). Discrete invasive weed optimization algorithm: Application to cooperative multiple task assignment of UAVs. In 48th IEEE conference on decision and control and 28th Chinese control conference, pp. 1665\u20131670."},{"key":"1182_CR13","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.engappai.2014.12.009","volume":"39","author":"S Ghandi","year":"2015","unstructured":"Ghandi, S., & Masehian, E. (2015). A breakout local search (BLS) method for solving the assembly sequence planning problem. Engineering Applications of Artificial Intelligence, 39, 245\u2013266.","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"9","key":"1182_CR14","doi-asserted-by":"crossref","first-page":"2669","DOI":"10.1080\/00207543.2010.532935","volume":"49","author":"CA Glass","year":"2011","unstructured":"Glass, C. A., & Possani, E. (2011). Lot streaming multiple jobs in a flow shop. International Journal of Production Research, 49(9), 2669\u20132681.","journal-title":"International Journal of Production Research"},{"key":"1182_CR15","doi-asserted-by":"crossref","first-page":"2211","DOI":"10.1080\/00207543.2013.848492","volume":"52","author":"Y-Y Han","year":"2014","unstructured":"Han, Y.-Y., Gong, D.-W., Sun, X.-Y., & Pan, Q.-K. (2014). An improved NSGA-II algorithm for multi-objective lot-streaming flow shop scheduling problem. International Journal of Production Research, 52, 2211\u20132231.","journal-title":"International Journal of Production Research"},{"key":"1182_CR16","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. (2007). Tabu search and simulated annealing algorithms for scheduling in flow shops with lot streaming. Proceedings of the Institution of Mechanical Engineers, Part B, Journal of Engineering Manufacture, 221, 317\u2013331.","journal-title":"Proceedings of the Institution of Mechanical Engineers, Part B, Journal of Engineering Manufacture"},{"key":"1182_CR17","doi-asserted-by":"crossref","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. (2008). Evolutionary algorithms for scheduling m-machine flow shop with lot streaming. Robotics and Computer-Integrated Manufacturing, 24, 125\u2013139.","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"key":"1182_CR18","doi-asserted-by":"crossref","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. (2009). Threshold accepting and Ant-colony optimization algorithm for scheduling m-machine flow shop with lot streaming. Journal of Material Processing Technology, 209, 1026\u20131041.","journal-title":"Journal of Material Processing Technology"},{"key":"1182_CR19","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. (2011). A novel technique for optimal placement of piezoelectric actuators on smart structures. Journal of The Franklin Institute, 348, 12\u201323.","journal-title":"Journal of The Franklin Institute"},{"key":"1182_CR20","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. (2006). A novel numerical optimization algorithm inspired from weed colonization. Ecological Informatics, 1, 355\u2013366.","journal-title":"Ecological Informatics"},{"key":"1182_CR21","doi-asserted-by":"crossref","first-page":"137","DOI":"10.2528\/PIER07092503","volume":"79","author":"AR Mehrabian","year":"2008","unstructured":"Mehrabian, A. R., Oranizi, H., & Rad, Z. D. (2008). Application of the invasive weed optimization technique for antenna configurations. Progress in Electromagnetics Research, 79, 137\u2013150.","journal-title":"Progress in Electromagnetics Research"},{"issue":"1","key":"1182_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. (1983). A heuristic algorithm for the m machine, n job flowshop sequencing problem. Omega-International Journal of Management Science, 11(1), 91\u201395.","journal-title":"Omega-International Journal of Management Science"},{"key":"1182_CR23","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s00170-013-5265-6","volume":"70","author":"M Nejati","year":"2014","unstructured":"Nejati, M., Mahdavi, I., Hassanzadeh, R., Mahdavi-Amiri, N., & Mojarad, M. (2014). Multi-job lot streaming to minimize the weighted completion time in a hybrid flow shop scheduling problem with work shift constraint. International Journal of Advanced Manufacturing Technology, 70, 501\u2013514.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"4","key":"1182_CR24","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/j.neucom.2012.08.011","volume":"101","author":"A Noroozi","year":"2013","unstructured":"Noroozi, A., Vitae, A., Mokhtari, H., & Abadi, I. N. K. (2013). Research on computational intelligence algorithms with adaptive learning approach for scheduling problems with batch processing machines. Neurocomputing, 101(4), 190\u2013203.","journal-title":"Neurocomputing"},{"key":"1182_CR25","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.omega.2011.05.002","volume":"40","author":"Q-K Pan","year":"2012","unstructured":"Pan, Q.-K., & Ruiz, R. (2012). An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega, 40, 166\u2013180.","journal-title":"Omega"},{"key":"1182_CR26","doi-asserted-by":"crossref","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. F. (2011a). A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem. Expert Systems with Applications, 38, 3252\u20133259.","journal-title":"Expert Systems with Applications"},{"key":"1182_CR27","doi-asserted-by":"crossref","unstructured":"Pan, Q.-K., Tasgetiren, M. F., & Liang, Y.-C. (2008). A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Computers & Industrial Engineering, 55(4), 795\u2013816.","DOI":"10.1016\/j.cie.2008.03.003"},{"key":"1182_CR28","doi-asserted-by":"crossref","unstructured":"Pan, Q.-K., Tasgetiren, M. F., Suganthan, P. N., & Chua, T. J. (2011b). A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information Sciences, 181, 2455\u20132468.","DOI":"10.1016\/j.ins.2009.12.025"},{"key":"1182_CR29","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/s00170-010-2775-3","volume":"52","author":"Q-K Pan","year":"2011","unstructured":"Pan, Q.-K., Wang, L., Gao, L., & Li, J.-Q. (2011c). An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem. International Journal of Advanced Manufacturing Technology, 52, 699\u2013713.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"1182_CR30","volume-title":"Scheduling: Theory, algorithms and systems","author":"M Pinedo","year":"2002","unstructured":"Pinedo, M. (2002). Scheduling: Theory, algorithms and systems (2nd ed.). Englewood Cliffs, NJ: Prentice-Hall.","edition":"2"},{"key":"1182_CR31","doi-asserted-by":"crossref","unstructured":"Rad, H. S., & Lucas, C. (2007). A recommender system based on invasive weed optimization algorithm. IEEE congress on evolutionary computation, pp. 297\u20134304.","DOI":"10.1109\/CEC.2007.4425032"},{"issue":"3","key":"1182_CR32","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1086\/294867","volume":"39","author":"S Reiter","year":"1996","unstructured":"Reiter, S. (1996). System for managing job-shop production. Journal of Business, 39(3), 371\u2013393.","journal-title":"Journal of Business"},{"key":"1182_CR33","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.omega.2010.07.007","volume":"39","author":"I Ribas","year":"2011","unstructured":"Ribas, I., Companys, R., & Tort-Martorell, X. (2011). An iterated greedy algorithm for the flowshop scheduling with blocking. OMEGA, 39, 293\u2013301.","journal-title":"OMEGA"},{"issue":"1","key":"1182_CR34","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/72.265964","volume":"5","author":"G Rudolph","year":"1994","unstructured":"Rudolph, G. (1994). Convergence analysis of canonical genetic algorithm. IEEE Transactions on Neural Networks, 5(1), 96\u2013101.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"1182_CR35","volume-title":"Research on methods for lot-streaming flow shop scheduling problems","author":"H-Y Sang","year":"2013","unstructured":"Sang, H.-Y. (2013). Research on methods for lot-streaming flow shop scheduling problems. Wuhan: Huazhong University of Science and Technology."},{"issue":"6","key":"1182_CR36","doi-asserted-by":"crossref","first-page":"1450045","DOI":"10.1142\/S0217595914500456","volume":"31","author":"H-Y Sang","year":"2014","unstructured":"Sang, H.-Y., Gao, L., & Li, X.-Y. (2014). An iterated local search algorithm for the lot-streaming flow shop scheduling problem. Asia-Pacific Journal of Operational Research, 31(6), 1450045.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"1182_CR37","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.omega.2013.06.007","volume":"43","author":"T Sawik","year":"2014","unstructured":"Sawik, T. (2014). Joint supplier selection and scheduling of customer orders under disruption risks: Single versus dual sourcing. OMEGA, 43, 83\u201395.","journal-title":"OMEGA"},{"key":"1182_CR38","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0272-6963(86)90008-2","volume":"6","author":"W Truscott","year":"1986","unstructured":"Truscott, W. (1986). Production scheduling with capacity constrained transportation activities. Journal of Operational Management, 6, 333\u2013348.","journal-title":"Journal of Operational Management"},{"key":"1182_CR39","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. (2008). A discrete particle swarm optimization for lot-streaming flowshop scheduling problem. European Journal of Operational Research, 191, 360\u2013373.","journal-title":"European Journal of Operational Research"},{"key":"1182_CR40","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1007\/s10845-012-0650-9","volume":"24","author":"JA Ventura","year":"2013","unstructured":"Ventura, J. A., & Yoon, S.-H. (2013). A new genetic algorithm for lot-streaming flow shop scheduling with limited capacity buffers. Journal of Intelligent Manufacturing, 24, 1185\u20131196.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"1182_CR41","doi-asserted-by":"crossref","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. (2011). A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem. Computers & Industrial Engineering, 61, 76\u201383.","journal-title":"Computers & Industrial Engineering"},{"issue":"19","key":"1182_CR42","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.neucom.2013.10.042","volume":"148","author":"Y Xu","year":"2015","unstructured":"Xu, Y., Wang, L., Wang, S.-Y., & Liu, M. (2015). An effective teaching-learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time. Neurocomputing, 148(19), 260\u2013268.","journal-title":"Neurocomputing"},{"key":"1182_CR43","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.omega.2013.07.004","volume":"45","author":"MM Yenisey","year":"2014","unstructured":"Yenisey, M. M., & Yagmahan, B. (2014). Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends. OMEGA, 45, 119\u2013135.","journal-title":"OMEGA"},{"issue":"5","key":"1182_CR44","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. (2014). Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem. Neurocomputing, 137(5), 285\u2013292.","journal-title":"Neurocomputing"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-015-1182-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1182-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1182-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-015-1182-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T15:17:00Z","timestamp":1567437420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-015-1182-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,19]]},"references-count":44,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["1182"],"URL":"https:\/\/doi.org\/10.1007\/s10845-015-1182-x","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,19]]}}}