{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:14:51Z","timestamp":1775078091208,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["DPI2017-85343-P"],"award-info":[{"award-number":["DPI2017-85343-P"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006382","name":"Universidad de Oviedo","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006382","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper explores the characteristics of solutions when scheduling jobs in a shop with parallel machines. Three classical objective functions were considered: makespan, total completion time, and total tardiness. These three criteria were combined in pairs, resulting in three bi-objective formulations. These formulations were solved using the \u03b5-constraint method to obtain a Pareto frontier for each pair. The objective of the research is to evaluate the Pareto set of efficient schedules to characterize the solution sets. The characterization of the solutions sets is based on two performance metrics: the span of the objective functions' values for the points in the frontier and their closeness to the ideal point. Results that consider four experimental factors indicate that when the makespan is one of the objective functions, the range of the processing times among jobs has a significant influence on the characteristics of the Pareto frontier. Simultaneously, the slack of due dates is the most relevant factor when total tardiness is considered.<\/jats:p>","DOI":"10.1007\/s12351-021-00684-9","type":"journal-article","created":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T13:04:45Z","timestamp":1641819885000},"page":"4585-4605","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Scheduling in parallel machines with two objectives: analysis of factors that influence the Pareto frontier"],"prefix":"10.1007","volume":"22","author":[{"given":"Julio","family":"Mar-Ortiz","sequence":"first","affiliation":[]},{"given":"Alex J.","family":"Ruiz Torres","sequence":"additional","affiliation":[]},{"given":"Belarmino","family":"Adenso-D\u00edaz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,10]]},"reference":[{"key":"684_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.cor.2016.08.015","volume":"78","author":"JEC Arroyo","year":"2017","unstructured":"Arroyo JEC, Leung JYT (2017) Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times. Comput Oper Res 78:117\u2013128","journal-title":"Comput Oper Res"},{"issue":"1","key":"684_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10845-014-0890-y","volume":"27","author":"J Behnamian","year":"2016","unstructured":"Behnamian J, Ghomi SF (2016) A survey of multi-factory scheduling. J Intell Manuf 27(1):231\u2013249","journal-title":"J Intell Manuf"},{"issue":"1","key":"684_CR3","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.ijpe.2008.04.011","volume":"115","author":"D Biskup","year":"2008","unstructured":"Biskup D, Herrmann J, Gupta JN (2008) Scheduling identical parallel machines to minimise total tardiness. Int J Prod Econ 115(1):134\u2013142","journal-title":"Int J Prod Econ"},{"issue":"4","key":"684_CR4","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10951-014-0397-6","volume":"19","author":"A Bitar","year":"2016","unstructured":"Bitar A, Dauz\u00e8re-P\u00e9r\u00e8s S, Yugma C, Roussel R (2016) A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing. J Sched 19(4):367\u2013376","journal-title":"J Sched"},{"key":"684_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmsy.2016.10.005","volume":"42","author":"CY Cheng","year":"2017","unstructured":"Cheng CY, Huang LW (2017) Minimizing total earliness and tardiness through unrelated parallel machine scheduling using distributed release time control. J Manuf Syst 42:1\u201310","journal-title":"J Manuf Syst"},{"key":"684_CR6","first-page":"125888","volume":"397","author":"F Della Croce","year":"2021","unstructured":"Della Croce F, T\u2019kindt V, Ploton O (2021) Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms. Appl Math Comput 397:125888","journal-title":"Appl Math Comput"},{"key":"684_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.cor.2018.10.016","volume":"103","author":"J Ding","year":"2019","unstructured":"Ding J, Shen L, L\u00fc Z, Peng B (2019) Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration. Comput Oper Res 103:35\u201345","journal-title":"Comput Oper Res"},{"issue":"3","key":"684_CR8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10957-008-9394-2","volume":"138","author":"M Ehrgott","year":"2008","unstructured":"Ehrgott M, Ruzika S (2008) Improved \u03b5-constraint method for multiobjective programming. J Optim Theo Appl 138(3):375\u2013396","journal-title":"J Optim Theo Appl"},{"issue":"1","key":"684_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/16M1066610","volume":"31","author":"L Epstein","year":"2017","unstructured":"Epstein L, Levin A, Soper AJ, Strusevich VA (2017) Power of preemption for minimizing total completion time on uniform parallel machines. SIAM J Discret Math 31(1):101\u2013123","journal-title":"SIAM J Discret Math"},{"issue":"2","key":"684_CR10","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1016\/j.apm.2008.01.010","volume":"33","author":"T Eren","year":"2009","unstructured":"Eren T (2009) A bicriteria parallel machine scheduling with a learning effect of setup and removal times. Appl Math Model 33(2):1141\u20131150","journal-title":"Appl Math Model"},{"issue":"1","key":"684_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ejor.2009.02.014","volume":"201","author":"FS Erenay","year":"2010","unstructured":"Erenay FS, Sabuncuoglu I, Toptal A, Tiwari MK (2010) New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs. Eur J Oper Res 201(1):89\u201398","journal-title":"Eur J Oper Res"},{"key":"684_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.jpdc.2018.05.008","volume":"133","author":"L Ghalami","year":"2018","unstructured":"Ghalami L, Grosu D (2018) Scheduling parallel identical machines to minimise makespan: a parallel approximation algorithm. J Parallel Distrib Comput 133:221\u2013231","journal-title":"J Parallel Distrib Comput"},{"key":"684_CR13","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.omega.2018.10.003","volume":"89","author":"P Guo","year":"2018","unstructured":"Guo P, Weidinger F, Boysen N (2018) Parallel machine scheduling with job synchronization to enable efficient material flows in hub terminals. Omega 89:110\u2013121","journal-title":"Omega"},{"issue":"2","key":"684_CR14","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/S0377-2217(99)00386-0","volume":"125","author":"JN Gupta","year":"2000","unstructured":"Gupta JN, Ruiz-Torres AJ (2000) Minimizing makespan subject to minimum total flow-time on identical parallel machines. Eur J Oper Res 125(2):370\u2013380","journal-title":"Eur J Oper Res"},{"issue":"9","key":"684_CR15","doi-asserted-by":"publisher","first-page":"2774","DOI":"10.1016\/j.cor.2005.10.018","volume":"34","author":"S Gurel","year":"2007","unstructured":"Gurel S, Akturk MS (2007) Scheduling parallel CNC machines with time\/cost trade-off considerations. Comput Oper Res 34(9):2774\u20132789","journal-title":"Comput Oper Res"},{"key":"684_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.cor.2013.08.003","volume":"41","author":"V Kayvanfar","year":"2014","unstructured":"Kayvanfar V, Komaki GM, Aalaei A, Zandieh M (2014) Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times. Comput Oper Res 41:31\u201343","journal-title":"Comput Oper Res"},{"issue":"1","key":"684_CR17","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1111\/itor.12386","volume":"26","author":"E Kieffer","year":"2019","unstructured":"Kieffer E, Danoy G, Bouvry P, Nagih A (2019) A new modeling approach for the biobjective exact optimization of satellite payload configuration. Int Trans Oper Res 26(1):180\u2013199","journal-title":"Int Trans Oper Res"},{"issue":"8","key":"684_CR18","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1080\/00207543.2020.1734682","volume":"59","author":"C Kusoncum","year":"2021","unstructured":"Kusoncum C, Sethanan K, Pitakaso R, Hartl RF (2021) Heuristics with novel approaches for cyclical multiple parallel machine scheduling in sugarcane unloading systems. Int J Prod Res 59(8):2479\u20132497","journal-title":"Int J Prod Res"},{"issue":"6","key":"684_CR19","doi-asserted-by":"publisher","first-page":"2292","DOI":"10.1080\/00207543.2017.1374571","volume":"56","author":"CH Lee","year":"2018","unstructured":"Lee CH (2018) A dispatching rule and a random iterated greedy metaheuristic for identical parallel machine scheduling to minimise total tardiness. Int J Prod Res 56(6):2292\u20132308","journal-title":"Int J Prod Res"},{"issue":"9\u201310","key":"684_CR20","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1007\/s00170-008-1770-4","volume":"43","author":"D Lei","year":"2009","unstructured":"Lei D (2009) Multi-objective production scheduling: a survey. Int J Adv Manuf Technol 43(9\u201310):926\u2013938","journal-title":"Int J Adv Manuf Technol"},{"issue":"10","key":"684_CR21","doi-asserted-by":"publisher","first-page":"1655","DOI":"10.1016\/S0305-0548(03)00113-8","volume":"31","author":"CH Lin","year":"2004","unstructured":"Lin CH, Liao CJ (2004) Makespan minimization subject to flowtime optimality on identical parallel machines. Comput Oper Res 31(10):1655\u20131666","journal-title":"Comput Oper Res"},{"key":"684_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-021-04043-x","author":"YK Lin","year":"2021","unstructured":"Lin YK, Yin TY (2021) Generating bicriteria schedules for correlated parallel machines involving tardy jobs and weighted completion time. Ann Op Res. https:\/\/doi.org\/10.1007\/s10479-021-04043-x","journal-title":"Ann Op Res"},{"issue":"2","key":"684_CR23","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ejor.2012.10.008","volume":"227","author":"YK Lin","year":"2013","unstructured":"Lin YK, Fowler JW, Pfund ME (2013) Multiple-objective heuristics for scheduling unrelated parallel machines. Eur J Oper Res 227(2):239\u2013253","journal-title":"Eur J Oper Res"},{"key":"684_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.08.005","author":"D Mecler","year":"2021","unstructured":"Mecler D, Abu-Marrul V, Martinelli R, Hoff A (2021) Iterated greedy algorithms for a complex parallel machine scheduling problem. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2021.08.005","journal-title":"Eur J Oper Res"},{"issue":"2","key":"684_CR25","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(2):193\u2013242","journal-title":"Asia-Pacific J Oper Res"},{"issue":"6","key":"684_CR26","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10951-010-0222-9","volume":"14","author":"L M\u00f6nch","year":"2011","unstructured":"M\u00f6nch L, Fowler JW, Dauzere-Peres S, Mason SJ, Rose O (2011) A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. J Sched 14(6):583\u2013599","journal-title":"J Sched"},{"issue":"1","key":"684_CR27","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s12351-016-0257-6","volume":"18","author":"SM Mousavi","year":"2018","unstructured":"Mousavi SM, Mahdavi I, Rezaeian J, Zandieh M (2018) An efficient bi-objective algorithm to solve re-entrant hybrid flow shop scheduling with learning effect and setup times. Oper Res Int J 18(1):123\u2013158","journal-title":"Oper Res Int J"},{"issue":"1","key":"684_CR28","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0377-2217(93)E0140-S","volume":"81","author":"A Nagar","year":"1995","unstructured":"Nagar A, Haddock J, Heragu S (1995) Multiple and bicriteria scheduling: a literature survey. Eur J Oper Res 81(1):88\u2013104","journal-title":"Eur J Oper Res"},{"key":"684_CR29","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1111\/itor.12493","volume":"25","author":"A Palacio","year":"2018","unstructured":"Palacio A, Adenso-D\u00edaz B, Lozano S (2018) Analysing the factors that influence the pareto frontier of a bi-objective supply chain design problem. Int Trans Oper Res 25:1717\u20131738","journal-title":"Int Trans Oper Res"},{"issue":"3","key":"684_CR30","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1504\/IJOR.2018.092735","volume":"32","author":"E P\u00e9rez","year":"2018","unstructured":"P\u00e9rez E, Ambati RR, Ruiz-Torres AJ (2018) Maximising the number of on-time jobs on parallel servers with sequence dependent deteriorating processing times and periodic maintenance. Int J Op Res 32(3):267\u2013289","journal-title":"Int J Op Res"},{"issue":"3","key":"684_CR31","first-page":"230","volume":"21","author":"M Pfund","year":"2004","unstructured":"Pfund M, Fowler JW, Gupta JN (2004) A survey of algorithms for single and multi-objective unrelated parallel-machine deterministic scheduling problems. J Chin Inst Ind Eng 21(3):230\u2013241","journal-title":"J Chin Inst Ind Eng"},{"issue":"6","key":"684_CR32","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1111\/itor.12163","volume":"23","author":"S Rath","year":"2016","unstructured":"Rath S, Gendreau M, Gutjahr WJ (2016) Bi-objective stochastic programming models for determining depot locations in disaster relief operations. Int Trans Oper Res 23(6):997\u20131023","journal-title":"Int Trans Oper Res"},{"key":"684_CR33","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.cie.2017.11.012","volume":"115","author":"AJ Ruiz-Torres","year":"2018","unstructured":"Ruiz-Torres AJ, Paletta G, Mahmoodi F, Ablanedo-Rosas JH (2018) Scheduling assemble-to-order systems with multiple cells to minimise costs and tardy deliveries. Comput Ind Eng 115:290\u2013303","journal-title":"Comput Ind Eng"},{"key":"684_CR34","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1016\/j.cie.2018.12.070","volume":"128","author":"AJ Ruiz-Torres","year":"2019","unstructured":"Ruiz-Torres AJ, Ablanedo-Rosas JH, Mukhopadhyay S, Paletta G (2019) Scheduling workers: a multi-criteria model considering their satisfaction. Comput Ind Eng 128:747\u2013754","journal-title":"Comput Ind Eng"},{"key":"684_CR35","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.cie.2018.03.036","volume":"119","author":"J Schaller","year":"2018","unstructured":"Schaller J, Valente JM (2018) Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines. Comput Ind Eng 119:146\u2013156","journal-title":"Comput Ind Eng"},{"issue":"1\u20132","key":"684_CR36","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10107-016-1004-8","volume":"161","author":"R Sitters","year":"2017","unstructured":"Sitters R (2017) Approximability of average completion time scheduling on unrelated machines. Math Progr 161(1\u20132):135\u2013158","journal-title":"Math Progr"},{"issue":"2","key":"684_CR37","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.cor.2007.09.013","volume":"36","author":"LH Su","year":"2009","unstructured":"Su LH (2009) Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system. Comput Oper Res 36(2):461\u2013471","journal-title":"Comput Oper Res"},{"issue":"6","key":"684_CR38","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1080\/00207543.2016.1181285","volume":"55","author":"S Thevenin","year":"2017","unstructured":"Thevenin S, Zufferey N, Potvin JY (2017) Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility. Int J Prod Res 55(6):1588\u20131606","journal-title":"Int J Prod Res"},{"issue":"1","key":"684_CR39","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/JSYST.2013.2256731","volume":"8","author":"CW Tsai","year":"2013","unstructured":"Tsai CW, Rodrigues JJ (2013) Metaheuristic scheduling for cloud: a survey. IEEE Syst J 8(1):279\u2013291","journal-title":"IEEE Syst J"},{"issue":"8","key":"684_CR40","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1016\/j.apm.2014.10.012","volume":"39","author":"WC Yeh","year":"2015","unstructured":"Yeh WC, Chuang MC, Lee WC (2015) Uniform parallel machine scheduling with resource consumption constraint. Appl Math Model 39(8):2131\u20132138","journal-title":"Appl Math Model"},{"key":"684_CR41","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.ejor.2020.10.052","volume":"292","author":"JC Yepes","year":"2021","unstructured":"Yepes JC, Perea F, Ruiz R, Villa F (2021) Bi-objective parallel machine scheduling with additional resources during setups. Eur J Op Res 292:443\u2013455","journal-title":"Eur J Op Res"},{"issue":"2","key":"684_CR42","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler E, Thiele L, Laumanns M, Fonseca CM, da Fonseca VG (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2):117\u2013132","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00684-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-021-00684-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00684-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,18]],"date-time":"2022-08-18T10:38:05Z","timestamp":1660819085000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-021-00684-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,10]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["684"],"URL":"https:\/\/doi.org\/10.1007\/s12351-021-00684-9","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,10]]},"assertion":[{"value":"11 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}