{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T22:54:09Z","timestamp":1680648849560},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2016,6,25]],"date-time":"2016-06-25T00:00:00Z","timestamp":1466812800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Prod. Eng. Res. Devel."],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s11740-016-0679-2","type":"journal-article","created":{"date-parts":[[2016,6,26]],"date-time":"2016-06-26T07:43:31Z","timestamp":1466927011000},"page":"477-488","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bi-objective scheduling of flexible flow lines: a gradual transition tabu search approach"],"prefix":"10.1007","volume":"10","author":[{"given":"M.","family":"Zandieh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. B.","family":"Abiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seyed Habib A.","family":"Rahmati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,25]]},"reference":[{"issue":"4","key":"679_CR1","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1287\/opre.41.4.641","volume":"41","author":"L Adler","year":"1993","unstructured":"Adler L, Fraiman N, Kobacker E, Pinedo M, Plotnicoff TP, Wu TP (1993) BPSS: a scheduling support system for the packaging industry. Oper Res 41(4):641\u2013648","journal-title":"Oper Res"},{"key":"679_CR2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/3-540-36131-6_34","volume":"2527","author":"M Affenzeller","year":"2002","unstructured":"Affenzeller M (2002) New generic hybrids based upon genetic algorithms. Lect Notes Comput Sci 2527:329\u2013339","journal-title":"Lect Notes Comput Sci"},{"key":"679_CR3","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/S0377-2217(96)00203-2","volume":"97","author":"A Agnetis","year":"1997","unstructured":"Agnetis A, Pacifici A, Rossi F, Lucertini M, Nicoletti S, Nicolo F, Oriolo G, Pacciarelli D, Pesaro E (1997) Scheduling of flexible flow lines in an automobile assembly plant. Eur J Oper Res 97:348\u2013362","journal-title":"Eur J Oper Res"},{"key":"679_CR4","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/j.ejor.2004.07.017","volume":"167","author":"JEC Arroyo","year":"2005","unstructured":"Arroyo JEC, Armentano VA (2005) Genetic local search for multi-objective flow shop scheduling problems. Eur J Oper Res 167:717\u2013738","journal-title":"Eur J Oper Res"},{"issue":"8","key":"679_CR5","doi-asserted-by":"crossref","first-page":"11057","DOI":"10.1016\/j.eswa.2009.02.080","volume":"36","author":"J Behnamian","year":"2009","unstructured":"Behnamian J, Fatemi Ghomi SMT, Zandieh M (2009) A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic. Expert Syst Appl 36(8):11057\u201311069","journal-title":"Expert Syst Appl"},{"key":"679_CR6","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0305-0548(02)00198-3","volume":"31","author":"U Bilge","year":"2004","unstructured":"Bilge U, Kirac F, Kurtulan M, Pekg\u00fcn P (2004) A tabu search algorithm for parallel machine total tardiness problem. Comput Oper Res 31:397\u2013414","journal-title":"Comput Oper Res"},{"issue":"3","key":"679_CR7","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/j.eswa.2005.04.033","volume":"29","author":"P-C Chang","year":"2005","unstructured":"Chang P-C, Chen S-H, Lin K-L (2005) Two-phase sub population genetic algorithm for parallel machine-scheduling problem. Expert Syst Appl 29(3):705\u2013712","journal-title":"Expert Syst Appl"},{"key":"679_CR8","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1007\/11881070_98","volume":"4221","author":"P-C Chang","year":"2006","unstructured":"Chang P-C, Chen S-H, Hsieh J-Ch (2006) A global archive sub-population genetic algorithm with adaptive strategy in multi-objective parallel-machine scheduling problem. Lect Notes Comput Sci 4221:730\u2013739","journal-title":"Lect Notes Comput Sci"},{"key":"679_CR9","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1016\/S0305-0548(02)00059-X","volume":"30","author":"JK Cochran","year":"2003","unstructured":"Cochran JK, Horng SM, Fowler JW (2003) A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Comput Oper Res 30:1087\u20131102","journal-title":"Comput Oper Res"},{"key":"679_CR10","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0377-2217(97)00279-8","volume":"106","author":"E Costamagna","year":"1998","unstructured":"Costamagna E, Fanni A, Giacinto G (1998) A tabu search algorithm for the optimization of telecommunication networks. Eur J Oper Res 106:357\u2013372","journal-title":"Eur J Oper Res"},{"key":"679_CR11","doi-asserted-by":"crossref","unstructured":"Deb K, Amrit Pratap SA, Meyarivan T (2000) A fast and elitist multi objective genetic algorithm-NSGA-II. In: Proceedings of the parallel problem solving from nature VI conference. Paris, France, September 2000, 849\u2013858","DOI":"10.1007\/3-540-45356-3_83"},{"key":"679_CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0360-8352(94)90025-6","volume":"26","author":"FY Ding","year":"1994","unstructured":"Ding FY, Kittichartphayak D (1994) Heuristics for scheduling flexible flow lines. Comput Ind Eng 26:27\u201334","journal-title":"Comput Ind Eng"},{"key":"679_CR13","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du J, Leung JYT (1990) Minimizing total tardiness on one machine is NP-hard. Math Oper Res 15:483\u2013495","journal-title":"Math Oper Res"},{"issue":"2","key":"679_CR14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117\u2013129","journal-title":"Math Oper Res"},{"key":"679_CR15","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search: part I. ORSA J Comput 1:190\u2013206","journal-title":"ORSA J Comput"},{"key":"679_CR16","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search: part II. ORSA J Comput 2:4\u201332","journal-title":"ORSA J Comput"},{"issue":"6","key":"679_CR17","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1080\/00207549608904988","volume":"34","author":"AGP Guinet","year":"1996","unstructured":"Guinet AGP, Solomon M (1996) Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time. Int J Prod Res 34(6):1643\u20131654","journal-title":"Int J Prod Res"},{"issue":"2","key":"679_CR18","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1162\/1063656054088530","volume":"13","author":"J Hu","year":"2005","unstructured":"Hu J, Goodman E, Seo K, Fan Z, Rosenberg R (2005) The hierarchical fair competition framework for sustainable evolutionary algorithms. Evol Comput 13(2):241\u2013277","journal-title":"Evol Comput"},{"issue":"8","key":"679_CR19","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/0305-0548(94)90017-5","volume":"21","author":"R H\u00fcbscher","year":"1994","unstructured":"H\u00fcbscher R, Glover F (1994) Applying tabu search with influential diversification to multiprocessor scheduling. Comput Oper Res 21(8):877\u2013884","journal-title":"Comput Oper Res"},{"key":"679_CR20","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0925-5273(03)00011-2","volume":"86","author":"TSL Hung","year":"2003","unstructured":"Hung TSL, Ching JL (2003) A case study in a two-stage hybrid flow shop with setup time and dedicated machines. Int J Prod Econ 86:133\u2013143","journal-title":"Int J Prod Econ"},{"key":"679_CR21","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/S0377-2217(97)00261-0","volume":"106","author":"RJW James","year":"1998","unstructured":"James RJW, Buchanan JT (1998) Performance enhancements to tabu search for the early\/tardy scheduling problem. Eur J Oper Res 106:254\u2013265","journal-title":"Eur J Oper Res"},{"key":"679_CR22","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1007\/11751595_77","volume":"3982","author":"S Kim","year":"2006","unstructured":"Kim S, Choi H, Lee D (2006) Tabu search heuristics for parallel machine scheduling with sequence-dependent setup and ready times. Lect Notes Comput Sci 3982:728\u2013737","journal-title":"Lect Notes Comput Sci"},{"issue":"3","key":"679_CR23","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2003.12.026","volume":"164","author":"T Kis","year":"2005","unstructured":"Kis T, Pesch E (2005) A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. Eur J Oper Res 164(3):592\u2013608","journal-title":"Eur J Oper Res"},{"issue":"4","key":"679_CR24","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 RJ (1987) Heuristic methods for flexible flow line scheduling. J Manuf Syst 6(4):299\u2013314","journal-title":"J Manuf Syst"},{"key":"679_CR25","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0925-5273(03)00123-3","volume":"85","author":"ME Kurz","year":"2003","unstructured":"Kurz ME, Askin RG (2003) Comparing scheduling rules for flexible flow lines. Int J Prod Econ 85:371\u2013388","journal-title":"Int J Prod Econ"},{"key":"679_CR26","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0377-2217(03)00401-6","volume":"159","author":"ME Kurz","year":"2004","unstructured":"Kurz ME, Askin RG (2004) Scheduling flexible flow lines with sequence-dependent setup times. Eur J Oper Res 159:66\u201382","journal-title":"Eur J Oper Res"},{"key":"679_CR27","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01471219","volume":"2","author":"M Laguna","year":"1991","unstructured":"Laguna M, Barnes JW, Glover F (1991) Tabu search methods for a single machine scheduling problem. J Intell Manuf 2:63\u201374","journal-title":"J Intell Manuf"},{"key":"679_CR28","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1142\/9789814354363_0013","volume-title":"Complexity in numerical optimization","author":"C-Y Lee","year":"1993","unstructured":"Lee C-Y, Vairaktarakis GL (1993) Complexity of single machine hierarchical scheduling: a survey. In: Pardalos PM (ed) Complexity in numerical optimization. WorldScientific Publishing, Singapore, pp 269\u2013298"},{"key":"679_CR29","first-page":"115","volume":"29","author":"VJ Leon","year":"1997","unstructured":"Leon VJ, Ramamoorthy B (1997) An adaptable problem-space based search method for flexible flow line scheduling. IIE Trans 29:115\u2013125","journal-title":"IIE Trans"},{"key":"679_CR30","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0305-0548(98)00056-2","volume":"26","author":"C-F Liaw","year":"1999","unstructured":"Liaw C-F (1999) A tabu search algorithm for the open shop scheduling problem. Comput Oper Res 26:109\u2013126","journal-title":"Comput Oper Res"},{"key":"679_CR31","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2000","unstructured":"Montgomery DC (2000) Design and analysis of experiments, 5th edn. Wiley, New York","edition":"5"},{"key":"679_CR32","first-page":"1404","volume":"2","author":"S Mostaghim","year":"2004","unstructured":"Mostaghim S, Teich J (2004) Covering Pareto-optimal fronts by subswarms in multiobjective particle swarm optimization. Evol Comput 2:1404\u20131411","journal-title":"Evol Comput"},{"key":"679_CR33","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0925-5273(99)00051-1","volume":"64","author":"O Moursli","year":"2000","unstructured":"Moursli O, Pochet Y (2000) A branch-and-bound algorithm for the hybrid flowshop. Int J Prod Econ 64:113\u2013125","journal-title":"Int J Prod Econ"},{"key":"679_CR34","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1016\/0360-8352(96)00045-9","volume":"30","author":"T Murata","year":"1996","unstructured":"Murata T, Ishibuchi H, Tanaka H (1996) Multi-objective genetic algorithm and its application to flow shop scheduling. Comput Ind Eng 30:957\u2013968","journal-title":"Comput Ind Eng"},{"key":"679_CR35","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1002\/(SICI)1520-6750(199903)46:2<199::AID-NAV5>3.0.CO;2-L","volume":"46","author":"BA Norman","year":"1999","unstructured":"Norman BA, Bean JC (1999) A genetic algorithm methodology for complex scheduling problems. Nav Res Logist 46:199\u2013211","journal-title":"Nav Res Logist"},{"key":"679_CR36","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0377-2217(97)00260-9","volume":"106","author":"E Nowicki","year":"1998","unstructured":"Nowicki E, Smutnicki C (1998) The flow shop with parallel machines: a tabu search approach. Eur J Oper Res 106:226\u2013253","journal-title":"Eur J Oper Res"},{"key":"679_CR37","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/S0360-8352(97)00255-6","volume":"33","author":"M-W Park","year":"1997","unstructured":"Park M-W, Kim Y-D (1997) Search heuristics for a parallel machine scheduling problem with ready times and due dates. Comput Ind Eng 33:793\u2013796","journal-title":"Comput Ind Eng"},{"key":"679_CR38","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1007\/s00170-004-2249-6","volume":"27","author":"T Pasupathy","year":"2006","unstructured":"Pasupathy T, Rajendran C, Suresh RK (2006) A multi objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs. Int J Adv Manuf Technol 27:804\u2013815","journal-title":"Int J Adv Manuf Technol"},{"key":"679_CR39","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"},{"key":"679_CR40","unstructured":"Riane F (1998) Scheduling hybrid flowshops: algorithms and applications. Ph.D. Thesis, Faculte\u2019s Universitaires Catholiquesde Mons"},{"issue":"11","key":"679_CR41","doi-asserted-by":"crossref","first-page":"2291","DOI":"10.1080\/00207540500066762","volume":"43","author":"D Quadt","year":"2005","unstructured":"Quadt D, Kuhn H (2005) A conceptual framework for lotsizing and scheduling of flexible flow lines. Int J Prod Res 43(11):2291\u20132308","journal-title":"Int J Prod Res"},{"issue":"5","key":"679_CR42","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0305-0548(97)00079-8","volume":"25","author":"RZ Rios-Mercado","year":"1998","unstructured":"Rios-Mercado RZ, Bard JF (1998) Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. Comput Oper Res 25(5):351\u2013366","journal-title":"Comput Oper Res"},{"key":"679_CR43","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-3-642-80784-8_7","volume-title":"Symposium on the theory of scheduling and its applications","author":"MS Salvador","year":"1973","unstructured":"Salvador MS (1973) A solution to a special class of flow shop scheduling problems. In: Elmaghraby SE (ed) Symposium on the theory of scheduling and its applications. Springer, Berlin, pp 83\u201391"},{"issue":"2","key":"679_CR44","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/asm.3150090206","volume":"9","author":"TJ Sawik","year":"1993","unstructured":"Sawik TJ (1993) A scheduling algorithm for flexible flow lines with limited intermediate buffers. Appl Stoch Models Data Anal 9(2):127\u2013138","journal-title":"Appl Stoch Models Data Anal"},{"key":"679_CR45","unstructured":"Sawik TJ (1994) New algorithms for scheduling flexible flow lines. In: Proceedings of Japan\u2013USA symposium on flexible automation, Kobe 3, 1091\u20131096"},{"issue":"5","key":"679_CR46","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1080\/00207549508930214","volume":"33","author":"TJ Sawik","year":"1995","unstructured":"Sawik TJ (1995) Scheduling flexible flow lines with no in-process buffers. Int J Prod Res 33(5):1357\u20131367","journal-title":"Int J Prod Res"},{"key":"679_CR47","unstructured":"Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of first international conference on genetic algorithms and their applications. Carnegie-Mellon University, Pittsburgh, PA, USA, 93\u2013100"},{"issue":"6","key":"679_CR48","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1080\/00207548608919815","volume":"24","author":"BN Srikar","year":"1986","unstructured":"Srikar BN, Ghosh S (1986) A MILP model for the N-job, M-stage flowshop with sequence dependent set-up times. Int J Prod Res 24(6):1459\u20131474","journal-title":"Int J Prod Res"},{"issue":"3","key":"679_CR49","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Multi-objective optimization using non-dominated sorting in genetic algorithms. Evol Comput 2(3):221\u2013248","journal-title":"Evol Comput"},{"key":"679_CR50","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.ejor.2004.11.012","volume":"173","author":"SA Torabi","year":"2005","unstructured":"Torabi SA, Fatemi Ghomi SMT, Karimi B (2005) A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains. Eur J Oper Res 173:173\u2013189","journal-title":"Eur J Oper Res"},{"key":"679_CR51","unstructured":"Veldhuizen DAV, Lamont GB (1998) Evolutionary computation and convergence to a Pareto front. In: Koza JR (edr) Late breaking papers at the genetic programming 1998 conference, Stanford University, California, July 1998. Stanford University Bookstore, 221\u2013228"},{"issue":"4","key":"679_CR52","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/opre.36.3.445","volume":"36","author":"RJ Wittrock","year":"1988","unstructured":"Wittrock RJ (1988) An adaptable scheduling algorithm for flexible flow lines. Oper Res 36(4):445\u2013453","journal-title":"Oper Res"},{"key":"679_CR53","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 Ghomi SMT, Moattar Husseini SM (2006) An immune algorithm approach to hybrid flowshops scheduling with sequence-dependent setup times. Appl Math Comput 180:111\u2013127","journal-title":"Appl Math Comput"},{"key":"679_CR54","doi-asserted-by":"crossref","unstructured":"Zitzler E, Laumanns M, Bleuler S (2004) A tutorial on evolutionary multiobjective optimization. In: Proceedings of the workshop on multiple objective meta-heuristics (MOMH 2002). Springer, Paris, France, June 2002, 3\u201338","DOI":"10.1007\/978-3-642-17144-4_1"}],"container-title":["Production Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11740-016-0679-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11740-016-0679-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11740-016-0679-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:11:39Z","timestamp":1498309899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11740-016-0679-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,25]]},"references-count":54,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["679"],"URL":"https:\/\/doi.org\/10.1007\/s11740-016-0679-2","relation":{},"ISSN":["0944-6524","1863-7353"],"issn-type":[{"value":"0944-6524","type":"print"},{"value":"1863-7353","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,25]]}}}