{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:40:43Z","timestamp":1775068843057,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,9,4]],"date-time":"2013-09-04T00:00:00Z","timestamp":1378252800000},"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,8]]},"DOI":"10.1007\/s10845-013-0830-2","type":"journal-article","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T00:57:07Z","timestamp":1378169827000},"page":"731-744","source":"Crossref","is-referenced-by-count":37,"title":["No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approach"],"prefix":"10.1007","volume":"26","author":[{"given":"Pezhman","family":"Ramezani","sequence":"first","affiliation":[]},{"given":"Meysam","family":"Rabiee","sequence":"additional","affiliation":[]},{"given":"Fariborz","family":"Jolai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,4]]},"reference":[{"key":"830_CR1","doi-asserted-by":"crossref","unstructured":"Ajorlou, S., & Shams, I. (2012). Artificial bee colony algorithm for CONWIP production control system in a multi-product multi-machine manufacturing environment. Journal of Intelligent Manufacturing. doi: 10.1007\/s10845-012-0646-5 .","DOI":"10.1007\/s10845-012-0646-5"},{"issue":"6","key":"830_CR2","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(99)00136-7","volume":"28","author":"TA Aldowaisan","year":"2001","unstructured":"Aldowaisan, T. A. (2001). A new heuristic and dominance relations for no-wait flowshops with setup times. Computers and Operations Research, 28(6), 563\u2013584.","journal-title":"Computers and Operations Research"},{"issue":"11","key":"830_CR3","first-page":"995","volume":"24","author":"A Allahverdi","year":"1997","unstructured":"Allahverdi, A. (1997). Scheduling in stochastic flowshops with independent setup, processing and removal times. Computers and Operations Research, 24(11), 995\u2013960.","journal-title":"Computers and Operations Research"},{"key":"830_CR4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1057\/palgrave.jors.2601110","volume":"52","author":"A Allahverdi","year":"2001","unstructured":"Allahverdi, A., & Aldowaisan, T. (2001). Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times. Journal of the Operational Research Society, 52, 449\u2013462.","journal-title":"Journal of the Operational Research Society"},{"key":"830_CR5","doi-asserted-by":"crossref","unstructured":"Arnaout, J.-P., Musa, R., & Rabadi, G. (2012). A two-stage Ant Colony optimization algorithm to minimize the makespan on unrelated parallel machines\u2014part II: Enhancements and experimentations. Journal of Intelligent Manufacturing. doi: 10.1007\/s10845-012-0672-3 .","DOI":"10.1007\/s10845-012-0672-3"},{"key":"830_CR6","volume-title":"Introduction to sequence and scheduling","author":"K Baker","year":"1974","unstructured":"Baker, K. (1974). Introduction to sequence and scheduling. New York: Wiley."},{"key":"830_CR7","doi-asserted-by":"crossref","unstructured":"Belmecheri, F., Prins, C., Yalaoui, F., & Amodeo, L. (2012). Particle swarm optimization algorithm for a vehicle routing problem with heterogeneous fleet, mixed backhauls, and time windows. Journal of intelligent manufacturing. doi: 10.1007\/s10845-012-0627-8 .","DOI":"10.1007\/s10845-012-0627-8"},{"issue":"3","key":"830_CR8","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/S0377-2217(03)00434-X","volume":"159","author":"S Bertel","year":"2004","unstructured":"Bertel, S., & Billaut, J. (2004). A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. European Journal of Operational Research, 159(3), 651\u201362.","journal-title":"European Journal of Operational Research"},{"key":"830_CR9","doi-asserted-by":"crossref","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G. R., & Roli, A. (2011). Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing, 11, 4135\u20134151.","journal-title":"Applied Soft Computing"},{"key":"830_CR10","volume-title":"Experimental designs","author":"WG Cochran","year":"1992","unstructured":"Cochran, W. G., & Cox, G. M. (1992). Experimental designs (2nd ed.). New York: Wiley.","edition":"2"},{"key":"830_CR11","volume-title":"Theory of scheduling","author":"R Conway","year":"1967","unstructured":"Conway, R., & Maxwell, W. (1967). Theory of scheduling. Reading, MA: Addison-Wesley."},{"issue":"3","key":"830_CR12","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/S0377-2217(97)00194-X","volume":"109","author":"MM Dessouky","year":"1998","unstructured":"Dessouky, M. M., Dessouky, M. I., & Verma, S. K. (1998). Flowshop scheduling with identical jobs and uniform parallel machines. European Journal of Operational Research, 109(3), 620\u201331.","journal-title":"European Journal of Operational Research"},{"key":"830_CR13","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.amc.2005.11.112","volume":"179","author":"T Eren","year":"2006","unstructured":"Eren, T., & G\u00fcner, T. E. (2006). A bicriteria scheduling with sequence-dependent setup times. Applied Mathematics and Computation, 179, 378\u2013385.","journal-title":"Applied Mathematics and Computation"},{"issue":"11","key":"830_CR14","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1016\/S0305-0548(97)00018-X","volume":"24","author":"JND Gupta","year":"1997","unstructured":"Gupta, J. N. D., Strusevich, V. A., & Zwaneveld, C. (1997). Two-stage no-wait scheduling models with setup and removal times. Computers and Operations Research, 24(11), 1025\u20131031.","journal-title":"Computers and Operations Research"},{"key":"830_CR15","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., & Mladenovic, N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130, 449\u2013467.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"830_CR16","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0895-7177(97)00258-6","volume":"27","author":"W Huang","year":"1998","unstructured":"Huang, W., & Li, S. (1998). A two-stage hybrid flowshop with uniform machines and setup times. Mathematical and Computer Modelling, 27(2), 27\u201345.","journal-title":"Mathematical and Computer Modelling"},{"key":"830_CR17","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1007\/s00170-008-1865-y","volume":"44","author":"RH Huang","year":"2009","unstructured":"Huang, R. H., Yang, C. L., & Huang, Y. (2009). No-wait two-stage multiprocessor flow shop scheduling with unit setup. International Journal of Advanced Manufacturing Technology, 44, 921\u2013927.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"5","key":"830_CR18","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s00170-008-1618-y","volume":"42","author":"F Jolai","year":"2009","unstructured":"Jolai, F., Sheikh, S., Rabbani, M., & Karimi, B. (2009). A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection. The International Journal of Advanced Manufacturing Technology, 42(5), 523\u2013532.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"4","key":"830_CR19","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1109\/TAP.2010.2041163","volume":"58","author":"S Karimkashi","year":"2010","unstructured":"Karimkashi, S., & Kishk, A. (2010). Invasive weed optimization and its features in electromagnetics. IEEE Transactions on Antennas and Propagation, 58(4), 1269\u20131278.","journal-title":"IEEE Transactions on Antennas and Propagation"},{"key":"830_CR20","doi-asserted-by":"crossref","unstructured":"Kyparisis, G. J., & Koulamas, C. (2006a). A note on makespan minimization in two-stage flexible flow shops with uniform machines. European Journal of Operational Research, 175(2), 1321\u20131327.","DOI":"10.1016\/j.ejor.2005.06.017"},{"issue":"3","key":"830_CR21","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2004.05.017","volume":"168","author":"GJ Kyparisis","year":"2006","unstructured":"Kyparisis, G. J., & Koulamas, C. (2006b). Flexible flow shop scheduling with uniform parallel machines. European Journal of Operational Research, 168(3), 985\u2013997.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"830_CR22","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1007\/s10845-010-0428-x","volume":"23","author":"X Li","year":"2012","unstructured":"Li, X., Yalaoui, F., Amodeo, L., & Chehade, H. (2012). Metaheuristics and exact methods to solve a multiobjective parallel machines scheduling problem. Journal of Intelligent Manufacturing, 23(4), 1179\u20131194.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"830_CR23","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.cor.2009.02.010","volume":"37","author":"M Lozanoa","year":"2010","unstructured":"Lozanoa, M., & Garc\u00eda-Mart\u00ednez, C. (2010). Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: Overview and progress report. Computers & Operations Research, 37, 481\u2013497.","journal-title":"Computers & Operations Research"},{"key":"830_CR24","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":"830_CR25","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953). Equations of state calculations by fast computing machines. Journal of Chemical Physics, 21, 1087\u20131092.","journal-title":"Journal of Chemical Physics"},{"issue":"1","key":"830_CR26","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10845-011-0553-1","volume":"24","author":"M Mirabi","year":"2013","unstructured":"Mirabi, M., Ghomi, S. F., & Jolai, F. (2013). A two-stage hybrid flowshop scheduling problem in machine breakdown condition. Journal of Intelligent Manufacturing, 24(1), 193\u2013199.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"6","key":"830_CR27","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(6), 965\u2013978.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"830_CR28","doi-asserted-by":"crossref","unstructured":"Moradinasab, N., Shafaei, R., Rabiee, M., & Ramezani, P. (2012). No-wait two stage hybrid flow shop scheduling with genetic and adaptive imperialist competitive algorithms. Journal of Experimental & Theoretical Artificial Intelligence. doi: 10.1080\/0952813X.2012.682752 .","DOI":"10.1080\/0952813X.2012.682752"},{"key":"830_CR29","doi-asserted-by":"crossref","unstructured":"Panwalkar, S. S., Dudek, R. A., & Smith, M. L. (1973). Sequencing research and the industrial scheduling problem. In Elmaghra, S. E. (Ed.) Symposium on the theory of scheduling and its applications. New York: Springer, p. 29. International Journal of Advanced Manufacturing Technology, 49, 263\u2013279 (2010).","DOI":"10.1007\/978-3-642-80784-8_2"},{"issue":"4","key":"830_CR30","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1007\/s10845-010-0425-0","volume":"23","author":"M Rebai","year":"2012","unstructured":"Rebai, M., Kacem, I., & Adjallah, K. H. (2012). Earliness-tardiness minimization on a single machine to schedule preventive maintenance tasks: Metaheuristic and exact methods. Journal of Intelligent Manufacturing, 23(4), 1207\u20131224.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"830_CR31","volume-title":"Taguchi techniques for quality engineering","author":"RJ Ross","year":"1989","unstructured":"Ross, R. J. (1989). Taguchi techniques for quality engineering. New York: McGraw-Hill."},{"key":"830_CR32","doi-asserted-by":"crossref","unstructured":"Rossi, A., Puppato, A., & Lanzetta, M. (2012). Heuristics for scheduling a two-stage hybrid flow shop with parallel batching machines: Application at a hospital sterilisation plant. International Journal of Production Research. doi: 10.1080\/00207543.2012.737942 .","DOI":"10.1080\/00207543.2012.737942"},{"issue":"1","key":"830_CR33","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1109\/TAP.2010.2090477","volume":"59","author":"GG Roy","year":"2011","unstructured":"Roy, G. G., Das, S., Chakraborty, P., & Suganthan, P. N. (2011). Design of non-uniform circular antenna arrays using a modified invasive weed optimization algorithm. IEEE Transactions on Antennas and Propagation, 59(1), 110\u2013118.","journal-title":"IEEE Transactions on Antennas and Propagation"},{"issue":"3","key":"830_CR34","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1016\/j.ejor.2004.06.038","volume":"169","author":"R Ruiz","year":"2006","unstructured":"Ruiz, R., & Maroto, C. (2006). A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research, 169(3), 781\u2013800.","journal-title":"European Journal of Operational Research"},{"key":"830_CR35","doi-asserted-by":"crossref","unstructured":"Salvador, M. S. (1973). A solution to a special case of flow shop scheduling problems. In Symposium of the theory of scheduling and applications (pp. 83\u201391). NewYork: Springer.","DOI":"10.1007\/978-3-642-80784-8_7"},{"issue":"3","key":"830_CR36","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/jos.98","volume":"5","author":"SV Sevastianov","year":"2002","unstructured":"Sevastianov, S. V. (2002). Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage. Journal of Scheduling, 5(3), 205\u201325.","journal-title":"Journal of Scheduling"},{"issue":"5","key":"830_CR37","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1080\/07408170304391","volume":"35","author":"H Soewandi","year":"2003","unstructured":"Soewandi, H., & Elmaghraby, S. E. (2003). Sequencing on two-stage hybrid flowshops with uniform machines to minimize makespan. IIE Transactions, 35(5), 467\u2013477.","journal-title":"IIE Transactions"},{"key":"830_CR38","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/0377-2217(86)90036-6","volume":"24","author":"C Sriscandarajah","year":"1986","unstructured":"Sriscandarajah, C., & Ladet, P. (1986). Some no-wait shops scheduling problems: Complexity aspects. European Journal of Operational Research, 24, 424\u2013445.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"830_CR39","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10845-005-7029-0","volume":"16","author":"L Tang","year":"2005","unstructured":"Tang, L., Liu, W., & Liu, J. (2005). A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment. Journal of Intelligent Manufacturing, 16(3), 361\u2013370.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"4","key":"830_CR40","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1007\/s10845-010-0395-2","volume":"23","author":"R Tavakkoli-Moghaddam","year":"2012","unstructured":"Tavakkoli-Moghaddam, R., Ranjbar-Bourani, M., Amin, G. R., & Siadat, A. (2012). A cell formation problem considering machine utilization and alternative process routes by scatter search. Journal of Intelligent Manufacturing, 23(4), 1127\u20131139.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"2","key":"830_CR41","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/j.amc.2007.04.038","volume":"194","author":"JT Tsai","year":"2007","unstructured":"Tsai, J. T., Ho, W. H., Liu, T. K., & Chou, J. H. (2007). Improved immune algorithm for global numerical optimization and job-shop scheduling problems. Applied Mathematics and Computation, 194(2), 406\u201324.","journal-title":"Applied Mathematics and Computation"},{"issue":"17","key":"830_CR42","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1080\/00207540701294627","volume":"46","author":"CT Tseng","year":"2008","unstructured":"Tseng, C. T., & Liao, C. J. (2008). A particle swarm optimization algorithm for hybrid flowshop scheduling with multiprocessor tasks. International Journal of Production Research, 46(17), 4655\u20134670.","journal-title":"International Journal of Production Research"},{"key":"830_CR43","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.ijpe.2010.06.006","volume":"128","author":"LY Tseng","year":"2010","unstructured":"Tseng, L. Y., & Lin, Y. T. (2010). A hybrid genetic algorithm for no-wait flow shop scheduling problem. International Journal of Production Economics, 128, 144\u2013152.","journal-title":"International Journal of Production Economics"},{"key":"830_CR44","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1016\/j.ejor.2010.05.041","volume":"207","author":"T Urlings","year":"2010","unstructured":"Urlings, T., Ruiz, R., & St\u00fctzle, T. (2010). Shifting representation search for hybrid flexible flowline problems. European Journal of Operational Research, 207, 1086\u20131095.","journal-title":"European Journal of Operational Research"},{"key":"830_CR45","doi-asserted-by":"crossref","unstructured":"Vahdani, B., Tavakkoli-Moghaddam, R., Zandieh, M., & Razmi, J. (2012). Vehicle routing scheduling using an enhanced hybrid optimization approach. Journal of Intelligent Manufacturing, 23(3), 759\u2013774.","DOI":"10.1007\/s10845-010-0427-y"},{"key":"830_CR46","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/(SICI)1099-1425(199905\/06)2:3<135::AID-JOS21>3.0.CO;2-L","volume":"2","author":"SK Verma","year":"1999","unstructured":"Verma, S. K., & Dessouky, M. M. (1999). Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines. Journal of scheduling, 2, 135\u201350.","journal-title":"Journal of scheduling"},{"key":"830_CR47","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":"6","key":"830_CR48","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1007\/s10845-011-0571-z","volume":"23","author":"IL Wang","year":"2012","unstructured":"Wang, I. L., Yang, T., & Chang, Y. B. (2012). Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints. Journal of Intelligent Manufacturing, 23(6), 2271\u20132280.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"830_CR49","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/j.orl.2004.10.004","volume":"33","author":"Z Wang","year":"2005","unstructured":"Wang, Z., Xing, W., & Bai, F. (2005). No-wait flexible flow shop scheduling with no-idle machines. Operation Research Letter, 33, 609\u2013614.","journal-title":"Operation Research Letter"},{"key":"830_CR50","doi-asserted-by":"crossref","unstructured":"Xie, J., & Wang, X. (2005). Complexity and algorithms for two-stage flexible flow shop scheduling with availability constraints. Computer and Mathematics with Application, 50, 1629\u20131638.","DOI":"10.1016\/j.camwa.2005.07.008"},{"issue":"12","key":"830_CR51","doi-asserted-by":"crossref","first-page":"1857","DOI":"10.1016\/j.camwa.2003.08.003","volume":"47","author":"J Xie","year":"2004","unstructured":"Xie, J., Xing, W., Liu, Z., & Dong, J. (2004). Minimum deviation algorithm for two-stageno-wait flowshops with parallel machines. Computers & Mathematics with Applications, 47(12), 1857\u201363.","journal-title":"Computers & Mathematics with Applications"},{"key":"830_CR52","doi-asserted-by":"crossref","unstructured":"Yaurima, V., Burtseva, L., & Tchernykh, A. (2009). Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers. Computers & Industrial Engineering, 56, 1452\u20131463.","DOI":"10.1016\/j.cie.2008.09.004"},{"issue":"16","key":"830_CR53","doi-asserted-by":"crossref","first-page":"3161","DOI":"10.1080\/00207540500536939","volume":"44","author":"KC Ying","year":"2006","unstructured":"Ying, K. C., & Lin, S. W. (2006). Multiprocessor task scheduling in multistage hybrid flowshops: an ant colony system approach. International Journal of Production Research, 44(16), 3161\u20133177.","journal-title":"International Journal of Production Research"},{"issue":"6","key":"830_CR54","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1007\/s10845-009-0374-7","volume":"22","author":"M Zandieh","year":"2011","unstructured":"Zandieh, M., & Karimi, N. (2011). An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times. Journal of Intelligent Manufacturing, 22(6), 979\u2013989.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"830_CR55","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1016\/j.cie.2011.01.005","volume":"60","author":"Y Zhang","year":"2011","unstructured":"Zhang, Y., & Li, X. (2011). Estimation of distribution algorithm for permutation flow shops with total flow time minimization. Computers & Industrial Engineering, 60, 706\u2013718.","journal-title":"Computers & Industrial Engineering"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-013-0830-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-013-0830-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-013-0830-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:11:59Z","timestamp":1559254319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-013-0830-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,4]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["830"],"URL":"https:\/\/doi.org\/10.1007\/s10845-013-0830-2","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,4]]}}}