{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:37:54Z","timestamp":1774949874729,"version":"3.50.1"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2010,12,9]],"date-time":"2010-12-09T00:00:00Z","timestamp":1291852800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s00500-010-0673-0","type":"journal-article","created":{"date-parts":[[2010,12,8]],"date-time":"2010-12-08T11:53:08Z","timestamp":1291809188000},"page":"1313-1331","source":"Crossref","is-referenced-by-count":13,"title":["Bi-objective parallel machines scheduling with sequence-dependent setup times using hybrid metaheuristics and weighted min\u2013max technique"],"prefix":"10.1007","volume":"15","author":[{"given":"J.","family":"Behnamian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Zandieh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. M. T.","family":"Fatemi Ghomi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,12,9]]},"reference":[{"key":"673_CR1","volume-title":"Search in combinatorial optimization","author":"E Aarts","year":"1997","unstructured":"Aarts E, Lenstra JK (1997) Search in combinatorial optimization. Wiley, New York"},{"key":"673_CR2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"RK Ahuja","year":"2002","unstructured":"Ahuja RK, Ergun O, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discrete Apply Math 123:75\u2013102","journal-title":"Discrete Appl Math"},{"key":"673_CR3","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/S0305-0548(97)00097-X","volume":"25","author":"MT Almeida","year":"1998","unstructured":"Almeida MT, Centeno M (1998) A composite heuristic for the single machine early\/tardy job scheduling problem. Comput Oper Res 25:625\u2013635","journal-title":"Comput Oper Res"},{"key":"673_CR4","volume-title":"A survey of multiobjective optimization in engineering design, in: technical report LiTH-IKP-R-1097","author":"J Andersson","year":"2000","unstructured":"Andersson J (2000) A survey of multiobjective optimization in engineering design, in: technical report LiTH-IKP-R-1097. Department of Mechanical Engineering, Link\u00f6ping University, Link\u00f6ping"},{"issue":"1\u20133","key":"673_CR5","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0304-3975(03)00288-3","volume":"306","author":"E Angel","year":"2003","unstructured":"Angel E, Bampis E, Kononov A (2003) On the approximate tradeoff for bicriteria batching and parallel machines scheduling problems. Theor Comput Sci 306(1\u20133):319\u2013338","journal-title":"Theor Comput Sci"},{"key":"673_CR6","unstructured":"Anger FD, Lee CY, Martin-Vega LA (1986) Single-machine scheduling with tight windows. Research Paper, 86\u201316, University of Florida"},{"key":"673_CR7","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 flowshop scheduling problems. Eur J Oper Res 167:717\u2013738","journal-title":"Eur J Oper Res"},{"key":"673_CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0305-0548(98)00051-3","volume":"26","author":"N Balakrishnan","year":"1999","unstructured":"Balakrishnan N, Kanet JJ, Sridharan SV (1999) Early\/tardy scheduling with sequence dependent setups on uniform parallel machines. Comput Oper Res 26:127\u2013141","journal-title":"Comput Oper Res"},{"key":"673_CR9","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/S0305-0548(02)00225-3","volume":"31","author":"M Birman","year":"2004","unstructured":"Birman M, Mosheiov G (2004) A note on a due-date assignment on a two-machine flow-shop. Comput Oper Res 31:473\u2013480","journal-title":"Comput Oper Res"},{"key":"673_CR10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10951-007-0028-6","volume":"10","author":"K B\u00fclb\u00fcl","year":"2007","unstructured":"B\u00fclb\u00fcl K, Kaminsky P, Yano C (2007) Preemption in single machine earliness\/tardiness scheduling. J Scheduling 10:271\u2013292","journal-title":"J Scheduling"},{"key":"673_CR11","unstructured":"Carlos A, Coello C, Christiansen AD (1995) An approach to multiobjective optimization using genetic algorithms. Fuzzy Logic Evol Prog 5:411\u2013416; ASME Press, USA"},{"key":"673_CR12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0377-2217(95)00133-6","volume":"93","author":"ZL Chen","year":"1996","unstructured":"Chen ZL (1996) Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs. Eur J Oper Res 93:49\u201360","journal-title":"Eur J Oper Res"},{"key":"673_CR13","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1016\/S0377-2217(01)00068-6","volume":"136","author":"ZL Chen","year":"2002","unstructured":"Chen ZL, Lee CY (2002) Parallel machines scheduling with a common due window. Eur J Oper Res 136:512\u2013527","journal-title":"Eur J Oper Res"},{"key":"673_CR14","first-page":"221","volume":"116","author":"ZL Chen","year":"1999","unstructured":"Chen ZL, Powell WB (1999) A column generation based decomposition algorithm for a parallel machines just-in-time scheduling problem. Eur J Oper Res 116:221\u2013233","journal-title":"Eur J Oper Res"},{"key":"673_CR15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","volume":"47","author":"TCE Cheng","year":"1990","unstructured":"Cheng TCE, Sin CCS (1990) A state-of-the art review of parallel machine scheduling research. Eur J Oper Res 47:271\u2013292","journal-title":"Eur J Oper Res"},{"key":"673_CR16","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 S-M, 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"},{"issue":"4","key":"673_CR17","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1109\/TAC.1980.1102401","volume":"25","author":"HW Corley","year":"1980","unstructured":"Corley HW (1980) A new scalar equivalence for Pareto optimization. IEEE Trans Automat Control 25(4):829\u2013830","journal-title":"IEEE Trans Automat Control"},{"key":"673_CR18","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1057\/jors.1995.184","volume":"46","author":"SR Das","year":"1995","unstructured":"Das SR, Gupta JND, Khumawala BM (1995) A savings index heuristic algorithm for flowshop scheduling with sequence dependent setup times. J Oper Res Soc 46:1365\u20131473","journal-title":"J Oper Res Soc"},{"key":"673_CR19","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, New York"},{"key":"673_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant colony optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo M, Stuetzle T (2004) Ant colony optimization. MIT Press, Boston"},{"key":"673_CR21","doi-asserted-by":"crossref","unstructured":"Driessel R, M\u00f6nch L (2010) Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times. Comput Indus Eng. doi: 10.1016\/j.cie.2010.07.001","DOI":"10.1016\/j.cie.2010.07.001"},{"key":"673_CR22","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1002\/1520-6750(198712)34:6<803::AID-NAV3220340605>3.0.CO;2-2","volume":"34","author":"H Emmons","year":"1987","unstructured":"Emmons H (1987) Scheduling to a common due-date on parallel uniform processors. Naval Res Logist Q 34:803\u2013810","journal-title":"Naval Res Logist Q"},{"key":"673_CR23","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1016\/j.ejor.2004.11.014","volume":"172","author":"B Esteve","year":"2006","unstructured":"Esteve B, Aubijoux C, Chartier A, Tkindt V (2006) A recovering beam search algorithm for the single machine just-in-time scheduling problem. Eur J Oper Res 172:798\u2013813","journal-title":"Eur J Oper Res"},{"key":"673_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-70583-0","volume-title":"Multiple criteria decision methods and applications","author":"G Fandel","year":"1985","unstructured":"Fandel G, Spronk J (1985) Multiple criteria decision methods and applications. Springer, Berlin"},{"key":"673_CR25","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.ijpe.2005.01.003","volume":"101","author":"Y Gajpal","year":"2006","unstructured":"Gajpal Y, Rajendran C (2006) An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops. Int J Prod Econ 101:259\u2013272","journal-title":"Int J Prod Econ"},{"key":"673_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"135","author":"V Gordon","year":"2002","unstructured":"Gordon V, Proth JM, Chu C (2002) A survey of the state-of-the-art of common due-date assignment and scheduling research. Eur J Oper Res 135:1\u201325","journal-title":"Eur J Oper Res"},{"issue":"13","key":"673_CR27","doi-asserted-by":"crossref","first-page":"3031","DOI":"10.1080\/00207540050117422","volume":"38","author":"M Gravel","year":"2000","unstructured":"Gravel M, Price WL, Gagne C (2000) Scheduling in a Alcan aluminium factory using a genetic algorithm. Int J Prod Res 38(13):3031\u20133041","journal-title":"Int J Prod Res"},{"issue":"1","key":"673_CR28","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.dam.2003.09.012","volume":"145","author":"P Hansen","year":"2004","unstructured":"Hansen P, Mladenovic N, Dragan U (2004) Variable neighborhood search for the maximum clique. Discrete Appl Math 145(1):117\u2013125","journal-title":"Discrete Appl Math"},{"key":"673_CR29","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1080\/002075498193192","volume":"36","author":"RB Heady","year":"1998","unstructured":"Heady RB, Zhu Z (1998) Minimizing the sum of job earliness and tardiness in a multimachine system. Int J Prod Res 36:1619\u20131632","journal-title":"Int J Prod Res"},{"key":"673_CR30","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/0377-2217(93)90239-J","volume":"70","author":"JW Herrmann","year":"1993","unstructured":"Herrmann JW, Lee CY (1993) On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date. Eur J Oper Res 70:272\u2013288","journal-title":"Eur J Oper Res"},{"key":"673_CR31","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","volume":"167","author":"JA Hoogeveen","year":"2005","unstructured":"Hoogeveen JA (2005) Multicriteria scheduling. Eur J Oper Res 167:592\u2013623","journal-title":"Eur J Oper Res"},{"issue":"1","key":"673_CR32","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.cie.2009.10.003","volume":"58","author":"S Huang","year":"2010","unstructured":"Huang S, Cai L, Zhang X (2010) Parallel dedicated machine scheduling problem with sequence-dependent setups and a single server. Comput Ind Eng 58(1):165\u2013174","journal-title":"Comput Ind Eng"},{"key":"673_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-45511-7","volume-title":"Multiple objectives decision making-methods and applications","author":"C-L Hwang","year":"1979","unstructured":"Hwang C-L, Masud ASM (1979) Multiple objectives decision making-methods and applications. Springer, Berlin"},{"issue":"1","key":"673_CR34","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(80)90011-8","volume":"7","author":"C Hwang","year":"1980","unstructured":"Hwang C, Paidy S, Yoon K (1980) Mathematical programming with multiple objectives: a tutorial. Comput Oper Res 7(1):5\u201331","journal-title":"Comput Oper Res"},{"key":"673_CR35","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, Oguz C (2007) Metaheuristic approaches to the hybrid flowshop scheduling problem with a cost-related criterion. Int J Prod Econ 105:407\u2013424","journal-title":"Int J Prod Econ"},{"key":"673_CR36","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0736-5845(02)00013-3","volume":"18","author":"D Kim","year":"2002","unstructured":"Kim D, Kim K, Jang W, Chen F (2002) Unrelated parallel machines scheduling with setup times using simulated annealing. Robot Comput Integr Manuf 18:223\u2013231","journal-title":"Robot Comput Integr Manuf"},{"key":"673_CR37","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0736-5845(02)00077-7","volume":"19","author":"DW Kima","year":"2003","unstructured":"Kima DW, Na DG, Chenb FF (2003) Unrelated parallel machines scheduling with setup times and a total weighted tardiness objective. Comput Integr Manuf 19:173\u2013181","journal-title":"Comput Integr Manuf"},{"key":"673_CR38","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"key":"673_CR39","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0895-7177(94)90208-9","volume":"20","author":"FJ Kramer","year":"1994","unstructured":"Kramer FJ, Lee CY (1994) Due window scheduling for parallel machines. Math Comput Model 20:69\u201389","journal-title":"Math Comput Model"},{"key":"673_CR40","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0167-6377(90)90056-B","volume":"9","author":"W Kubiak","year":"1990","unstructured":"Kubiak W, Lou S, Sethi R (1990) Equivalence of mean flow time problems and mean absolute deviation problems. Oper Res Lett 9:371\u2013374","journal-title":"Oper Res Lett"},{"key":"673_CR201","doi-asserted-by":"crossref","unstructured":"Kurz ME, Askin RG (2004) Scheduling flexible flow lines with sequence-dependent setup times. Eur J Oper Res 159:66\u201382","DOI":"10.1016\/S0377-2217(03)00401-6"},{"issue":"3","key":"673_CR41","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1108\/01443579710159932","volume":"17","author":"K Lam","year":"1997","unstructured":"Lam K (1997) New trends in parallel machine scheduling. Int J Oper Prod Manage 17(3):326\u2013338","journal-title":"Int J Oper Prod Manage"},{"key":"673_CR42","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1108\/01443579710159932","volume":"17","author":"K Lam","year":"1997","unstructured":"Lam K, Xing W (1997) New trends in parallel machines scheduling. Int J Oper Manage 17:326\u2013338","journal-title":"Int J Oper Manage"},{"key":"673_CR43","doi-asserted-by":"crossref","unstructured":"Lamothe J, Marmier F, Dupuy M, Gaborit P, Dupont L (2010) Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints. Comput Oper Res. doi: 10.1016\/j.cor.2010.07.007","DOI":"10.1016\/j.cor.2010.07.007"},{"key":"673_CR44","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/j.mcm.2003.05.019","volume":"40","author":"V Lauff","year":"2004","unstructured":"Lauff V, Werner F (2004) Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey. Math Comput Model 40:637\u2013655","journal-title":"Math Comput Model"},{"key":"673_CR45","doi-asserted-by":"crossref","DOI":"10.1201\/9780203489802","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"JY-T Leung","year":"2004","unstructured":"Leung JY-T (2004) Handbook of scheduling: algorithms, models, and performance analysis. Chapman & Hall\\CRP, The Netherlands"},{"issue":"2","key":"673_CR46","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/j.ejor.2007.03.006","volume":"187","author":"K Li","year":"2008","unstructured":"Li K, Sivakumar AI, Kumar Ganesan V (2008) Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain. Eur J Oper Res 187(2):442\u2013455","journal-title":"Eur J Oper Res"},{"key":"673_CR47","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1016\/S0305-0548(03)00113-8","volume":"31","author":"CH Lin","year":"2003","unstructured":"Lin CH, Liao CJ (2003) Makespan minimization subject to flowtime optimality on identical parallel machines. Comput Oper Res 31:1655\u20131666","journal-title":"Comput Oper Res"},{"key":"673_CR48","doi-asserted-by":"crossref","first-page":"3420","DOI":"10.1016\/j.cor.2006.02.006","volume":"11","author":"R Logendrana","year":"2007","unstructured":"Logendrana R, Mcdonellb B, Smuckera B (2007) Scheduling unrelated parallel machines with sequence-dependent setups. Comput Oper Res 11:3420\u20133438","journal-title":"Comput Oper Res"},{"key":"673_CR49","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1080\/00207549308956713","volume":"31","author":"BL MacCarthy","year":"1993","unstructured":"MacCarthy BL, Liu J (1993) Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling. Int J Prod Res 31:59\u201379","journal-title":"Int J Prod Res"},{"key":"673_CR50","volume-title":"Nonlinear multiobjective optimization","author":"K Miettinen","year":"1999","unstructured":"Miettinen K (1999) Nonlinear multiobjective optimization. Kluwer, Boston"},{"key":"673_CR51","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097\u20131100","journal-title":"Comput Oper Res"},{"key":"673_CR52","first-page":"193","volume":"18","author":"E Mokotoff","year":"2001","unstructured":"Mokotoff E (2001) Parallel machine scheduling problems: a survey. Asia-Pacific J Oper Res 18:193\u2013242","journal-title":"Asia-Pacific J Oper Res"},{"key":"673_CR53","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2000","unstructured":"Montgomery DC (2000) Design and analysis of experiments. Wiley, Fifth ed., New York"},{"key":"673_CR200","doi-asserted-by":"crossref","unstructured":"Norman B, Bean J (1999) A genetic algorithm methodology for complex scheduling problems. Naval Res Logist 46:199\u2013211","DOI":"10.1002\/(SICI)1520-6750(199903)46:2<199::AID-NAV5>3.0.CO;2-L"},{"key":"673_CR54","volume-title":"Multicriterion optimization in engineering with FORTRAN programs","author":"A Osyczka","year":"1984","unstructured":"Osyczka A (1984) Multicriterion optimization in engineering with FORTRAN programs. Wiley, New York"},{"key":"673_CR55","volume-title":"Scheduling theory, algorithms and systems","author":"M Pinedo","year":"2002","unstructured":"Pinedo M (2002) Scheduling theory, algorithms and systems. Prentice-Hall, Englewood Cliffs"},{"issue":"5","key":"673_CR56","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":"673_CR57","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1093\/imaman\/dpm016","volume":"18","author":"M Rocha de Paula","year":"2007","unstructured":"Rocha de Paula M, Ravetti MG, Mateus GR, Pardalos PM (2007) Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighborhood search. IMA J Manage Math 18:101\u2013115","journal-title":"IMA J Manage Math"},{"issue":"4","key":"673_CR58","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1016\/j.cor.2006.07.015","volume":"35","author":"MMG Rocha de Paula","year":"2008","unstructured":"Rocha de Paula MMG, Mateus GR, Pardalos PM (2008) Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Comput Oper Res 35(4):1250\u20131264","journal-title":"Comput Oper Res"},{"issue":"5","key":"673_CR59","doi-asserted-by":"crossref","first-page":"938","DOI":"10.1016\/j.cor.2009.07.006","volume":"37","author":"M Rocha de Paula","year":"2010","unstructured":"Rocha de Paula M, Mateus GR, Ravetti MG (2010) A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times. Comput Oper Res 37(5):938\u2013949","journal-title":"Comput Oper Res"},{"key":"673_CR60","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s11590-006-0020-7","volume":"1","author":"A Set\u00e4maa-K\u00e4rkk\u00e4inen","year":"2007","unstructured":"Set\u00e4maa-K\u00e4rkk\u00e4inen A, Miettinen K, Vuori J (2007) Heuristic for a new multiobjective scheduling problem. Opt Lett 1:213\u2013225","journal-title":"Opt Lett"},{"key":"673_CR61","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/S0305-0548(98)00090-2","volume":"26","author":"F Sivrikaya-Serifoglu","year":"1999","unstructured":"Sivrikaya-Serifoglu F, Ulusoy G (1999) Parallel machines scheduling with earliness and tardiness penalties. Comput Oper Res 26:773\u2013787","journal-title":"Comput Oper Res"},{"key":"673_CR62","volume-title":"Multiple criteria optimization: theory","author":"R Steuer","year":"1986","unstructured":"Steuer R (1986) Multiple criteria optimization: theory. Wiley Computation and Application, New York"},{"key":"673_CR63","unstructured":"St\u00fctzle, T., 1998. An ant approach for the flowshop problem. In: Zimmerman H (ed) Proceedings of the sixth European congress on intelligent techniques and soft computing (EUFIT\u201998), vol 3. Verlag Mainz: Aachen, Germany, pp 1560\u20131564"},{"key":"673_CR64","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0360-8352(95)00028-3","volume":"30","author":"V Suresh","year":"1996","unstructured":"Suresh V, Chaudhuri D (1996) Bicriteria scheduling problem for unrelated parallel machines. Comput Ind Eng 30:77\u201382","journal-title":"Comput Ind Eng"},{"issue":"5","key":"673_CR65","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"E Talbi","year":"2002","unstructured":"Talbi E (2002) A taxonomy of hybrid metaheuristics. J Heuristics 8(5):541\u2013564","journal-title":"J Heuristics"},{"key":"673_CR66","doi-asserted-by":"crossref","first-page":"5072","DOI":"10.1016\/j.ins.2007.06.001","volume":"177","author":"R Tavakkoli-Moghaddam","year":"2007","unstructured":"Tavakkoli-Moghaddam R, Rahimi-Vahed A, Hossein Mirzaei A (2007) A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Inf Sci 177:5072\u20135090","journal-title":"Inf Sci"},{"issue":"12","key":"673_CR67","doi-asserted-by":"crossref","first-page":"3224","DOI":"10.1016\/j.cor.2009.02.012","volume":"36","author":"R Tavakkoli-Moghaddam","year":"2009","unstructured":"Tavakkoli-Moghaddam R, Taheri F, Bazzazi M, Izadi M, Sassani F (2009) Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Comput Oper Res 36(12):3224\u20133230","journal-title":"Comput Oper Res"},{"key":"673_CR68","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0377-2217(98)00308-7","volume":"118","author":"P Tian","year":"1999","unstructured":"Tian P, Ma J, Zhang DM (1999) Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: an investigation of generation mechanism. Eur J Oper Res 118:81\u201394","journal-title":"Eur J Oper Res"},{"issue":"3","key":"673_CR69","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1016\/j.ejor.2004.07.020","volume":"167","author":"TK Varadharajan","year":"2005","unstructured":"Varadharajan TK, Rajendran C (2005) A multi-objective simulated annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. Eur J Oper Res 167(3):772\u2013795","journal-title":"Eur J Oper Res"},{"key":"673_CR70","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0377-2217(01)00302-2","volume":"142","author":"G Wan","year":"2002","unstructured":"Wan G, Yen BPC (2002) Tabu search for single machine scheduling with distinct due windows and weighted earliness\/tardiness penalties. Eur J Oper Res 142:271\u2013281","journal-title":"Eur J Oper Res"},{"issue":"3","key":"673_CR71","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1016\/j.cie.2008.09.026","volume":"56","author":"T Yang","year":"2009","unstructured":"Yang T (2009) An evolutionary simulation\u2013optimization approach in solving parallel-machine scheduling problems\u2014a case study. Comput Ind Eng 56(3):1126\u20131136","journal-title":"Comput Ind Eng"},{"key":"673_CR72","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1080\/00207169508804397","volume":"56","author":"X Yao","year":"1995","unstructured":"Yao X (1995) A new simulated annealing algorithm. Int J Comput Math 56:161\u2013168","journal-title":"Int J Comput Math"},{"key":"673_CR73","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/S0925-5273(03)00044-6","volume":"90","author":"WK Yeung","year":"2004","unstructured":"Yeung WK, O\u011fuz C, Cheng TCE (2004) Two-stage flowshop earliness and tardiness machine scheduling involving a common due window. Int J Prod Econ 90:421\u2013434","journal-title":"Int J Prod Econ"},{"key":"673_CR74","first-page":"921","volume":"34","author":"L Yu","year":"2002","unstructured":"Yu L, Shih HM, Pfund M, Carlyle WM, Fowler JW (2002) Scheduling of unrelated parallel machines: an application to PWB manufacturing. IEEE Trans 34:921\u2013931","journal-title":"IEEE Trans"},{"key":"673_CR75","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/TAC.1963.1105511","volume":"8","author":"L Zadeh","year":"1963","unstructured":"Zadeh L (1963) Optimality and non-scalar-valued performance criteria. IEEE Transn Automat Control 8:59\u201360","journal-title":"IEEE Transn Automat Control"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-010-0673-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-010-0673-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-010-0673-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,14]],"date-time":"2021-11-14T22:58:32Z","timestamp":1636930712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-010-0673-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,9]]},"references-count":77,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["673"],"URL":"https:\/\/doi.org\/10.1007\/s00500-010-0673-0","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,9]]}}}