{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:50:01Z","timestamp":1725853801200},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319336237"},{"type":"electronic","value":"9783319336251"}],"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-33625-1_9","type":"book-chapter","created":{"date-parts":[[2016,4,20]],"date-time":"2016-04-20T10:42:39Z","timestamp":1461148959000},"page":"93-102","source":"Crossref","is-referenced-by-count":1,"title":["Total Tardiness Minimization in a Flow Shop with Blocking Using an Iterated Greedy Algorithm"],"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,21]]},"reference":[{"key":"9_CR1","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. Discret. Math. 5, 287\u2013362 (1979)","journal-title":"Ann. Discret. Math."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"25","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, 25\u2013510 (1996)","journal-title":"Oper. Res."},{"key":"9_CR3","first-page":"79","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, 79\u2013655 (1964)","journal-title":"Oper. Res."},{"key":"9_CR4","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Pretice Hall, U.A.S (2008)"},{"key":"9_CR5","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. OR 37, 925\u2013935 (1989)","journal-title":"OR"},{"key":"9_CR6","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":"9_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0925-5273(03)00065-3","volume":"87","author":"D Ronconi","year":"2004","unstructured":"Ronconi, D.: A note on constructive heuristics for the flowshop problem with blocking. Int. J. Prod. Econ. 87, 39\u201348 (2004)","journal-title":"Int. J. Prod. Econ."},{"key":"9_CR8","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":"9_CR9","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.omega.2007.01.003","volume":"2","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 2, 272\u201381 (2009)","journal-title":"Omega"},{"key":"9_CR10","first-page":"15","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, 15\u2013101 (2001)","journal-title":"Int. J. Prod. Econ."},{"key":"9_CR11","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":"9_CR12","first-page":"11","volume":"3","author":"J Grabowski","year":"2007","unstructured":"Grabowski, J., Pempera, J.: The permutation flowshop problem with blocking. A tabu search approach. Omega 3, 11\u2013302 (2007)","journal-title":"Omega"},{"key":"9_CR13","first-page":"20","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, 20\u2013509 (2010)","journal-title":"Comput. Oper. Res."},{"key":"9_CR14","first-page":"3","volume":"1","author":"B Qian","year":"2009","unstructured":"Qian, B., Wang, L., Huang, D.X., Wang, W.L., Wang, X.: An effective hybrid DE-based algorithm for multi-objective flowshop scheduling with limited buffers. Comput. Oper. Res. 1, 3\u2013209 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.omega.2010.07.007","volume":"3","author":"I Ribas","year":"2011","unstructured":"Ribas, I., Companys, R., Tort-Martorell, X.: An iterated greedy algorithm for the flowhsop scheduling problem with blocking. Omega 3, 293\u2013301 (2011)","journal-title":"Omega"},{"key":"9_CR16","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":"9_CR17","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.cie.2015.04.013","volume":"87","author":"Imma Ribas","year":"2015","unstructured":"Ribas, N., Companys, R.: Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization. Comput. Ind. Eng. (2015). doi:\n                  10.1016\/j.cie.2015.04.013","journal-title":"Computers & Industrial Engineering"},{"key":"9_CR18","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":"9_CR19","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"},{"key":"9_CR20","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\u201329 (2012)","journal-title":"Omega"},{"key":"9_CR21","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."},{"key":"9_CR22","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":"9_CR23","doi-asserted-by":"crossref","unstructured":"Davendra, D., Bialic-Davendra, M., Senkerik, R., Pluhacek, M.: Scheduling the flow shop with blocking problem with the chaos-induced discrete self organising migrating algorithm. In: Proceedings 27th European Conference on Modelling and Simulation (2013)","DOI":"10.7148\/2013-0386"},{"key":"9_CR24","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":"9_CR25","doi-asserted-by":"crossref","unstructured":"Nouri, N., Ladhari, T.: Minimizing regular objectives for blocking permutation flow shop scheduling: heuristic approaches. GECCO, 441\u2013448 (2015)","DOI":"10.1145\/2739480.2754638"},{"issue":"3","key":"9_CR26","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 Produ\u00e7ao 7(3), 352\u2013363 (2000)","journal-title":"Gestao Produ\u00e7ao"},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz, R., St\u00fctzle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177, 49\u20132033 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.ejor.2006.07.029","volume":"187","author":"R Ruiz","year":"2008","unstructured":"Ruiz, R., St\u00fctzle, T.: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur. J. Oper. Res. 187, 1143\u20131159 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR29","first-page":"8","volume":"1","author":"SM Johnson","year":"2013","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup time included. Naval Res. Logist. Q. 1, 8\u201361 (2013)","journal-title":"Naval Res. Logist. Q."},{"key":"9_CR30","doi-asserted-by":"publisher","first-page":"81","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, 81\u2013177 (1982)","journal-title":"Oper. Res. Lett."},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 85\u2013278 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR32","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. Manag. 3, 109\u2013120 (1984)","journal-title":"J. Oper. Manag."},{"key":"9_CR33","unstructured":"Januario, T.O., Arroyo, J.E.C., Moreira, M.C.O.: Nature Inspired Cooperative Strategies for Optimization (NICSO 2008), pp. 153\u2013164. Springer, Berlin (2009)"}],"container-title":["Advances in Intelligent Systems and Computing","Artificial Intelligence Perspectives in Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33625-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T20:59:17Z","timestamp":1559422757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33625-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319336237","9783319336251"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33625-1_9","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2016]]}}}