{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T15:37:29Z","timestamp":1769441849587,"version":"3.49.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,4,21]],"date-time":"2013-04-21T00:00:00Z","timestamp":1366502400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10845-013-0775-5","type":"journal-article","created":{"date-parts":[[2013,4,20]],"date-time":"2013-04-20T07:40:27Z","timestamp":1366443627000},"page":"225-237","source":"Crossref","is-referenced-by-count":65,"title":["The two stage assembly flowshop scheduling problem to minimize total tardiness"],"prefix":"10.1007","volume":"26","author":[{"given":"Ali","family":"Allahverdi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harun","family":"Aydilek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,21]]},"reference":[{"key":"775_CR1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.ejor.2006.09.011","volume":"182","author":"FS Al-Anzi","year":"2007","unstructured":"Al-Anzi, F. S., & Allahverdi, A. (2007). A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times. European Journal of Operational Research, 182, 80\u201394.","journal-title":"European Journal of Operational Research"},{"key":"775_CR2","first-page":"109","volume":"3","author":"FS Al-Anzi","year":"2006","unstructured":"Al-Anzi, F. S., & Allahverdi, A. (2006). A hybrid tabu search heuristic for the two-stage assembly scheduling problem. International Journal of Operations Research, 3, 109\u2013119.","journal-title":"International Journal of Operations Research"},{"key":"775_CR3","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187, 985\u20131032.","journal-title":"European Journal of Operational Research"},{"key":"775_CR4","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 The International Journal of Management Sciences, 27, 219\u2013239.","journal-title":"OMEGA The International Journal of Management Sciences"},{"key":"775_CR5","doi-asserted-by":"crossref","first-page":"2740","DOI":"10.1016\/j.cor.2008.12.001","volume":"36","author":"A Allahverdi","year":"2009","unstructured":"Allahverdi, A., & Al-Anzi, F. S. (2009). The two-stage assembly scheduling problem to minimize total completion time with setup times. Computers and Operations Research, 36, 2740\u20132747.","journal-title":"Computers and Operations Research"},{"key":"775_CR6","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/s00170-007-0950-y","volume":"37","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., & Al-Anzi, F. S. (2008). The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time. International Journal of Advanced Manufacturing Technology, 37, 166\u2013177.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"775_CR7","doi-asserted-by":"crossref","first-page":"4713","DOI":"10.1080\/00207540600621029","volume":"44","author":"A Allahverdi","year":"2006","unstructured":"Allahverdi, A., & Al-Anzi, F. S. (2006a). Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times. International Journal of Production Research, 44, 4713\u20134735.","journal-title":"International Journal of Production Research"},{"key":"775_CR8","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.1016\/j.cor.2004.09.002","volume":"33","author":"A Allahverdi","year":"2006","unstructured":"Allahverdi, A., & Al-Anzi, F. S. (2006b). APSO and a Tabu search heuristics for assembly scheduling problem of the two-stage distributed database application. Computers and Operations Research, 33, 1056\u20131080.","journal-title":"Computers and Operations Research"},{"key":"775_CR9","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1016\/j.ejor.2006.09.010","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., & Soroush, H. M. (2008). The significance of reducing setup times\/setup costs. European Journal of Operational Research, 187, 978\u2013984.","journal-title":"European Journal of Operational Research"},{"key":"775_CR10","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.amc.2012.06.024","volume":"219","author":"H Aydilek","year":"2012","unstructured":"Aydilek, H., & Allahverdi, A. (2012). Heuristics for no-wait flowshops with makespan subject to mean completion time. Applied Mathematics and Computation, 219, 351\u2013359.","journal-title":"Applied Mathematics and Computation"},{"key":"775_CR11","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J Bean","year":"1994","unstructured":"Bean, J. (1994). Genetics and random keys for sequencing and optimization. ORSA Journal on Computing, 6, 154\u2013160.","journal-title":"ORSA Journal on Computing"},{"key":"775_CR12","doi-asserted-by":"crossref","first-page":"10016","DOI":"10.1016\/j.eswa.2012.01.211","volume":"39","author":"JC Chen","year":"2012","unstructured":"Chen, J. C., Wu, C. C., Chen, C. W., & Chen, K. H. (2012). Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm. Expert Systems with Applications, 39, 10016\u201310021.","journal-title":"Expert Systems with Applications"},{"key":"775_CR13","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"J Du","year":"1990","unstructured":"Du, J., & Leung, J. (1990). Minimizing total tardiness on one machine is NP-hard. Operations Research, 38, 22\u201336.","journal-title":"Operations Research"},{"key":"775_CR14","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1504\/EJIE.2012.047661","volume":"6","author":"A Amraoui El","year":"2012","unstructured":"El Amraoui, A., Manier, M. A., El Moudni, A., & Benrejeb, M. (2012). Resolution of the two-part cyclic hoist scheduling problem with bounded processing times in complex lines\u2019 configuration. European Journal of Industrial Engineering, 6, 454\u2013473.","journal-title":"European Journal of Industrial Engineering"},{"key":"775_CR15","doi-asserted-by":"crossref","first-page":"6479","DOI":"10.1080\/00207540701418960","volume":"46","author":"JM Framinan","year":"2008","unstructured":"Framinan, J. M., & Leisten, R. (2008). Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm. International Journal of Production Research, 46, 6479\u20136498.","journal-title":"International Journal of Production Research"},{"key":"775_CR16","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1287\/opre.49.6.854.10014","volume":"49","author":"NG Hall","year":"2001","unstructured":"Hall, N. G., & Posner, M. E. (2001). Generating experimental data for computational testing with machine scheduling applications. Operations Research, 49, 854\u2013865.","journal-title":"Operations Research"},{"key":"775_CR17","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/S0377-2217(96)00312-8","volume":"103","author":"AMA Hariri","year":"1997","unstructured":"Hariri, A. M. A., & Potts, C. N. (1997). A branch and bound algorithm for the two-stage assembly scheduling problem. European Journal of Operational Research, 103, 547\u2013556.","journal-title":"European Journal of Operational Research"},{"key":"775_CR18","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1051\/ro:1999120","volume":"33","author":"M Haouari","year":"1999","unstructured":"Haouari, M., & Daouas, T. (1999). Optimal scheduling of the 3-machine assembly-type flow shop. RAIRO Recherche Operationnelle, 33, 439\u2013445.","journal-title":"RAIRO Recherche Operationnelle"},{"key":"775_CR19","doi-asserted-by":"crossref","first-page":"1931","DOI":"10.1007\/s10845-011-0521-9","volume":"23","author":"J Huang","year":"2012","unstructured":"Huang, J., Suer, G. A., & Urs, S. B. R. (2012). Genetic algorithm for rotary machine scheduling with dependent processing times. Journal of Intelligent Manufacturing, 23, 1931\u20131948.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"775_CR20","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0305-0548(93)90083-U","volume":"20","author":"YD Kim","year":"1993","unstructured":"Kim, Y. D. (1993). A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops. Computers and Operations Research, 20, 391\u2013401.","journal-title":"Computers and Operations Research"},{"key":"775_CR21","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1057\/jors.2011.37","volume":"63","author":"T Ladhari","year":"2012","unstructured":"Ladhari, T., Msakni, M. K., & Allahverdi, A. (2012). Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times. Journal of the Operational Research Society, 63, 445\u2013459.","journal-title":"Journal of the Operational Research Society"},{"key":"775_CR22","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/mnsc.39.5.616","volume":"39","author":"CY Lee","year":"1993","unstructured":"Lee, C. Y., Cheng, T. C. E., & Lin, B. M. T. (1993). Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Management Science, 39, 616\u2013625.","journal-title":"Management Science"},{"key":"775_CR23","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1504\/EJIE.2012.047666","volume":"6","author":"SW Lin","year":"2012","unstructured":"Lin, S. W., & Ying, K. C. (2012). Scheduling a bi-criteria flowshop manufacturing cell with sequence-dependent family setup times. European Journal of Industrial Engineering, 6, 474\u2013496.","journal-title":"European Journal of Industrial Engineering"},{"key":"775_CR24","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1007\/s10845-009-0373-8","volume":"22","author":"HS Mirsanei","year":"2011","unstructured":"Mirsanei, H. S., Zandieh, M., Moayed, M. J., & Khabbazi, M. R. (2011). A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times. Journal of Intelligent Manufacturing, 22, 965\u2013978.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"775_CR25","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1504\/EJIE.2012.045604","volume":"6","author":"B Naderi","year":"2012","unstructured":"Naderi, B., & Salmasi, N. (2012). Permutation flowshops in group scheduling with sequence-dependent setup times. European Journal of Industrial Engineering, 6, 177\u2013198.","journal-title":"European Journal of Industrial Engineering"},{"key":"775_CR26","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1080\/095372899232993","volume":"10","author":"G Onwubolu","year":"1999","unstructured":"Onwubolu, G., & Mutingi, M. (1999). Genetic algorithm for minimizing tardiness in flow-shop scheduling. Production Planning & Control, 10, 462\u2013471.","journal-title":"Production Planning & Control"},{"key":"775_CR27","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1504\/EJIE.2012.047662","volume":"6","author":"J Poppenborg","year":"2012","unstructured":"Poppenborg, J., Knust, S., & Hertzberg, J. (2012). Online scheduling of flexible job-shops with blocking and transportation. European Journal of Industrial Engineering, 6, 497\u2013518.","journal-title":"European Journal of Industrial Engineering"},{"key":"775_CR28","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/opre.43.2.346","volume":"43","author":"CN Potts","year":"1995","unstructured":"Potts, C. N., Sevast\u2019janov, S. V., Strusevich, V. A., Van Wassenhove, L. N., & Zwaneveld, C. M. (1995). The two-stage assembly scheduling problem: complexity and approximation. Operations Research, 43, 346\u2013355.","journal-title":"Operations Research"},{"key":"775_CR29","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.omega.2004.12.006","volume":"34","author":"R Ruiz","year":"2006","unstructured":"Ruiz, R., Maroto, C., & Alcaraz, J. (2006). Two new robust genetic algorithms for the flowshop scheduling problem. OMEGA The International Journal of Management Science, 34, 461\u2013476.","journal-title":"OMEGA The International Journal of Management Science"},{"key":"775_CR30","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1007\/s10845-010-0422-3","volume":"23","author":"C Sauvey","year":"2012","unstructured":"Sauvey, C., & Sauer, N. (2012). A genetic algorithm with genes-association recognition for flowshop scheduling problems. Journal of Intelligent Manufacturing, 23, 1167\u20131177.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"775_CR31","doi-asserted-by":"crossref","unstructured":"Shokrollahpour, E., Zandieh, M., & Dorri, B. (2011). A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem. International Journal of Production Research, 49, 3087\u20133103.","DOI":"10.1080\/00207540903536155"},{"key":"775_CR32","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1007\/s10845-009-0370-y","volume":"22","author":"EL Solano-Charris","year":"2011","unstructured":"Solano-Charris, E. L., Montoya-Torres, J. R., & Paternina-Arboleda, C. D. (2011). Ant colony optimization algorithm for a Bi-criteria 2-stage hybrid flowshop scheduling problem. Journal of Intelligent Manufacturing, 22, 815\u2013822.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"775_CR33","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1504\/EJIE.2012.048857","volume":"6","author":"HM Soroush","year":"2012","unstructured":"Soroush, H. M. (2012). Solving the single machine scheduling problem with general job-dependent past-sequence-dependent setup times and learning effects. European Journal of Industrial Engineering, 6, 596\u2013628.","journal-title":"European Journal of Industrial Engineering"},{"key":"775_CR34","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0377-2217(02)00245-X","volume":"146","author":"X Sun","year":"2003","unstructured":"Sun, X., Morizawa, K., & Nagasawa, H. (2003). Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling. European Journal of Operational Research, 146, 498\u2013516.","journal-title":"European Journal of Operational Research"},{"key":"775_CR35","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1504\/EJIE.2012.044808","volume":"6","author":"A Tajbakhsh","year":"2012","unstructured":"Tajbakhsh, A., Eshghi, K., & Shamsi, A. (2012). A hybrid PSO-SA algorithm for the travelling tournament problem. European Journal of Industrial Engineering, 6, 2\u201325.","journal-title":"European Journal of Industrial Engineering"},{"key":"775_CR36","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1016\/j.advengsoft.2010.06.004","volume":"41","author":"E Torabzadeh","year":"2010","unstructured":"Torabzadeh, E., & Zandieh, M. (2010). Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop. Advances in Engineering Software, 41, 1238\u20131243.","journal-title":"Advances in Engineering Software"},{"key":"775_CR37","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0305-0548(01)00098-3","volume":"30","author":"A Tozkapan","year":"2003","unstructured":"Tozkapan, A., Kirca, O., & Chung, C. S. (2003). A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem. Computers and Operations Research, 30, 309\u2013320.","journal-title":"Computers and Operations Research"},{"key":"775_CR38","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.omega.2009.04.002","volume":"38","author":"E Vallada","year":"2010","unstructured":"Vallada, E., & Ruiz, R. (2010). Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. OMEGA International Journal of Management Science, 38, 57\u201367.","journal-title":"OMEGA International Journal of Management Science"},{"key":"775_CR39","doi-asserted-by":"crossref","first-page":"1350","DOI":"10.1016\/j.cor.2006.08.016","volume":"35","author":"E Vallada","year":"2008","unstructured":"Vallada, E., Ruiz, R., & Minella, G. (2008). Minimizing total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers and Operations Research, 35, 1350\u20131373.","journal-title":"Computers and Operations Research"},{"key":"775_CR40","doi-asserted-by":"crossref","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. doi: 10.1007\/s10845-012-0650-9 .","DOI":"10.1007\/s10845-012-0650-9"},{"key":"775_CR41","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.1080\/00207540701486082","volume":"47","author":"V Vinod","year":"2009","unstructured":"Vinod, V., & Sridharan, R. (2009). Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times. International Journal of Production Research, 47, 1425\u20131447.","journal-title":"International Journal of Production Research"},{"key":"775_CR42","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1504\/EJIE.2012.045605","volume":"6","author":"KC Ying","year":"2012","unstructured":"Ying, K. C. (2012). Minimising makespan for multistage hybrid flowshop scheduling problems with multiprocessor tasks by a hybrid immune algorithm. European Journal of Industrial Engineering, 6, 199\u2013215.","journal-title":"European Journal of Industrial Engineering"},{"key":"775_CR43","doi-asserted-by":"crossref","first-page":"1795","DOI":"10.1007\/s10845-010-0483-3","volume":"23","author":"KC Ying","year":"2012","unstructured":"Ying, K. C., Lee, Z. J., & Lin, S. W. (2012). Makespan minimization for scheduling unrelated parallel machines with setup times. Journal of Intelligent Manufacturing, 23, 1795\u20131803.","journal-title":"Journal of Intelligent Manufacturing"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-013-0775-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-013-0775-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-013-0775-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:11:58Z","timestamp":1559268718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-013-0775-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,21]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["775"],"URL":"https:\/\/doi.org\/10.1007\/s10845-013-0775-5","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,21]]}}}