{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:50:26Z","timestamp":1725853826138},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319335087"},{"type":"electronic","value":"9783319335094"}],"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-33509-4_13","type":"book-chapter","created":{"date-parts":[[2016,4,16]],"date-time":"2016-04-16T15:59:57Z","timestamp":1460822397000},"page":"145-153","source":"Crossref","is-referenced-by-count":0,"title":["A Particle Swarm Optimization Metaheuristic for the Blocking Flow Shop Scheduling Problem: Total Tardiness Minimization"],"prefix":"10.1007","author":[{"given":"Nouri","family":"Nouha","sequence":"first","affiliation":[]},{"given":"Ladhari","family":"Talel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,17]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"2013","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup time included. Nav. Res. Logistics Q. 1, 61\u201368 (2013)","journal-title":"Nav. Res. Logistics Q."},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.omega.2007.01.003","volume":"37","author":"DP Ronconi","year":"2009","unstructured":"Ronconi, D.P., Henriques, L.R.S.: Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. Omega 37(2), 272\u2013281 (2009)","journal-title":"Omega"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1287\/opre.42.6.1025","volume":"42","author":"C Koulamas","year":"1994","unstructured":"Koulamas, C.: The total tardiness problem: review and extensions. Oper. Res. 42, 1025\u20131041 (1994)","journal-title":"Oper. Res."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Davendra, D., Bialic-Davendra, M., Senkerik, R., Pluhacek, M.: Scheduling the flowshop with blocking problem with the chaos-induced discrete self organising migrating algorithm. In: Proceedings of the 27th European Conference on Modelling and Simulation, pp. 386\u2013392 (2013)","DOI":"10.7148\/2013-0386"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0925-5273(99)00104-8","volume":"2","author":"V Caraffa","year":"2001","unstructured":"Caraffa, V., Ianes, S., Bagchi, T.P., Sriskandarajah, C.: Minimizing makespan in a flowshop using genetic algorithms. Int. J. Prod. Econ. 2, 101\u2013115 (2001)","journal-title":"Int. J. Prod. Econ."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/S1004-9541(12)60588-6","volume":"20","author":"G Deng","year":"2012","unstructured":"Deng, G., Xu, Z., Gu, X.: A discrete artificial bee colony algorithm for minimizing the total flow time in the blocking flow shop scheduling. Chin. J. Chem. Eng. 20, 1067\u20131073 (2012)","journal-title":"Chin. J. Chem. Eng."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"5","author":"P Gilmore","year":"1964","unstructured":"Gilmore, P., Gomory, R.: Sequencing a one state variable machine: a solvable case of the traveling salesman problem. Oper. Res. 5, 655\u2013679 (1964)","journal-title":"Oper. Res."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.omega.2005.07.004","volume":"3","author":"J Grabowski","year":"2007","unstructured":"Grabowski, J., Pempera, J.: The permutation flowshop problem with blocking. a tabu search approach. Omega 3, 302\u2013311 (2007)","journal-title":"Omega"},{"key":"13_CR9","first-page":"109","volume":"3","author":"KR Baker","year":"1984","unstructured":"Baker, K.R., Bertrand, J.W.M.: An investigation of due date assignment rules with constrained tightness. J. Oper. Manage. 3, 109\u2013120 (1984)","journal-title":"J. Oper. Manage."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., Rinnooy, K.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013362 (1979)","journal-title":"Ann. Discrete Math."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"N Hall","year":"1996","unstructured":"Hall, N., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res. 44, 510\u2013525 (1996)","journal-title":"Oper. Res."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00170-012-4493-5","volume":"67","author":"Y-Y Han","year":"2013","unstructured":"Han, Y.-Y., Liang, J., Pan, Q.-K., Li, J.-Q., Sang, H.-Y., Cao, N.: Effective hybrid discrete artificial bee colony algorithms for the total flowtime minimization in the blocking flowshop problem. Int. J. Adv. Manuf. Technol. 67, 397\u2013414 (2013)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","volume":"4","author":"J Kennedy","year":"1995","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. Proc. IEEE Int. Conf. Neural Netw. 4, 1942\u20131948 (1995)","journal-title":"Proc. IEEE Int. Conf. Neural Netw."},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.omega.2012.03.006","volume":"41","author":"S Lin","year":"2013","unstructured":"Lin, S., Ying, K.: Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm. Omega 41, 383\u2013389 (2013)","journal-title":"Omega"},{"issue":"6","key":"13_CR15","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1287\/opre.37.6.925","volume":"37","author":"S McCormick","year":"1989","unstructured":"McCormick, S., Pinedo, M., Shenker, S., Wolf, B.: Sequencing in an assembly line with blocking to minimize cycle time. J. Oper. Res. 37(6), 925\u2013935 (1989)","journal-title":"J. Oper. Res."},{"key":"13_CR16","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 11, 91\u201395 (1983)","journal-title":"Omega"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.omega.2011.06.002","volume":"2","author":"Q Pan","year":"2012","unstructured":"Pan, Q., Wang, L.: Effective heuristics for the blocking flowshop scheduling problem with makespan minimization. Omega 2, 218\u2013229 (2012)","journal-title":"Omega"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TASE.2012.2204874","volume":"10","author":"Q Pan","year":"2013","unstructured":"Pan, Q., Wang, L., Sang, H., Li, J., Liu, M.: A high performing memetic algorithm for the flowshop scheduling problem with blocking. IEEE Trans. Autom. Sci. Eng. 10, 741\u2013756 (2013)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"13_CR19","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M Pinedo","year":"2008","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Pretice Hall, U.A.S (2008)"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1057\/jors.1972.52","volume":"3","author":"S Reddi","year":"1972","unstructured":"Reddi, S., Ramamoorthy, C.: On the flow-shop sequencing problem with no wait in process. Oper. Res. Q. 3, 323\u2013331 (1972)","journal-title":"Oper. Res. Q."},{"key":"13_CR21","first-page":"1","volume":"28","author":"H Rock","year":"1984","unstructured":"Rock, H.: Some new results in flow shop scheduling. Zeitschrift fur Oper. Res. 28, 1\u201316 (1984)","journal-title":"Zeitschrift fur Oper. Res."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10479-005-2444-3","volume":"1","author":"D Ronconi","year":"2005","unstructured":"Ronconi, D.: A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking. Ann. Oper. Res. 1, 53\u201365 (2005)","journal-title":"Ann. Oper. Res."},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"3459","DOI":"10.1016\/j.ins.2011.04.018","volume":"16","author":"M Tasgetiren","year":"2011","unstructured":"Tasgetiren, M., Pan, Q., Suganthan, P., Chen, A.: A discrete artificial bee colony algorithm for the total flow time minimization in permutation flow shops. Inform. Sci. 16, 3459\u20133475 (2011)","journal-title":"Inform. Sci."},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.cor.2008.12.004","volume":"3","author":"L Wang","year":"2010","unstructured":"Wang, L., Pan, Q., Suganthan, P., Wang, W., Wang, Y.: A novel hybrid discrete differential evolution algorithm for blocking flowshop scheduling problems. Comput. Oper. Res. 3, 509\u2013520 (2010)","journal-title":"Comput. Oper. Res."},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"7929","DOI":"10.1016\/j.eswa.2010.04.042","volume":"12","author":"L Wang","year":"2010","unstructured":"Wang, L., Pan, Q., Tasgetiren, M.: Minimizing the total flow time in a flowshop with blocking by using hybrid harmony search algorithms. Expert Syst. Appl. 12, 7929\u20137936 (2010)","journal-title":"Expert Syst. Appl."},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1016\/j.asoc.2011.09.021","volume":"12","author":"X Wang","year":"2012","unstructured":"Wang, X., Tang, L.: A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking. Appl. Soft Comput. 12, 652\u2013662 (2012)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"13_CR27","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1590\/S0104-530X2000000300011","volume":"7","author":"VA Armentano","year":"2000","unstructured":"Armentano, V.A., Ronconi, D.P.: Minimiza\u00e7\u00e2o do Tempo Total de Atraso No Problema de Flowshop Com Buffer Zero atrav\u00e9s de Busca Tabu. Gestao and Produ\u00e7ao 7(3), 352\u2013363 (2000)","journal-title":"Gestao and Produ\u00e7ao"},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"5238","DOI":"10.1080\/00207543.2013.802390","volume":"51","author":"I Ribas","year":"2013","unstructured":"Ribas, I., Companys, R., Tort-Martorell, X.: An efficient iterated local search algorithm for the total tardiness blocking flow shop problem. Int. J. Prod. Res. 51, 5238\u20135252 (2013)","journal-title":"Int. J. Prod. Res."},{"key":"13_CR29","unstructured":"Januario, T.O., Arroyo, J.E.C., Moreira, M.C.O.: Nature Inspired Cooperative Strategies for Optimization (NICSO 2008). Springer, Heidelberg, pp. 153\u2013164 (2009)"},{"key":"13_CR30","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0167-6377(82)90035-9","volume":"1","author":"CN Potts","year":"1982","unstructured":"Potts, C.N., Van Wassenhove, L.N.: A decomposition algorithm for the single machine total tardiness problem. Oper. Res. Lett. 1, 177\u2013181 (1982)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems and Agreement Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33509-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T00:33:06Z","timestamp":1559435586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33509-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319335087","9783319335094"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33509-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}