{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T01:36:41Z","timestamp":1778549801707,"version":"3.51.4"},"reference-count":92,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T00:00:00Z","timestamp":1607385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T00:00:00Z","timestamp":1607385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002326","name":"University of Stirling","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002326","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2021,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Parallel machine scheduling is one of the most common studied problems in recent years, however, this classic optimization problem has to achieve two conflicting objectives, i.e. minimizing the total tardiness and minimizing the total wastes, if the scheduling is done in the context of plastic injection industry where jobs are splitting and molds are important constraints. This paper proposes a mathematical model for scheduling parallel machines with splitting jobs and resource constraints. Two minimization objectives - the total tardiness and the number of waste - are considered, simultaneously. The obtained model is a bi-objective integer linear programming model that is shown to be of NP-hard class optimization problems. In this paper, a novel Multi-Objective Volleyball Premier League (MOVPL) algorithm is presented for solving the aforementioned problem. This algorithm uses the crowding distance concept used in NSGA-II as an extension of the Volleyball Premier League (VPL) that we recently introduced. Furthermore, the results are compared with six multi-objective metaheuristic algorithms of MOPSO, NSGA-II, MOGWO, MOALO, MOEA\/D, and SPEA2. Using five standard metrics and ten test problems, the performance of the Pareto-based algorithms was investigated. The results demonstrate that in general, the proposed algorithm has supremacy than the other four algorithms.<\/jats:p>","DOI":"10.1007\/s10489-020-02027-1","type":"journal-article","created":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T20:06:01Z","timestamp":1607457961000},"page":"4143-4161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A multi objective volleyball premier league algorithm for green scheduling identical parallel machines with splitting jobs"],"prefix":"10.1007","volume":"51","author":[{"given":"Khodakaram","family":"Salimifard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6758-0084","authenticated-orcid":false,"given":"Jingpeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davood","family":"Mohammadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Moghdani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,8]]},"reference":[{"key":"2027_CR1","unstructured":"Pinedo ML (2008) Scheduling: theory, algorithms, and systems, Third edn. Original edition published by Prentice Hall, New York, p 671"},{"key":"2027_CR2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Kan AR, Brucker P (1977) Complexity of machine scheduling problems. Ann Discrete Math 1:343\u2013362","journal-title":"Ann Discrete Math"},{"issue":"6","key":"2027_CR3","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1287\/opre.42.6.1025","volume":"42","author":"C Koulamas","year":"1994","unstructured":"Koulamas C (1994) The total tardiness problem: review and extensions. Oper Res 42(6):1025\u20131041","journal-title":"Oper Res"},{"issue":"3","key":"2027_CR4","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 JY-T (1990) Minimizing total tardiness on one machine is NP-hard. Math Oper Res 15(3):483\u2013495","journal-title":"Math Oper Res"},{"key":"2027_CR5","doi-asserted-by":"crossref","unstructured":"Lawler EL, Lenstra JK, Kan AR (1982) Recent developments in deterministic sequencing and scheduling: a survey, In Deterministic and stochastic scheduling. Springer, pp 35\u201373","DOI":"10.1007\/978-94-009-7801-0_3"},{"issue":"1","key":"2027_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/(SICI)1520-6750(199702)44:1<109::AID-NAV7>3.0.CO;2-E","volume":"44","author":"C Koulamas","year":"1997","unstructured":"Koulamas C (1997) Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem. Nav Res Logist (NRL) 44(1):109\u2013125","journal-title":"Nav Res Logist (NRL)"},{"issue":"1","key":"2027_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/05695557408974926","volume":"6","author":"SE Elmaghraby","year":"1974","unstructured":"Elmaghraby SE, Park SH (1974) Scheduling jobs on a number of identical machines. AIIE Transac 6(1):1\u201313","journal-title":"AIIE Transac"},{"issue":"1977","key":"2027_CR8","first-page":"382","volume":"17","author":"J Barnes","year":"1977","unstructured":"Barnes J, Brennan J (1977) An improved algorithm for independent jobs to reduce the mean finishing time. AIIE Transac 17(1977):382\u2013387","journal-title":"AIIE Transac"},{"issue":"3","key":"2027_CR9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0925-5273(01)00175-X","volume":"76","author":"F Yalaoui","year":"2002","unstructured":"Yalaoui F, Chu C (2002) Parallel machine scheduling to minimize total tardiness. Int J Prod Econ 76(3):265\u2013279","journal-title":"Int J Prod Econ"},{"issue":"2","key":"2027_CR10","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1287\/mnsc.11.2.280","volume":"11","author":"EL Lawler","year":"1964","unstructured":"Lawler EL (1964) On scheduling problems with deferral costs. Manag Sci 11(2):280\u2013288","journal-title":"Manag Sci"},{"issue":"3","key":"2027_CR11","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1287\/mnsc.11.3.460","volume":"11","author":"JG Root","year":"1965","unstructured":"Root JG (1965) Scheduling with deadlines and loss functions on k parallel machines. Manag Sci 11(3):460\u2013475","journal-title":"Manag Sci"},{"issue":"1","key":"2027_CR12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","volume":"16","author":"AAB Pritsker","year":"1969","unstructured":"Pritsker AAB, Waiters LJ, Wolfe PM (1969) Multiproject scheduling with limited resources: a zero-one programming approach. Manag Sci 16(1):93\u2013108","journal-title":"Manag Sci"},{"issue":"7","key":"2027_CR13","doi-asserted-by":"crossref","first-page":"1652","DOI":"10.1016\/j.cor.2011.09.019","volume":"39","author":"M Ranjbar","year":"2012","unstructured":"Ranjbar M, Davari M, Leus R (2012) Two branch-and-bound algorithms for the robust parallel machine scheduling problem. Comput Oper Res 39(7):1652\u20131660","journal-title":"Comput Oper Res"},{"key":"2027_CR14","unstructured":"Figielska E (2013) An Ant Colony Optimization Algorithm for Scheduling Parallel Machines with Sequence-Dependent Setup Costs, Zeszyty Naukowe Warszawskiej Wy\u017cszej Szko\u0142y Informatyki, no. 9, pp 15\u201326"},{"issue":"1\u20134","key":"2027_CR15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/B:ANOR.0000030685.31167.11","volume":"129","author":"Z-L Chen","year":"2004","unstructured":"Chen Z-L (2004) Simultaneous job scheduling and resource allocation on parallel machines. Ann Oper Res 129(1\u20134):135\u2013153","journal-title":"Ann Oper Res"},{"issue":"2","key":"2027_CR16","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/j.cie.2012.03.018","volume":"63","author":"EB Edis","year":"2012","unstructured":"Edis EB, Oguz C (2012) Parallel machine scheduling with flexible resources. Comput Ind Eng 63(2):433\u2013447","journal-title":"Comput Ind Eng"},{"issue":"4","key":"2027_CR17","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1016\/j.cie.2012.05.003","volume":"63","author":"W-C Lee","year":"2012","unstructured":"Lee W-C, Chuang M-C, Yeh W-C (2012) Uniform parallel-machine scheduling to minimize makespan with position-based learning curves. Comput Ind Eng 63(4):813\u2013818","journal-title":"Comput Ind Eng"},{"key":"2027_CR18","first-page":"20","volume":"5","author":"E Montagne","year":"1969","unstructured":"Montagne E (1969) Sequencing with time delay costs, Industrial Engineering Research Bulletin. Arizona State Univ 5:20\u201331","journal-title":"Arizona State Univ"},{"issue":"3","key":"2027_CR19","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/05695557108974812","volume":"3","author":"L Wilkerson","year":"1971","unstructured":"Wilkerson L, Irwin J (1971) An improved method for scheduling independent tasks. AIIE Transac 3(3):239\u2013245","journal-title":"AIIE Transac"},{"key":"2027_CR20","unstructured":"Morton TE, Rachamadugu RM, Vopsalainen A (1984) Accurate myopic heuristics for tardiness scheduling"},{"issue":"3","key":"2027_CR21","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1002\/1520-6750(199106)38:3<367::AID-NAV3220380307>3.0.CO;2-I","volume":"38","author":"JC Ho","year":"1991","unstructured":"Ho JC, Chang YL (1991) Heuristics for minimizing mean tardiness for m parallel machines. Nav Res Logist (NRL) 38(3):367\u2013381","journal-title":"Nav Res Logist (NRL)"},{"issue":"12","key":"2027_CR22","doi-asserted-by":"crossref","first-page":"1208","DOI":"10.1287\/mnsc.25.12.1208","volume":"25","author":"A Dogramaci","year":"1979","unstructured":"Dogramaci A, Surkis J (1979) Evaluation of a heuristic for scheduling independent jobs on parallel identical processors. Manag Sci 25(12):1208\u20131216","journal-title":"Manag Sci"},{"key":"2027_CR23","unstructured":"Chen K, Wong J, Ho J (1997) A heuristic algorithm to minimize tardiness for parallel machines, In Proceedings of ISMM International Conference, pp 118\u2013121"},{"issue":"1","key":"2027_CR24","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0272-6963(82)90020-1","volume":"3","author":"KR Baker","year":"1982","unstructured":"Baker KR, Bertrand JWM (1982) A dynamic priority rule for scheduling against due-dates. J Oper Manag 3(1):37\u201342","journal-title":"J Oper Manag"},{"issue":"1","key":"2027_CR25","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s41066-018-0085-6","volume":"4","author":"T Garai","year":"2019","unstructured":"Garai T, Chakraborty D, Roy TK (2019) A fuzzy rough multi-objective multi-item inventory model with both stock-dependent demand and holding cost rate. Granular Comput 4(1):71\u201388","journal-title":"Granular Comput"},{"issue":"1","key":"2027_CR26","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s41066-018-0094-5","volume":"4","author":"S Maity","year":"2019","unstructured":"Maity S, Roy A, Maiti M (2019) A rough multi-objective genetic algorithm for uncertain constrained multi-objective solid travelling salesman problem. Granular Comput 4(1):125\u2013142","journal-title":"Granular Comput"},{"issue":"1","key":"2027_CR27","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s41066-018-0129-y","volume":"5","author":"S Gupta","year":"2020","unstructured":"Gupta S, Ali I, Chaudhary S (2020) Multi-objective capacitated transportation: a problem of parameters estimation, goodness of fit and optimization. Granular Comput 5(1):119\u2013134","journal-title":"Granular Comput"},{"issue":"1","key":"2027_CR28","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10107-014-0831-8","volume":"154","author":"J Correa","year":"2015","unstructured":"Correa J et al (2015) Strong LP formulations for scheduling splittable jobs on unrelated machines. Math Program 154(1):305\u2013328","journal-title":"Math Program"},{"key":"2027_CR29","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.cor.2013.09.016","volume":"43","author":"J Tao","year":"2014","unstructured":"Tao J (2014) A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time. Comput Oper Res 43:215\u2013224","journal-title":"Comput Oper Res"},{"issue":"sup1","key":"2027_CR30","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1080\/18756891.2013.853932","volume":"7","author":"Y Ouazenea","year":"2014","unstructured":"Ouazenea Y, Yalaouia F, Chehadea H, Yalaoui A (2014) Workload balancing in identical parallel machine scheduling using a mathematical programming method. Int J Compu Int Syst 7(sup1):58\u201367","journal-title":"Int J Compu Int Syst"},{"issue":"20","key":"2027_CR31","doi-asserted-by":"crossref","first-page":"4799","DOI":"10.1016\/j.ins.2011.06.010","volume":"181","author":"C-J Hsu","year":"2011","unstructured":"Hsu C-J, Cheng TCE, Yang D-L (2011) Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time. Inf Sci 181(20):4799\u20134803","journal-title":"Inf Sci"},{"key":"2027_CR32","doi-asserted-by":"crossref","unstructured":"Baker RK, Trietsch D (2009) Principles of sequencing and scheduling. John Wiley & Sons, Inc","DOI":"10.1002\/9780470451793"},{"issue":"4","key":"2027_CR33","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1016\/j.cie.2010.02.012","volume":"58","author":"Y Unlu","year":"2010","unstructured":"Unlu Y, Mason S (2010) Evaluation of mixed integer programming formulations for nonpreemptive parallel machine scheduling problems. Comput Ind Eng 58(4):785\u2013800","journal-title":"Comput Ind Eng"},{"issue":"4","key":"2027_CR34","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1287\/opre.44.4.617","volume":"44","author":"P Serafini","year":"1996","unstructured":"Serafini P (1996) Scheduling jobs on several machines with the job splitting property. Oper Res 44(4):617\u2013628","journal-title":"Oper Res"},{"issue":"1\u20133","key":"2027_CR35","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0166-218X(00)00176-1","volume":"103","author":"W Xing","year":"2000","unstructured":"Xing W, Zhang J (2000) Parallel machine scheduling with splitting jobs. Discret Appl Math 103(1\u20133):259\u2013269","journal-title":"Discret Appl Math"},{"issue":"8","key":"2027_CR36","doi-asserted-by":"crossref","first-page":"4117","DOI":"10.1016\/j.apm.2011.02.035","volume":"35","author":"\u0130 Sar\u0131\u00e7i\u00e7ek","year":"2011","unstructured":"Sar\u0131\u00e7i\u00e7ek \u0130, \u00c7elik C (2011) Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness. Appl Math Model 35(8):4117\u20134126","journal-title":"Appl Math Model"},{"issue":"1","key":"2027_CR37","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s00170-011-3489-x","volume":"59","author":"T Park","year":"2012","unstructured":"Park T, Lee T, Ouk Kim C (2012) Due-date scheduling on parallel machines with job splitting and sequence-dependent major\/minor setup times. Int J Adv Manuf Technol 59(1):325\u2013333","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"2027_CR38","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1016\/j.cor.2006.04.006","volume":"35","author":"S-O Shim","year":"2008","unstructured":"Shim S-O, Kim Y-D (2008) A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property. Comput Oper Res 35(3):863\u2013875","journal-title":"Comput Oper Res"},{"issue":"21","key":"2027_CR39","doi-asserted-by":"crossref","first-page":"4531","DOI":"10.1080\/00207540410001720745","volume":"42","author":"Y Kim","year":"2004","unstructured":"Kim Y, Shim S, Kim S, Choi Y, Yoon H (2004) Parallel machine scheduling considering a job-splitting property. Int J Prod Res 42(21):4531\u20134546","journal-title":"Int J Prod Res"},{"issue":"2","key":"2027_CR40","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1080\/07408170304382","volume":"35","author":"F Yalaoui","year":"2003","unstructured":"Yalaoui F, Chu C (2003) An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times. IIE Trans 35(2):183\u2013190","journal-title":"IIE Trans"},{"issue":"2","key":"2027_CR41","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0360-8352(00)00048-6","volume":"38","author":"Z Zhu","year":"2000","unstructured":"Zhu Z, Heady RB (2000) Minimizing the sum of earliness\/tardiness in multi-machine scheduling: a mixed integer programming approach. Comput Ind Eng 38(2):297\u2013305","journal-title":"Comput Ind Eng"},{"issue":"3","key":"2027_CR42","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1057\/palgrave.jors.2602141","volume":"58","author":"S-O Shim","year":"2007","unstructured":"Shim S-O, Kim Y-D (2007) Minimizing Total tardiness in an unrelated parallel-machine scheduling problem. J Oper Res Soc 58(3):346\u2013354","journal-title":"J Oper Res Soc"},{"issue":"4","key":"2027_CR43","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1080\/07408170490279598","volume":"36","author":"R Logendran","year":"2004","unstructured":"Logendran R, Subur F (2004) Unrelated parallel machine scheduling with job splitting. IIE Trans 36(4):359\u2013372","journal-title":"IIE Trans"},{"issue":"11","key":"2027_CR44","doi-asserted-by":"crossref","first-page":"3420","DOI":"10.1016\/j.cor.2006.02.006","volume":"34","author":"R Logendran","year":"2007","unstructured":"Logendran R, McDonell B, Smucker B (2007) Scheduling unrelated parallel machines with sequence-dependent setups. Comput Oper Res 34(11):3420\u20133438","journal-title":"Comput Oper Res"},{"issue":"12","key":"2027_CR45","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1016\/S0305-0548(02)00105-3","volume":"30","author":"C-F Liaw","year":"2003","unstructured":"Liaw C-F, Lin Y-K, Cheng C-Y (2003) Scheduling unrelated parallel machines to minimize total weighted tardiness. Comput Oper Res 30(12):1777\u20131789","journal-title":"Comput Oper Res"},{"issue":"5","key":"2027_CR46","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1016\/j.cor.2012.12.007","volume":"40","author":"W-L Wang","year":"2013","unstructured":"Wang W-L, Wang H-Y, Zhao Y-W, Zhang L-P, Xu X-L (2013) Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm. Comput Oper Res 40(5):1196\u20131206","journal-title":"Comput Oper Res"},{"issue":"1","key":"2027_CR47","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.omega.2004.07.023","volume":"34","author":"J-F Chen","year":"2006","unstructured":"Chen J-F, 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":"2027_CR48","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1016\/j.ejor.2011.01.011","volume":"211","author":"E Vallada","year":"2011","unstructured":"Vallada E, Ruiz R (2011) A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur J Oper Res 211(3):612\u2013622","journal-title":"Eur J Oper Res"},{"issue":"4","key":"2027_CR49","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1016\/j.cor.2006.07.015","volume":"35","author":"PL Rocha","year":"2008","unstructured":"Rocha PL, Ravetti MG, Mateus GR, Pardalos MP (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":"6","key":"2027_CR50","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1016\/j.cor.2010.08.018","volume":"38","author":"YK Lin","year":"2011","unstructured":"Lin YK, Pfund ME, Fowler JW (2011) Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems. Comput Oper Res 38(6):901\u2013916","journal-title":"Comput Oper Res"},{"issue":"7","key":"2027_CR51","doi-asserted-by":"crossref","first-page":"1745","DOI":"10.1016\/j.cor.2011.10.012","volume":"39","author":"L Fanjul-Peyro","year":"2012","unstructured":"Fanjul-Peyro L, Ruiz R (2012) Scheduling unrelated parallel machines with optional machines and jobs selection. Comput Oper Res 39(7):1745\u20131753","journal-title":"Comput Oper Res"},{"key":"2027_CR52","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.cie.2016.05.001","volume":"97","author":"C Wang","year":"2016","unstructured":"Wang C, Liu C, Zhang Z-h, Zheng L (2016) Minimizing the total completion time for parallel machine scheduling with job splitting and learning. Comput Ind Eng 97:170\u2013182","journal-title":"Comput Ind Eng"},{"issue":"4","key":"2027_CR53","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1080\/00207543.2015.1047981","volume":"54","author":"S-W Lin","year":"2016","unstructured":"Lin S-W, Ying K-C, Wu W-J, Chiang Y-I (2016) Multi-objective unrelated parallel machine scheduling: a Tabu-enhanced iterated Pareto greedy algorithm. Int J Prod Res 54(4):1110\u20131121","journal-title":"Int J Prod Res"},{"key":"2027_CR54","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/978-3-319-23350-5_11","volume-title":"Metaheuristics for production systems","author":"AFB Lara","year":"2016","unstructured":"Lara AFB, Yalaoui F, Dugardin F, Entzmann F (2016) An efficient heuristic to minimize the Total tardiness in the parallel machines scheduling problem. In: Talbi E-G, Yalaoui F, Amodeo L (eds) Metaheuristics for production systems, vol 60. Springer International Publishing, Cham, pp 241\u2013262"},{"key":"2027_CR55","doi-asserted-by":"crossref","unstructured":"Shahvari O, Logendran R (2016) An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes. Comput Oper Res:154\u2013176","DOI":"10.1016\/j.cor.2016.07.021"},{"key":"2027_CR56","doi-asserted-by":"crossref","unstructured":"Yin Y, Wang Y, Cheng TCE, Liu W, Li J (2016) Parallel-machine scheduling of deteriorating jobs with potential machine disruptions, Omega, vol. In Press","DOI":"10.1016\/j.omega.2016.07.006"},{"issue":"2","key":"2027_CR57","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1016\/j.ejor.2014.12.002","volume":"243","author":"A Mensendiek","year":"2015","unstructured":"Mensendiek A, Gupta JND, Herrmann J (2015) Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness. Eur J Oper Res 243(2):514\u2013522","journal-title":"Eur J Oper Res"},{"issue":"4","key":"2027_CR58","doi-asserted-by":"crossref","first-page":"1542","DOI":"10.1057\/jors.2014.122","volume":"66","author":"J-Y Lee","year":"2015","unstructured":"Lee J-Y, Kim Y-D (2015) A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint. J Oper Res Soc 66(4):1542\u20131554","journal-title":"J Oper Res Soc"},{"key":"2027_CR59","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.cor.2013.08.007","volume":"41","author":"B Mora","year":"2014","unstructured":"Mora B, Mosheiov G (2014) Batch scheduling of identical jobs with controllable processing times. Comput Oper Res 41:115\u2013124","journal-title":"Comput Oper Res"},{"issue":"12","key":"2027_CR60","doi-asserted-by":"crossref","first-page":"2983","DOI":"10.1016\/j.cor.2013.06.016","volume":"40","author":"X Lia","year":"2013","unstructured":"Lia X, Huanga Y, Tanb Q, Chenc H (2013) Scheduling unrelated parallel batch processing machines with non-identical job sizes. Comput Oper Res 40(12):2983\u20132990","journal-title":"Comput Oper Res"},{"key":"2027_CR61","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ijpe.2016.05.014","volume":"179","author":"S Zhoua","year":"2016","unstructured":"Zhoua S, Liub M, Chenc H, Li X (2016) An effective discrete differential evolution algorithm for scheduling uniform parallel batch processing machines with non-identical capacities and arbitrary job sizes. Int J Prod Econ 179:1\u201311","journal-title":"Int J Prod Econ"},{"issue":"3","key":"2027_CR62","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/j.ejor.2015.06.051","volume":"247","author":"K Li","year":"2015","unstructured":"Li K, Jia Z-h, Leung JYT (2015) Integrated production and delivery on parallel batching machines. Eur J Oper Res 247(3):755\u2013763","journal-title":"Eur J Oper Res"},{"issue":"3","key":"2027_CR63","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1007\/s40314-015-0298-0","volume":"36","author":"A Aalaei","year":"2017","unstructured":"Aalaei A, Kayvanfar V, Davoudpour H (2017) A multi-objective optimization for preemptive identical parallel machines scheduling problem. Comput Appl Math 36(3):1367\u20131387","journal-title":"Comput Appl Math"},{"issue":"20","key":"2027_CR64","doi-asserted-by":"crossref","first-page":"5942","DOI":"10.1080\/00207543.2017.1308572","volume":"55","author":"L-L Fu","year":"2017","unstructured":"Fu L-L, Aloulou MA, Triki C (2017) Integrated production scheduling and vehicle routing problem with job splitting and delivery time windows. Int J Prod Res 55(20):5942\u20135957","journal-title":"Int J Prod Res"},{"issue":"3","key":"2027_CR65","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1016\/j.ejor.2016.08.008","volume":"257","author":"AC Beez\u00e3o","year":"2017","unstructured":"Beez\u00e3o AC, Cordeau J-F, Laporte G, Yanasse HH (2017) Scheduling identical parallel machines with tooling constraints. Eur J Oper Res 257(3):834\u2013844","journal-title":"Eur J Oper Res"},{"key":"2027_CR66","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.omega.2018.01.001","volume":"82","author":"X Wu","year":"2019","unstructured":"Wu X, Che A (2019) A memetic differential evolution algorithm for energy-efficient parallel machine scheduling. Omega 82:155\u2013165","journal-title":"Omega"},{"key":"2027_CR67","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/j.cor.2017.02.011","volume":"90","author":"C Liu","year":"2018","unstructured":"Liu C, Wang C, Zhang Z-h, Zheng L (2018) Scheduling with job-splitting considering learning and the vital-few law. Comput Oper Res 90:264\u2013274","journal-title":"Comput Oper Res"},{"key":"2027_CR68","doi-asserted-by":"crossref","unstructured":"Kim H, Lee J (2018) Uniform Parallel Machine Scheduling with Dedicated Machines, Job Splitting and Setup Resources, In 2018 IEEE 14th International Conference on Automation Science and Engineering (CASE), pp 661\u2013663","DOI":"10.1109\/COASE.2018.8560409"},{"key":"2027_CR69","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.jclepro.2019.01.166","volume":"217","author":"H Safarzadeh","year":"2019","unstructured":"Safarzadeh H, Niaki STA (2019) Bi-objective green scheduling in uniform parallel machine environments. J Clean Prod 217:559\u2013572","journal-title":"J Clean Prod"},{"key":"2027_CR70","doi-asserted-by":"crossref","unstructured":"Salimifard AAK, Mohammadi D, Moghdani R (2019) Green Fuzzy Parallel Machine Scheduling with Sequence-Dependent Setup in the Plastic Molding Industry. Asian J Manag Sci Appl, in press","DOI":"10.1504\/AJMSA.2019.101423"},{"issue":"1","key":"2027_CR71","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.ijpe.2013.04.053","volume":"145","author":"R Xu","year":"2013","unstructured":"Xu R, Chen H, Li X (2013) A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system. Int J Prod Econ 145(1):371\u2013386","journal-title":"Int J Prod Econ"},{"key":"2027_CR72","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.ijpe.2014.06.019","volume":"156","author":"J-Q Wang","year":"2014","unstructured":"Wang J-Q, Leung J (2014) Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan. Int J Prod Econ 156:325\u2013331","journal-title":"Int J Prod Econ"},{"issue":"3","key":"2027_CR73","doi-asserted-by":"crossref","first-page":"1508","DOI":"10.1016\/j.ejor.2005.11.001","volume":"176","author":"MJP Lopes","year":"2007","unstructured":"Lopes MJP, de Carvalho JMV (2007) A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. Eur J Oper Res 176(3):1508\u20131527","journal-title":"Eur J Oper Res"},{"key":"2027_CR74","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.procs.2017.09.140","volume":"115","author":"R Anand","year":"2017","unstructured":"Anand R, Kumar V (2017) Reliable Back-up Facility in Distribution Network. Prog Comput Sci 115:312\u2013321","journal-title":"Prog Comput Sci"},{"key":"2027_CR75","doi-asserted-by":"crossref","unstructured":"Anand R, Kumar V (2017) Firefly algorithm for reliable protection in distribution networks, In 2017 International Conference on Intelligent Computing, Instrumentation and Control Technologies (ICICICT), pp 1164\u20131172","DOI":"10.1109\/ICICICT1.2017.8342735"},{"key":"2027_CR76","doi-asserted-by":"crossref","unstructured":"Aggarwal D, Chahar V, Girdhar A (2017) Firefly algorithm for the vehicle routing problem with time windows","DOI":"10.1109\/ICICICT1.2017.8342810"},{"key":"2027_CR77","doi-asserted-by":"crossref","unstructured":"Aggarwal D, Kumar V (2019) Performance evaluation of distance metrics on firefly algorithm for VRP with time windows, Int. J Inf Technol, 11\/29","DOI":"10.1007\/s41870-019-00387-7"},{"issue":"2","key":"2027_CR78","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1007\/s10489-018-1285-0","volume":"49","author":"H Zhu","year":"2019","unstructured":"Zhu H, Qi X, Chen F, He X, Chen L, Zhang Z (2019) Quantum-inspired cuckoo co-search algorithm for no-wait flow shop scheduling. Appl Intell 49(2):791\u2013803","journal-title":"Appl Intell"},{"issue":"6","key":"2027_CR79","doi-asserted-by":"crossref","first-page":"1423","DOI":"10.1007\/s10489-017-0993-1","volume":"48","author":"M Gaham","year":"2018","unstructured":"Gaham M, Bouzouia B, Achour N (2018) An effective operations permutation-based discrete harmony search approach for the flexible job shop scheduling problem with makespan criterion. Appl Intell 48(6):1423\u20131441","journal-title":"Appl Intell"},{"issue":"1","key":"2027_CR80","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/B:APIN.0000027769.48098.91","volume":"21","author":"BM Ombuki","year":"2004","unstructured":"Ombuki BM, Ventresca M (2004) Local Search Genetic Algorithms for the Job Shop Scheduling Problem. Appl Intell 21(1):99\u2013109","journal-title":"Appl Intell"},{"issue":"3","key":"2027_CR81","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1007\/s10489-016-0786-y","volume":"45","author":"HE Nouri","year":"2016","unstructured":"Nouri HE, Driss OB, Gh\u00e9dira K (2016) Hybrid metaheuristics for scheduling of machines and transport robots in job shop environment. Appl Intell 45(3):808\u2013828","journal-title":"Appl Intell"},{"key":"2027_CR82","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.asoc.2017.11.043","volume":"64","author":"R Moghdani","year":"2018","unstructured":"Moghdani R, Salimifard K (2018) Volleyball Premier League Algorithm. Appl Soft Comput 64:161\u2013185","journal-title":"Appl Soft Comput"},{"issue":"3","key":"2027_CR83","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1016\/j.ejor.2015.06.071","volume":"247","author":"Q Lin","year":"2015","unstructured":"Lin Q, Li J, Du Z, Chen J, Ming Z (2015) A novel multi-objective particle swarm optimization with multiple search strategies. Eur J Oper Res 247(3):732\u2013744","journal-title":"Eur J Oper Res"},{"issue":"7","key":"2027_CR84","doi-asserted-by":"crossref","first-page":"4948","DOI":"10.1016\/j.apm.2015.12.013","volume":"40","author":"V Hajipour","year":"2016","unstructured":"Hajipour V, Fattahi P, Tavana M, Di Caprio D (2016) Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics. Appl Math Model 40(7):4948\u20134969","journal-title":"Appl Math Model"},{"key":"2027_CR85","unstructured":"Coello CAC, Van Veldhuizen DA, Lamont GB (2007) Evolutionary algorithms for solving multi-objective problems. Springer"},{"key":"2027_CR86","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.cie.2016.07.008","volume":"99","author":"H Maghsoudlou","year":"2016","unstructured":"Maghsoudlou H, Kahag MR, Niaki STA, Pourvaziri H (2016) Bi-objective optimization of a three-echelon multi-server supply-chain problem in congested systems: Modeling and solution. Comput Ind Eng 99:41\u201362","journal-title":"Comput Ind Eng"},{"issue":"3","key":"2027_CR87","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/B:JMMA.0000038619.69509.bf","volume":"3","author":"J Li","year":"2004","unstructured":"Li J, Kwan RS (2004) A meta-heuristic with orthogonal experiment for the set covering problem. J Math Model Algorithms 3(3):263\u2013283","journal-title":"J Math Model Algorithms"},{"key":"2027_CR88","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.asoc.2015.02.044","volume":"32","author":"P Fattahi","year":"2015","unstructured":"Fattahi P, Hajipour V, Nobari A (2015) A bi-objective continuous review inventory control model: Pareto-based meta-heuristic algorithms. Appl Soft Comput 32:211\u2013223","journal-title":"Appl Soft Comput"},{"key":"2027_CR89","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.asoc.2016.02.014","volume":"43","author":"SM Mousavi","year":"2016","unstructured":"Mousavi SM, Sadeghi J, Niaki STA, Tavana M (2016) A bi-objective inventory optimization model under inflation and discount using tuned Pareto-based algorithms: NSGA-II, NRGA, and MOPSO. Appl Soft Comput 43:57\u201372","journal-title":"Appl Soft Comput"},{"issue":"4","key":"2027_CR90","doi-asserted-by":"crossref","first-page":"2241","DOI":"10.1016\/j.apm.2012.05.019","volume":"37","author":"SM Mousavi","year":"2013","unstructured":"Mousavi SM, Hajipour V, Niaki STA, Alikar N (2013) Optimizing multi-item multi-period inventory control system with discounted cash flow and inflation: two calibrated meta-heuristic algorithms. Appl Math Model 37(4):2241\u20132256","journal-title":"Appl Math Model"},{"key":"2027_CR91","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey Wolf Optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"issue":"1","key":"2027_CR92","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10489-016-0825-8","volume":"46","author":"S Mirjalili","year":"2017","unstructured":"Mirjalili S, Jangir P, Saremi S (2017) Multi-objective ant lion optimizer: a multi-objective optimization algorithm for solving engineering problems. Appl Intell 46(1):79\u201395","journal-title":"Appl Intell"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-02027-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-02027-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-02027-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T08:32:35Z","timestamp":1624005155000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-02027-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,8]]},"references-count":92,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["2027"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-02027-1","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12,8]]},"assertion":[{"value":"16 October 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}