{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:49:12Z","timestamp":1761598152909},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,2,21]],"date-time":"2017-02-21T00:00:00Z","timestamp":1487635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["S\u0101dhan\u0101"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s12046-017-0611-2","type":"journal-article","created":{"date-parts":[[2019,12,15]],"date-time":"2019-12-15T04:43:04Z","timestamp":1576384984000},"page":"391-403","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem"],"prefix":"10.1007","volume":"42","author":[{"given":"V K","family":"MANUPATI","sequence":"first","affiliation":[]},{"given":"G","family":"RAJYALAKSHMI","sequence":"additional","affiliation":[]},{"given":"FELIX T S","family":"CHAN","sequence":"additional","affiliation":[]},{"given":"J J","family":"THAKKAR","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"issue":"5","key":"611_CR1","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/S0305-0548(03)00038-8","volume":"31","author":"KC Ying","year":"2004","unstructured":"Ying K C and Liao C J 2004 An ant colony system for permutation flow-shop sequencing.\u00a0Comput. Oper. Res.\u00a031(5): 791\u2013801","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"611_CR2","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Ng C T, Cheng T E and Kovalyov M Y 2008 A survey of scheduling problems with setup times or costs.\u00a0Eur. J. Oper. Res. 187(3): 985\u20131032","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"611_CR3","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1111\/j.1540-5915.1988.tb00258.x","volume":"19","author":"JO Frendewey","year":"1988","unstructured":"Frendewey J O and Sumichrast R T 1988 Scheduling parallel processors with setup cost and resource limitations. Decision Sci. 19(1): 138\u2013146","journal-title":"Decision Sci."},{"issue":"3","key":"611_CR4","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0305-0548(02)00198-3","volume":"31","author":"U Blidgue","year":"2004","unstructured":"Blidgue U, Kirac F, Kurtulan M and Pekgun P 2004 A tabu search algorithm for parallel machine total tardiness problem. Comput. Oper. Res. 31(3): 397\u2013414","journal-title":"Comput. Oper. Res."},{"issue":"1\u20134","key":"611_CR5","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00170-010-2824-y","volume":"53","author":"SW Lin","year":"2011","unstructured":"Lin S W, Lu C C and Ying K C 2011 Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints. Int. J. Adv. Manuf. Technol. 53(1\u20134): 353\u2013361","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"6","key":"611_CR6","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/j.cor.2010.08.018","volume":"38","author":"YK Lin","year":"2011","unstructured":"Lin Y K, Pfund M E and Fowler J\u00a0W 2011 Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems.\u00a0Comput. Oper. Res. 38(6): 901\u2013916","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"611_CR7","doi-asserted-by":"publisher","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 and Sassani F 2009 Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints.\u00a0Comput. Oper. Res.\u00a036(12): 3224\u20133230","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"611_CR8","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","volume":"47","author":"TCE Cheng","year":"1990","unstructured":"Cheng T C E and Sin C C S 1990 A state of the art review of parallel-machine scheduling research. Eur. J. Oper. Res. 47(3): 271\u2013292","journal-title":"Eur. J. Oper. Res."},{"key":"611_CR9","doi-asserted-by":"publisher","unstructured":"Santos F Charrua, Francisco Brojo and Pedro M Vilarinho 2012 Lot sizing and scheduling in parallel uniform machines\u2014a case study. INTECH Open Access Publisher. doi:\n                    10.5772\/50975","DOI":"10.5772\/50975"},{"issue":"4","key":"611_CR10","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s12597-011-0059-9","volume":"48","author":"S Kamath","year":"2011","unstructured":"Kamath S 2011 Unrelated parallel machine scheduling\u2014perspectives and progress. OPSEARCH 48(4): 318\u2013334","journal-title":"OPSEARCH"},{"key":"611_CR11","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.ijpe.2014.12.001","volume":"161","author":"X Wang","year":"2015","unstructured":"Wang X and Cheng T C E 2015 A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint. Int. J. Prod. Econ. 161: 74\u201382","journal-title":"Int. J. Prod. Econ."},{"issue":"8","key":"611_CR12","doi-asserted-by":"publisher","first-page":"5551","DOI":"10.1016\/j.asoc.2011.05.005","volume":"11","author":"K Li","year":"2011","unstructured":"Li K, Shi Y, Yang S L and Cheng B Y 2011 Parallel machine scheduling problem to minimize the makespan with resource dependent processing times. Appl. Soft Comput. 11(8): 5551\u20135557","journal-title":"Appl. Soft Comput."},{"issue":"8","key":"611_CR13","doi-asserted-by":"publisher","first-page":"1995","DOI":"10.1016\/j.cor.2004.01.001","volume":"32","author":"D Cao","year":"2005","unstructured":"Cao D, Chen M and Wan G 2005 Parallel machine selection and job scheduling to minimize machine cost and job tardiness. Comput. Oper. Res. 32(8): 1995\u20132012","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"611_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2007.02.056","volume":"380","author":"M Gairing","year":"2007","unstructured":"Gairing M, Monien B and Woclaw A 2007 A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor. Comput. Sci. 380(1): 87\u201399","journal-title":"Theor. Comput. Sci."},{"key":"611_CR15","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1016\/j.cor.2006.07.015","volume":"35","author":"P Rocha","year":"2008","unstructured":"Rocha P, Ravetti M, Mateus G and Pardalos P 2008 Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Comput. Oper. Res. 35: 1250\u20131264","journal-title":"Comput. Oper. Res."},{"key":"611_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2010.03.030","volume":"207","author":"L Fanjul-Peyro","year":"2010","unstructured":"Fanjul-Peyro L and Ruiz R 2010 Iterated greedy local search methods for unrelated parallel machine scheduling. Eur. J. Oper. Res. 207: 55\u201369","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"611_CR17","first-page":"91","volume":"28","author":"Y Mehravaran","year":"2011","unstructured":"Mehravaran Y and Logendran R B 2011 Supply chain scheduling on unrelated-parallel machines. J. Chin. Inst. Ind. Eng. 28(2): 91\u2013101","journal-title":"J. Chin. Inst. Ind. Eng."},{"issue":"19","key":"611_CR18","doi-asserted-by":"publisher","first-page":"5841","DOI":"10.1080\/00207543.2014.920966","volume":"52","author":"D Yilmaz Eroglu","year":"2014","unstructured":"Yilmaz Eroglu D, Ozmutlu H C and Ozmutlu S 2014 Genetic algorithm with local search for the unrelated parallel machine scheduling problem with sequence-dependent set-up times.\u00a0Int. J. Prod. Res.\u00a052(19): 5841\u2013585","journal-title":"Int. J. Prod. Res."},{"issue":"19","key":"611_CR19","doi-asserted-by":"publisher","first-page":"4747","DOI":"10.1016\/j.apm.2014.03.022","volume":"38","author":"N Yin","year":"2014","unstructured":"Yin N, Kang L, Sun T C, Yue C and Wang X R 2014 Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times. Appl. Math. Model. 38(19): 4747\u20134755","journal-title":"Appl. Math. Model."},{"issue":"3","key":"611_CR20","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10696-012-9150-7","volume":"25","author":"IL Wang","year":"2013","unstructured":"Wang I L, Wang Y C and Chen C W 2013 Scheduling unrelated parallel machines in semiconductor manufacturing by problem reduction and local search heuristics.\u00a0Flex. Serv. Manuf. J.\u00a025(3): 343\u2013366","journal-title":"Flex. Serv. Manuf. J."},{"issue":"9\u201312","key":"611_CR21","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1007\/s00170-011-3653-3","volume":"60","author":"R Gokhale","year":"2012","unstructured":"Gokhale R, and Mathirajan M 2012 Scheduling identical parallel machines with machine eligibility restrictions to minimize total weighted flowtime in automobile gear manufacturing.\u00a0Int. J. Adv. Manuf. Technol.\u00a060(9\u201312): 1099\u20131110","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"611_CR22","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1016\/j.asoc.2010.03.003","volume":"11","author":"PC Chang","year":"2011","unstructured":"Chang P C and Chen S H 2011 Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times. Appl. Soft Comput. 11(1): 1263\u20131274","journal-title":"Appl. Soft Comput."},{"issue":"8","key":"611_CR23","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1080\/07408170304349","volume":"35","author":"GL Vairaktarakis","year":"2003","unstructured":"Vairaktarakis G L and Cai X 2003 The value of processing flexibility in multipurpose machines. IIE Trans. 35(8): 763\u2013774","journal-title":"IIE Trans."},{"issue":"1","key":"611_CR24","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.omega.2004.07.023","volume":"34","author":"JF Chen","year":"2006","unstructured":"Chen J F and Wu T H 2006 Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints. Omega 34(1): 81\u201389","journal-title":"Omega"},{"issue":"3","key":"611_CR25","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s00170-003-1622-1","volume":"26","author":"JF Chen","year":"2005","unstructured":"Chen J F 2005 Unrelated parallel machine scheduling with secondary resource constraints. Int. J. Adv. Manuf. Technol.\u00a026(3):285\u2013292","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"5\u20138","key":"611_CR26","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s00170-011-3419-y","volume":"58","author":"KC Ying","year":"2012","unstructured":"Ying K C, Lee Z J, Lu C C and Lin S W 2012 Metaheuristics for scheduling a no-wait flowshop manufacturing cell with sequence-dependent family setups. Int. J. Adv. Manuf. Technol.\u00a058(5\u20138): 671\u2013682","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"6","key":"611_CR27","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1080\/00207540802620779","volume":"48","author":"X Hu","year":"2010","unstructured":"Hu X, Bao J S and Jin Y 2010 Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions. Int. J. Prod. Res. 48(6): 1639\u20131651.","journal-title":"Int. J. Prod. Res."},{"issue":"6","key":"611_CR28","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1016\/j.cor.2010.07.007","volume":"39","author":"J Lamothe","year":"2011","unstructured":"Lamothe J, Marmier F, Dupuy M, Gaborit P and Dupont L 2011 Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints. Comput. Oper. Res. 39(6): 1236\u20131244","journal-title":"Comput. Oper. Res."},{"key":"611_CR29","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.cie.2014.09.006","volume":"77","author":"M Rambod","year":"2014","unstructured":"Rambod M and Rezaeian J 2014 Robust meta-heuristics implementation for unrelated parallel machines scheduling problem with rework processes and machine eligibility restrictions.\u00a0Comput. Ind. Eng.\u00a077: 15\u201328","journal-title":"Comput. Ind. Eng."},{"key":"611_CR30","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S and Meyarivan T 2002 A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6: 182\u2013197","journal-title":"IEEE Trans. Evol. Comput."},{"key":"611_CR31","volume-title":"Genetic algorithms in search optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg D E 1989 Genetic algorithms in search optimization and machine learning. New York: Addison-Wesley"},{"key":"611_CR32","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N and Deb K 1994 Multi-objective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2: 221\u2013248","journal-title":"Evol. Comput."},{"key":"611_CR33","unstructured":"Chen P C and Hwang Y K 1992 SANDROS: A motion planner with performance proportional to task difficulty. In: Proceedings of the International Conference on  Robotics and Automation, IEEE 1992, pp. 2346\u20132353"},{"issue":"1","key":"611_CR34","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0360-8352(97)00150-2","volume":"34","author":"R Cheng","year":"1998","unstructured":"Cheng R and Gen M 1998 Loop layout design problem in flexible manufacturing systems using genetic algorithms. Comput. Ind. Eng. 34(1): 53\u201361","journal-title":"Comput. Ind. Eng."},{"issue":"12","key":"611_CR35","doi-asserted-by":"publisher","first-page":"4750","DOI":"10.1016\/j.asoc.2013.07.029","volume":"13","author":"SA Torabi","year":"2013","unstructured":"Torabi S A, Sahebjamnia N, Mansouri S A and Bajestani M A 2013 A particle swarm optimization for a fuzzy multi-objective unrelated parallel machines scheduling problem. Appl. Soft. Comput. 13(12): 4750\u20134762","journal-title":"Appl. Soft. Comput."},{"issue":"3","key":"611_CR36","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"LA Zadeh","year":"1965","unstructured":"Zadeh LA (1965) Fuzzy sets. Inf. Control 8(3): 338\u2013353","journal-title":"Inf. Control"},{"key":"611_CR37","unstructured":"Kennedy J F, Kennedy J, Eberhart R C and Shi Y 2001 Swarm intelligence. Morgan Kaufmann, San Francisco"},{"issue":"1","key":"611_CR38","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"CR Reeves","year":"1995","unstructured":"Reeves C R 1995 A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22(1): 5\u201313","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"611_CR39","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.ejor.2005.06.067","volume":"177","author":"Y Huo","year":"2007","unstructured":"Huo Y, Leung J Y T and Zhao H 2007 Bi-criteria scheduling problems: number of tardy jobs and maximum weighted tardiness. Eur. J. Oper. Res. 177(1): 116\u2013134","journal-title":"Eur. J. Oper. Res."}],"container-title":["S\u0101dhan\u0101"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12046-017-0611-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12046-017-0611-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12046-017-0611-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,15]],"date-time":"2019-12-15T04:43:09Z","timestamp":1576384989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12046-017-0611-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,21]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["611"],"URL":"https:\/\/doi.org\/10.1007\/s12046-017-0611-2","relation":{},"ISSN":["0256-2499","0973-7677"],"issn-type":[{"value":"0256-2499","type":"print"},{"value":"0973-7677","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,21]]},"assertion":[{"value":"26 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2016","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}