{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:40:29Z","timestamp":1759848029260},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,3,24]],"date-time":"2012-03-24T00:00:00Z","timestamp":1332547200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10479-011-1056-3","type":"journal-article","created":{"date-parts":[[2012,3,23]],"date-time":"2012-03-23T18:19:49Z","timestamp":1332526789000},"page":"269-284","source":"Crossref","is-referenced-by-count":10,"title":["Parallel hybrid heuristics for the permutation flow shop problem"],"prefix":"10.1007","volume":"199","author":[{"given":"Mart\u00edn G\u00f3mez","family":"Ravetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Riveros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Mendes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,3,24]]},"reference":[{"key":"1056_CR1","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.ejor.2004.06.039","volume":"169","author":"A. Agarwal","year":"2006","unstructured":"Agarwal, A., Colak, S., & Eryarsoy, E. (2006). Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach. European Journal of Operational Research, 169, 801\u2013815.","journal-title":"European Journal of Operational Research"},{"key":"1056_CR2","series-title":"Handbooks in operations research and management science","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0927-0507(05)80191-4","volume-title":"Requirements planning","author":"K. R. Baker","year":"1993","unstructured":"Baker, K. R. (1993). Handbooks in operations research and management science: Vol. 4. Requirements planning (pp. 571\u2013627). New York: Elsevier."},{"key":"1056_CR3","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0377-2217(97)00136-7","volume":"109","author":"M. Ben-Daya","year":"1998","unstructured":"Ben-Daya, M., & Al-Fawzan, M. (1998). A tabu search approach for the flow shop scheduling problem. European Journal of Operational Research, 109, 88\u201395.","journal-title":"European Journal of Operational Research"},{"key":"1056_CR4","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1023\/B:HEUR.0000045321.59202.52","volume":"10","author":"L. Buriol","year":"2004","unstructured":"Buriol, L., Franca, P., & Moscato, P. (2004). A new memetic algorithm for the asymmetric traveling salesman problem. Journal of Heuristics, 10, 483\u2013506.","journal-title":"Journal of Heuristics"},{"key":"1056_CR5","volume-title":"Computer and job-shop scheduling theory","author":"E. Coffman","year":"1976","unstructured":"Coffman, E. (1976). Computer and job-shop scheduling theory. New York: Wiley."},{"key":"1056_CR6","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/mnsc.23.11.1174","volume":"23","author":"D. G. Dannenbring","year":"1977","unstructured":"Dannenbring, D. G. (1977). An evaluation of flow shop sequencing heuristics. Management Science, 23, 1174\u20131182.","journal-title":"Management Science"},{"key":"1056_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/b101874","volume-title":"Handbook of metaheuristics","author":"F. Glover","year":"2003","unstructured":"Glover, F., & Kochenberger, G. (2003). Handbook of metaheuristics. New York: Springer."},{"key":"1056_CR8","volume-title":"Genetic algorithms: the design of innovation","author":"D. Goldberg","year":"2010","unstructured":"Goldberg, D., & Sastry, K. (2010). Genetic algorithms: the design of innovation (2nd ed.). New York: Springer.","edition":"2"},{"key":"1056_CR9","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\u201368.","journal-title":"Naval Research Logistics Quarterly"},{"key":"1056_CR10","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.biosystems.2006.04.005","volume":"88","author":"P. Moscato","year":"2007","unstructured":"Moscato, P., Mendes, A., & Berretta, R. (2007). Benchmarking a memetic algorithm for ordering microarray data. Biosystems, 88, 56\u201375.","journal-title":"Biosystems"},{"key":"1056_CR11","doi-asserted-by":"crossref","first-page":"1374","DOI":"10.1057\/palgrave.jors.2601466","volume":"53","author":"M. S. Nagano","year":"2002","unstructured":"Nagano, M. S., & Moccellin, J. V. (2002). A high quality solution constructive heuristic for flow shop sequencing. The Journal of the Operational Research Society, 53, 1374\u20131379.","journal-title":"The Journal of the Operational Research Society"},{"key":"1056_CR12","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11, 91\u201395.","journal-title":"Omega"},{"key":"1056_CR13","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 to the solution of the n\/m\/c max flow shop problem. Computers & Operations Research, 17, 243\u2013253.","journal-title":"Computers & Operations Research"},{"key":"1056_CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"C. R. Reeves","year":"1995","unstructured":"Reeves, C. R. (1995). A genetic algorithm for flowshop sequencing. Computers & Operations Research, 22, 5\u201313.","journal-title":"Computers & Operations Research"},{"key":"1056_CR15","volume-title":"Machine scheduling problems: classification, complexity, and computations","author":"A. H. G. Rinnooy Kan","year":"1976","unstructured":"Rinnooy Kan, A. H. G. (1976). Machine scheduling problems: classification, complexity, and computations. The Hagues: Nijhoff."},{"key":"1056_CR16","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","volume":"165","author":"R. Ruiz","year":"2005","unstructured":"Ruiz, R., & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research, 165, 479\u2013494.","journal-title":"European Journal of Operational Research"},{"key":"1056_CR17","first-page":"2033","volume":"77","author":"R. Ruiz","year":"2006","unstructured":"Ruiz, R., & St\u00fctzle, T. (2006). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 77, 2033\u20132049.","journal-title":"European Journal of Operational Research"},{"key":"1056_CR18","first-page":"63.1","volume-title":"MIC2003: The fifth metaheuristics international conference","author":"R. Ruiz","year":"2003","unstructured":"Ruiz, R., Maroto, C., & Alcaraz, J. (2003). New genetic algorithms for the permutational flowshop scheduling problem. In MIC2003: The fifth metaheuristics international conference (pp. 63.1\u201363.8)."},{"key":"1056_CR19","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, 34, 461\u2013476.","journal-title":"Omega"},{"key":"1056_CR20","unstructured":"St\u00fctzle, T. (1998). Applying iterated local search to the permutation flow shop problem. Technical report, TU Darmstadt, AIDA-98-04, FG Intellektik."},{"key":"1056_CR21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"\u00c9. Taillard","year":"1990","unstructured":"Taillard, \u00c9. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47, 65\u201374.","journal-title":"European Journal of Operational Research"},{"key":"1056_CR22","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"\u00c9. Taillard","year":"1993","unstructured":"Taillard, \u00c9. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278\u2013285.","journal-title":"European Journal of Operational Research"},{"key":"1056_CR23","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.ejor.2007.11.049","volume":"192","author":"E. Vallada","year":"2009","unstructured":"Vallada, E., & Ruiz, R. (2009). Cooperative metaheuristics for the permutation flowshop scheduling problem. European Journal of Operational Research, 192, 365\u2013376.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-1056-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-1056-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-1056-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:32Z","timestamp":1559153372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-1056-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,24]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["1056"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-1056-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,24]]}}}