{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T21:36:33Z","timestamp":1775943393125,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2010,1,19]],"date-time":"2010-01-19T00:00:00Z","timestamp":1263859200000},"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":[[2011,12]]},"DOI":"10.1007\/s10845-009-0373-8","type":"journal-article","created":{"date-parts":[[2010,1,18]],"date-time":"2010-01-18T05:02:05Z","timestamp":1263790925000},"page":"965-978","source":"Crossref","is-referenced-by-count":73,"title":["A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times"],"prefix":"10.1007","volume":"22","author":[{"given":"H. S.","family":"Mirsanei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Zandieh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. J.","family":"Moayed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. R.","family":"Khabbazi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,1,19]]},"reference":[{"key":"373_CR1","volume-title":"Simulated annealing and boltzmann machines: A stochastic approach to combinatorial optimization and neural computing","author":"E. H. L. Aarts","year":"1989","unstructured":"Aarts E. H. L., Korst J. (1989) Simulated annealing and boltzmann machines: A stochastic approach to combinatorial optimization and neural computing. Wiley, Chi Chester, England"},{"key":"373_CR2","volume-title":"Local search in combinatorial optimization","author":"E. H. L. Aarts","year":"1997","unstructured":"Aarts E. H. L., Lenstra J. K. (1997) Local search in combinatorial optimization. Wiley, Chi Chester, England"},{"key":"373_CR3","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1016\/0377-2217(94)00213-4","volume":"88","author":"B. Adenso-Diaz","year":"1996","unstructured":"Adenso-Diaz B. (1996) An SA\/TS mixture algorithm for the scheduling tardiness problem. European Journal of Operational Research 88: 516\u2013524","journal-title":"European Journal of Operational Research"},{"key":"373_CR4","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/j.cie.2004.09.002","volume":"47","author":"H. Allaoui","year":"2004","unstructured":"Allaoui H., Artiba A. (2004) Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Computers & Industrial Engineering 47: 431\u2013450","journal-title":"Computers & Industrial Engineering"},{"key":"373_CR5","first-page":"10","volume":"8","author":"T. S. Arthanary","year":"1971","unstructured":"Arthanary T. S., Ramaswamy K.G. (1971) An extension of two machine sequencing problems. Operations Research 8: 10\u201322","journal-title":"Operations Research"},{"key":"373_CR6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0165-1684(99)00084-5","volume":"79","author":"B. Chen","year":"1999","unstructured":"Chen B., Luk B. L. (1999) Adaptive simulated annealing for optimization in signal processing applications. Signal Processing 79: 117\u2013128","journal-title":"Signal Processing"},{"key":"373_CR7","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90001-R","volume":"46","author":"R. W. Eglese","year":"1990","unstructured":"Eglese R. W. (1990) Simulated annealing: A tool for operational research. European Journal of Operational Research 46: 271\u2013281","journal-title":"European Journal of Operational Research"},{"key":"373_CR8","unstructured":"Fleischer, M. A. (1995). Assessing the performance of the simulated annealing algorithm using information. Theory (Doctoral Dissertation), Department of Operations Research, Case Western Reserve University, Cleveland, Ohio."},{"key":"373_CR9","doi-asserted-by":"crossref","unstructured":"Fleischer, M. A. (1995). Simulated annealing: Past, present, and future. In: C. Alexopoulos, K. Kang, W. R. Lilegdon and D. Goldsman (eds.), Proceedings of the 1995 Winter Simulation Conference, IEEE Press, pp. 155\u2013161.","DOI":"10.1145\/224401.224457"},{"key":"373_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/b101874","volume-title":"Handbook of metaheuristics","author":"F. Glover","year":"2003","unstructured":"Glover F., Kochenberger G. A. (2003) Handbook of metaheuristics. Stanford University, Stanford"},{"key":"373_CR11","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/0377-2217(94)90407-3","volume":"77","author":"J. N. D. Gupta","year":"1994","unstructured":"Gupta J. N. D., Tunc E. A. (1994) Scheduling a two-stage hybrid flow shop with separable setup and removal times. European Journal of Operational Research 77: 415\u2013428","journal-title":"European Journal of Operational Research"},{"key":"373_CR12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1080\/10556780008805777","volume":"13","author":"B. Hamma","year":"2000","unstructured":"Hamma B., Viitanen S., Torn A. (2000) Parallel continuous simulated annealing for global optimization. Optimization Methods and Software 13: 95\u2013116","journal-title":"Optimization Methods and Software"},{"key":"373_CR13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0925-5273(03)00011-2","volume":"86","author":"T. S. L. Hung","year":"2003","unstructured":"Hung T. S. L., Ching J. L. (2003) A case study in a two-stage hybrid flow shop with setup time and dedicated machines. International Journal of Production Economics 86: 133\u2013143","journal-title":"International Journal of Production Economics"},{"key":"373_CR14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0925-5273(94)90118-X","volume":"33","author":"H. Ishibuchi","year":"1994","unstructured":"Ishibuchi H., Yamamoto N., Misaki S., Tanaka H. (1994) Local search algorithms for flow shop scheduling with fuzzy due-dates. International Journal of Production Economics 33: 53\u201366","journal-title":"International Journal of Production Economics"},{"key":"373_CR15","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.ijpe.2004.05.027","volume":"105","author":"A. Janiak","year":"2007","unstructured":"Janiak A., Kozan E., Lichtenstein M., O\u011fuz C. (2007) Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. International Journal of Production Economics 105: 407\u2013424","journal-title":"International Journal of Production Economics"},{"key":"373_CR16","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.ijpe.2004.12.025","volume":"100","author":"Z. Jin","year":"2006","unstructured":"Jin Z., Yang Z., Ito T. (2006) Metaheuristic algorithms for the multistage hybrid flow shop scheduling problem. International Journal of Production Economics 100: 322\u2013334","journal-title":"International Journal of Production Economics"},{"key":"373_CR17","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D. S. Johnson","year":"1989","unstructured":"Johnson D. S., Aragon C. R., McGeoch L. A., Schevon C. (1989) Optimization by simulated annealing\u2014an experimental evaluation; part 1, graph partitioning. Operations Research 37: 865\u2013892","journal-title":"Operations Research"},{"key":"373_CR18","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D. S. Johnson","year":"1991","unstructured":"Johnson D. S., Aragon C. R., McGeoch L. A., Schevon C. (1991) Optimization by simulated annealing\u2014an experimental evaluation; part 2, graph-coloring and number partitioning. Operations Research 39: 378\u2013406","journal-title":"Operations Research"},{"key":"373_CR19","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S. M. Johnson","year":"1954","unstructured":"Johnson S. M. (1954) Optimal two and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1: 61\u201367","journal-title":"Naval Research Logistics Quarterly"},{"key":"373_CR20","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/A:1009622230725","volume":"6","author":"E. K. Karasakal","year":"2000","unstructured":"Karasakal E. K., K\u00f6ksalan M. (2000) A simulated annealing approach to bi-criteria scheduling problems on a single machine. Journal of Heuristics 6: 311\u2013327","journal-title":"Journal of Heuristics"},{"key":"373_CR21","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/0377-2217(95)00119-0","volume":"91","author":"Y. D. Kim","year":"1996","unstructured":"Kim Y. D., Lim H. G., Park M. W. (1996) Search heuristics for a flow shop scheduling problem in a printed circuit board assembly process. European Journal of Operational Research 91: 124\u2013143","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"373_CR22","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0278-6125(87)90006-9","volume":"6","author":"S. Kochhar","year":"1987","unstructured":"Kochhar S., Morris R. J. T. (1987) Heuristic methods for flexible flow line scheduling. Journal of Manufacturing Systems 6(4): 299\u2013314","journal-title":"Journal of Manufacturing Systems"},{"key":"373_CR23","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0305-0483(94)90006-X","volume":"22","author":"C. Koulamas","year":"1994","unstructured":"Koulamas C., Antony S. R., Jaen R. (1994) A survey of simulated annealing applications to operations-research problems. OMEGA-International Journal of Management Science 22: 41\u201356","journal-title":"OMEGA-International Journal of Management Science"},{"key":"373_CR24","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0925-5273(03)00123-3","volume":"85","author":"M. E. Kurz","year":"2003","unstructured":"Kurz M. E., Askin R. G. (2003) Comparing scheduling rules for flexible flow lines. International Journal of Production Economics 85: 371\u2013388","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"373_CR25","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0377-2217(03)00401-6","volume":"159","author":"M. E. Kurz","year":"2004","unstructured":"Kurz M. E., Askin R. G. (2004) Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research 159(1): 66\u201382","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"373_CR26","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/3477.552184","volume":"27","author":"I. Lee","year":"1997","unstructured":"Lee I., Sikora R., Shaw M.J. (1997) A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes. IEEE Transactions on Systems, Manufacturing, and Cybernetics Part B 27(1): 36\u201354","journal-title":"IEEE Transactions on Systems, Manufacturing, and Cybernetics Part B"},{"key":"373_CR27","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/S0045-7949(98)00255-7","volume":"73","author":"J. P. B. Leite","year":"1999","unstructured":"Leite J. P. B., Topping B. H. V. (1999) Parallel simulated annealing for structural optimization. Computers and Structures 73: 545\u2013564","journal-title":"Computers and Structures"},{"key":"373_CR28","first-page":"115","volume":"29","author":"V. J. Leon","year":"1997","unstructured":"Leon V. J., Ramamoorthy B. (1997) An adaptable problem-space-based search method for flexible flow line scheduling. IIE Transactions 29: 115\u2013125","journal-title":"IIE Transactions"},{"key":"373_CR29","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0925-5273(03)00011-2","volume":"86","author":"H. Lin","year":"2003","unstructured":"Lin H., Liao C. (2003) A case study in a two-stage hybrid flow shop with setup time and dedicated machines. International Journal of Production Economics 86: 133\u2013143","journal-title":"International Journal of Production Economics"},{"key":"373_CR30","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/70.864235","volume":"16","author":"C. Y. Liu","year":"2000","unstructured":"Liu C. Y., Chang S. C. (2000) Scheduling flexible flow shops with sequence-dependent setup effects. IEEE Transactions on Robotics and Automation 16: 408\u2013419","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"373_CR31","doi-asserted-by":"crossref","first-page":"2013","DOI":"10.1016\/j.cor.2004.01.003","volume":"32","author":"C. Low","year":"2005","unstructured":"Low C. (2005) Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Computers and Operations Research 32: 2013\u20132025","journal-title":"Computers and Operations Research"},{"key":"373_CR32","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1018948621875","volume":"76","author":"P. B. Luh","year":"1998","unstructured":"Luh P. B., Gou L., Zhang Y., Nagahora T., Tsuji M., Yoneda K., Hasegawa T., Kyoya Y., Kano T. (1998) Job shop scheduling with group-dependent setups, finite buffers, and long time horizon. Annual of Operation Research 76: 233\u2013259","journal-title":"Annual of Operation Research"},{"key":"373_CR33","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis N., Rosenbluth A., Rosenbluth M., Teller A., Teller E. (1953) Equation of state calculations by fast computing machines. Journal of Chemical Physics 21: 1087\u20131092","journal-title":"Journal of Chemical Physics"},{"key":"373_CR34","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"J. Nawaz","year":"1983","unstructured":"Nawaz J., Enscore E. E., Ham I. (1983) A heuristic algorithm for the m-machine, n-job sequencing problem. OMEGA 11: 91\u201395","journal-title":"OMEGA"},{"key":"373_CR35","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.engappai.2004.02.008","volume":"17","author":"A. C. Nearchou","year":"2004","unstructured":"Nearchou A. C. (2004) A novel metaheuristic approach for the flow shop scheduling problem. Engineering Applications of Artificial Intelligence 17: 289\u2013300","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"373_CR36","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1023\/B:JIMS.0000026570.03851.cc","volume":"15","author":"A. C. Nearchou","year":"2004","unstructured":"Nearchou A. C. (2004) Flow shop sequencing using hybrid simulated annealing. Journal of Intelligent Manufacturing 15: 317\u2013328","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"3","key":"373_CR37","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0305-0548(90)90001-N","volume":"17","author":"F. A. Ogbu","year":"1990","unstructured":"Ogbu F. A., Smith D. K. (1990) The application of the simulated annealing algorithm to the solution of the n\/m\/C max flow shop problem. Computers & Operations Research 17(3): 243\u2013253","journal-title":"Computers & Operations Research"},{"issue":"6","key":"373_CR38","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"I. H. Osman","year":"1989","unstructured":"Osman I. H., Potts C. N. (1989) Simulated annealing for permutation flow-shop scheduling. Omega 17(6): 551\u2013557","journal-title":"Omega"},{"key":"373_CR39","doi-asserted-by":"crossref","first-page":"3173","DOI":"10.1080\/00207549508904867","volume":"33","author":"I. M. Ovacik","year":"1995","unstructured":"Ovacik I. M., Uzsoy R. (1995) Rolling horizon procedures for dynamic parallel machine scheduling with sequence- dependent setup times. International Journal of Production Research 33: 3173\u20133192","journal-title":"International Journal of Production Research"},{"key":"373_CR40","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1023\/A:1009669326107","volume":"6","author":"I. M. Ovacik","year":"2000","unstructured":"Ovacik I. M., Rajagopalan S., Uzsoy R. (2000) Integrating interval estimates of global optima and local search methods for combinatorial optimization problems. Journal of Heuristics 6: 481\u2013500","journal-title":"Journal of Heuristics"},{"key":"373_CR41","volume-title":"Scheduling theory, algorithms, and systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo M. (1995) Scheduling theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs, NJ"},{"key":"373_CR42","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/s00170-002-1525-6","volume":"23","author":"S. Pugazhendhi","year":"2004","unstructured":"Pugazhendhi S., Thiagarajan S., Rajendran C., Anantharaman N. (2004) Generating non-permutation schedules in flow line based manufacturing systems with sequence-dependent setup times of jobs: a heuristic approach. International Journal of Advanced Manufacturing Technology 23: 64\u201378","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"5","key":"373_CR43","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0305-0548(97)00079-8","volume":"25","author":"R. Z. Rios-Mercado","year":"1998","unstructured":"Rios-Mercado R. Z., Bard J. F. (1998) Computational experience with a branch-and-cut algorithm for flow shop scheduling with setups. Computers and Operations Research 25(5): 351\u2013366","journal-title":"Computers and Operations Research"},{"key":"373_CR44","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/BF01759049","volume":"6","author":"F. Romeo","year":"1991","unstructured":"Romeo F., Sangiovanni-Vincentelli A. (1991) A theoretical framework for simulated annealing. Algorithmica 6: 302\u2013345","journal-title":"Algorithmica"},{"key":"373_CR45","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 flow shops with sequence dependent setup times and machine eligibility. European Journal of Operational Research 169: 781\u2013800","journal-title":"European Journal of Operational Research"},{"key":"373_CR46","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1016\/j.ejor.2006.07.029","volume":"187","author":"R. Ruiz","year":"2008","unstructured":"Ruiz R., St\u00fctzle T. (2008) An iterated greedy heuristic for the sequence dependent setup times flow shop with makespan and weighted tardiness objectives. European Journal of Operational Research 187: 1143\u20131159","journal-title":"European Journal of Operational Research"},{"key":"373_CR47","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.apm.2005.03.017","volume":"30","author":"A. Sadegheih","year":"2006","unstructured":"Sadegheih A. (2006) Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance. Applied Mathematical Modeling 30: 147\u2013154","journal-title":"Applied Mathematical Modeling"},{"issue":"6","key":"373_CR48","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1080\/00207548608919815","volume":"24","author":"B. N. Srikar","year":"1986","unstructured":"Srikar B. N., Ghosh S. (1986) A MILP model for the N-job, M-stage flow shop with sequence dependent set-up times. International Journal of Production Research 24(6): 1459\u20131474","journal-title":"International Journal of Production Research"},{"issue":"10","key":"373_CR49","doi-asserted-by":"crossref","first-page":"1817","DOI":"10.1080\/00207549008942836","volume":"28","author":"E. F. Stafford","year":"1990","unstructured":"Stafford E. F., Tseng F. T. (1990) On the Srikar-Ghosh MILP model for the N\u00a0\u00d7\u00a0M SDST flowshop problem. International Journal of Production Research 28(10): 1817\u20131830","journal-title":"International Journal of Production Research"},{"key":"373_CR50","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1002\/nav.3800290313","volume":"29","author":"D. R. Sule","year":"1982","unstructured":"Sule D. R. (1982) Sequencing n jobs on two machines with setup, processing and removal times separated. Naval Research Logistics Quarterly 29: 517\u2013519","journal-title":"Naval Research Logistics Quarterly"},{"key":"373_CR51","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1002\/1520-6750(198710)34:5<619::AID-NAV3220340503>3.0.CO;2-B","volume":"34","author":"W. Szwarc","year":"1987","unstructured":"Szwarc W., Gupta J. N. D. (1987) A flow shop with sequence. Dependent additive setup times. Naval Research Logistics 34: 619\u2013627","journal-title":"Naval Research Logistics"},{"key":"373_CR52","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/opre.23.1.118","volume":"23","author":"E. Uskup","year":"1975","unstructured":"Uskup E., Smith S. B. (1975) A branch and bound algorithm for two-stage production sequencing problems. Operations Research 23: 118\u2013136","journal-title":"Operations Research"},{"key":"373_CR53","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1002\/1520-6750(199008)37:4<559::AID-NAV3220370409>3.0.CO;2-8","volume":"37","author":"A. J. Vakharia","year":"1990","unstructured":"Vakharia A. J., Chang Y. L. (1990) A simulated annealing approach to scheduling a manufacturing cell. Naval Research Logistics 37: 559\u2013577","journal-title":"Naval Research Logistics"},{"key":"373_CR54","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated annealing: Theory and applications","author":"P. J. M. Van Laarhoven","year":"1987","unstructured":"Van Laarhoven P. J. M., Aarts E. H. L. (1987) Simulated annealing: Theory and applications. D. Reidel Kluwer, Academic Publisher, Dordrecht, Boston, Norwell, Massachusetts"},{"issue":"24","key":"373_CR55","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1147\/rd.294.0401","volume":"29","author":"R. Wittrock","year":"1985","unstructured":"Wittrock R. (1985) Scheduling algorithms for flexible flow lines. IBM Journal of Research and Development 29(24): 401\u2013412","journal-title":"IBM Journal of Research and Development"},{"issue":"3","key":"373_CR56","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/opre.36.3.445","volume":"36","author":"R. Wittrock","year":"1988","unstructured":"Wittrock R. (1988) An adaptable scheduling algorithm for flexible flow lines. Operations Research 36(3): 445\u2013453","journal-title":"Operations Research"},{"issue":"6","key":"373_CR57","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1023\/A:1008904604531","volume":"10","author":"S. J. Yim","year":"1999","unstructured":"Yim S. J., Lee D. Y. (1999) Scheduling cluster tools in wafer fabrication using candidate list and simulated annealing. Journal of Intelligent Manufacturing 10(6): 531\u2013540","journal-title":"Journal of Intelligent Manufacturing"},{"key":"373_CR58","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.amc.2005.11.136","volume":"180","author":"M. Zandieh","year":"2006","unstructured":"Zandieh M., Fatemi S. M. T., Moattar Husseini S. M. (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation 180: 111\u2013127","journal-title":"Applied Mathematics and Computation"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-009-0373-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-009-0373-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-009-0373-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:11:47Z","timestamp":1559254307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-009-0373-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,19]]},"references-count":58,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["373"],"URL":"https:\/\/doi.org\/10.1007\/s10845-009-0373-8","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,19]]}}}