{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:27Z","timestamp":1740123207963,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T00:00:00Z","timestamp":1618704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T00:00:00Z","timestamp":1618704000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10479-021-04043-x","type":"journal-article","created":{"date-parts":[[2021,4,18]],"date-time":"2021-04-18T14:02:37Z","timestamp":1618754557000},"page":"1655-1688","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Generating bicriteria schedules for correlated parallel machines involving tardy jobs and weighted completion time"],"prefix":"10.1007","volume":"319","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9256-1021","authenticated-orcid":false,"given":"Yang-Kuei","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tzu-Yueh","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,18]]},"reference":[{"issue":"1","key":"4043_CR1","doi-asserted-by":"publisher","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 machine scheduling problems. Theoretical Computer Science, 306(1), 319\u2013338.","journal-title":"Theoretical Computer Science"},{"key":"4043_CR2","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.cie.2016.06.025","volume":"102","author":"L Asadzadeh","year":"2016","unstructured":"Asadzadeh, L. (2016). A parallel artificial bee colony algorithm for the job shop scheduling problem with a dynamic migration strategy. Computers & Industrial Engineering, 102, 359\u2013367.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"4043_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2008.10.038","volume":"199","author":"H Balasubramanian","year":"2009","unstructured":"Balasubramanian, H., Fowler, J., Keha, A., & Pfund, M. (2009). Scheduling interfering job sets on parallel machines. European Journal of Operational Research, 199(1), 55\u201367.","journal-title":"European Journal of Operational Research"},{"issue":"9\u201312","key":"4043_CR4","doi-asserted-by":"publisher","first-page":"2105","DOI":"10.1007\/s00170-014-6614-9","volume":"77","author":"E Caniyilmaz","year":"2015","unstructured":"Caniyilmaz, E., Benli, B., & Ilkay, M. S. (2015). An artificial bee colony algorithm approach for unrelated parallel machine scheduling with processing set restrictions, job sequence-dependent setup times, and due date. The International Journal of Advanced Manufacturing Technology, 77(9\u201312), 2105\u20132115.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"8","key":"4043_CR5","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., & Wan, G. (2005). Parallel machine selection and job scheduling to minimize machine cost and job tardiness. Computers & Operations Research, 32(8), 1995\u20132012.","journal-title":"Computers & Operations Research"},{"key":"4043_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V Cerny","year":"1985","unstructured":"Cerny, V. (1985). A thermodynamic approach to the traveling salesman problem: An efficient simulation. Journal of Optimization Theory and Applications, 45, 41\u201351.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"4043_CR7","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/j.eswa.2005.04.033","volume":"29","author":"PC Chang","year":"2005","unstructured":"Chang, P. C., Chen, S. H., & Lin, K. L. (2005). Two-phase sub population genetic algorithm for parallel machine-scheduling problem. Expert Systems with Applications, 29, 705\u2013712.","journal-title":"Expert Systems with Applications"},{"key":"4043_CR8","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/0360-8352(95)00126-L","volume":"29","author":"R Cheng","year":"1995","unstructured":"Cheng, R., Gen, M., & Tosawa, T. (1995). Minmax earliness\/tardiness scheduling in identical parallel machine system using genetic algorithms. Computers and Industrial Engineering, 29, 513\u2013517.","journal-title":"Computers and Industrial Engineering"},{"issue":"2","key":"4043_CR9","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., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182\u2013197.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"4043_CR10","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.cie.2010.07.001","volume":"61","author":"R Driessel","year":"2011","unstructured":"Driessel, R., & M\u00f6nch, L. (2011). Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times. Computers & Industrial Engineering, 61(2), 336\u2013345.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"4043_CR11","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ejor.2009.06.031","volume":"203","author":"F Dugardin","year":"2010","unstructured":"Dugardin, F., Yalaoui, F., & Amodeo, L. (2010). New multi-objective method to solve reentrant hybrid flow shop scheduling problem. European Journal of Operational Research, 203(1), 22\u201331.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"4043_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-012-1099-0","volume":"213","author":"D Elvikis","year":"2014","unstructured":"Elvikis, D., & T\u2019Kindt, V. (2014). Two-agent scheduling on uniform parallel machines with min-max criteria. Annals of Operations Research, 213(1), 79\u201394.","journal-title":"Annals of Operations Research"},{"issue":"5","key":"4043_CR13","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10951-010-0201-1","volume":"14","author":"D Elvikis","year":"2011","unstructured":"Elvikis, D., Hamacher, H. W., & T\u2019Kindt, V. (2011). Scheduling two agents on uniform parallel machines with makespan and cost functions. Journal of Scheduling, 14(5), 471\u2013481.","journal-title":"Journal of Scheduling"},{"key":"4043_CR14","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/j.cie.2009.12.009","volume":"58","author":"J Gao","year":"2010","unstructured":"Gao, J. (2010). A novel artificial immune system for solving multiobjective scheduling problems subject to special process constraint. Computers & Industrial Engineering, 58, 602\u2013609.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"4043_CR15","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/j.ejor.2004.07.015","volume":"167","author":"JN Gupta","year":"2005","unstructured":"Gupta, J. N., & Ruiz-Torres, A. J. (2005). Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs. European Journal of Operational Research, 167(3), 679\u2013695.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"4043_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1590\/S0101-74382000000100003","volume":"20","author":"JND Gupta","year":"2000","unstructured":"Gupta, J. N. D., & Ho, J. C. (2000). Minimizing flow time subject to optimal makespan on two identical parallel machines. Pesquisa Operacional, 20(1), 5\u201318.","journal-title":"Pesquisa Operacional"},{"issue":"11","key":"4043_CR17","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1057\/palgrave.jors.2601016","volume":"51","author":"JND Gupta","year":"2000","unstructured":"Gupta, J. N. D., Ho, J. C., & Webster, S. (2000). Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines. Journal of the Operational Research Society, 51(11), 1330\u20131339.","journal-title":"Journal of the Operational Research Society"},{"issue":"1\u20132","key":"4043_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00170-008-1683-2","volume":"43","author":"J Gao","year":"2009","unstructured":"Gao, J., He, G., & Wang, Y. (2009). A new parallel genetic algorithm for solving multiobjective scheduling problems subjected to special process constraint. The International Journal of Advanced Manufacturing Technology, 43(1\u20132), 151\u2013160.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"4043_CR19","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., & Rinnooy, K. A. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"4043_CR20","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1016\/j.ins.2017.09.028","volume":"422","author":"E Hancer","year":"2018","unstructured":"Hancer, E., Xue, B., Zhang, M., Karaboga, D., & Akay, B. (2018). Pareto front feature selection based on artificial bee colony optimization. Information Sciences, 422, 462\u2013479.","journal-title":"Information Sciences"},{"key":"4043_CR21","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.asoc.2017.01.044","volume":"55","author":"ZH Jia","year":"2017","unstructured":"Jia, Z. H., Zhang, Y. L., Leung, J. Y. T., & Li, K. (2017). Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines. Applied Soft Computing, 55, 226\u2013237.","journal-title":"Applied Soft Computing"},{"key":"4043_CR22","unstructured":"Karaboga, D. (2005). \u201cAn idea based on honey bee swarm for numerical optimization.\u201d Technical report-tr06, Erciyes university, engineering faculty, computer engineering department."},{"issue":"1","key":"4043_CR23","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.amc.2009.03.090","volume":"214","author":"D Karaboga","year":"2009","unstructured":"Karaboga, D., & Akay, B. (2009). A comparative study of artificial bee colony algorithm. Applied Mathematics and Computation, 214(1), 108\u2013132.","journal-title":"Applied Mathematics and Computation"},{"issue":"4598","key":"4043_CR24","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"SC Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S. C., Gelatt, C. D., & Vecchi, M. (1983). Optimization by simulated annealing. Science, 220(4598), 671\u2013680.","journal-title":"Science"},{"key":"4043_CR25","doi-asserted-by":"publisher","first-page":"1655","DOI":"10.1016\/S0305-0548(03)00113-8","volume":"31","author":"CH Lin","year":"2003","unstructured":"Lin, C. H., & Liao, C. J. (2003). Makespan minimization subject to flowtime optimality on identical parallel machines. Computers and Operations Research, 31, 1655\u20131666.","journal-title":"Computers and Operations Research"},{"key":"4043_CR26","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J. K., Kan, A. R., & Bricker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"issue":"9\u201312","key":"4043_CR27","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1007\/s00170-010-3140-2","volume":"55","author":"JQ Li","year":"2011","unstructured":"Li, J. Q., Pan, Q. K., & Gao, K. Z. (2011). Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. The International Journal of Advanced Manufacturing Technology, 55(9\u201312), 1159\u20131169.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"4043_CR28","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cor.2014.05.013","volume":"51","author":"SW Lin","year":"2014","unstructured":"Lin, S. W., & Ying, K. C. (2014). ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times. Computers & Operations Research, 51, 172\u2013181.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"4043_CR29","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s12351-017-0355-0","volume":"18","author":"YK Lin","year":"2018","unstructured":"Lin, Y. K. (2018). Scheduling efficiency on correlated parallel machine scheduling problems. Operational Research, 18(3), 603\u2013624.","journal-title":"Operational Research"},{"key":"4043_CR30","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s00170-013-4773-8","volume":"67","author":"YK Lin","year":"2013","unstructured":"Lin, Y. K., & Lin, C. W. (2013). Dispatching rules for unrelated parallel machine scheduling with release dates. International Journal of Advanced Manufacturing Technology, 67, 269\u2013279.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"4043_CR31","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.cor.2015.04.025","volume":"64","author":"YK Lin","year":"2015","unstructured":"Lin, Y. K., & Lin, H. C. (2015). Bicriteria scheduling problem for unrelated parallel machines with release dates. Computers & Operations Research, 64, 28\u201339.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"4043_CR32","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ejor.2012.10.008","volume":"227","author":"YK Lin","year":"2013","unstructured":"Lin, Y. K., Fowler, J. W., & Pfund, M. E. (2013). Multiple-objective heuristics for scheduling unrelated parallel machines. European Journal of Operational Research, 227(2), 239\u2013253.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"4043_CR33","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s10951-013-0347-8","volume":"17","author":"YK Lin","year":"2014","unstructured":"Lin, Y. K., Pfund, M. E., & Fowler, J. W. (2014). Processing time generation schemes for parallel machine scheduling problems with various correlation structures. Journal of Scheduling, 17(6), 569\u2013586.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"4043_CR34","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1080\/00207543.2017.1351634","volume":"56","author":"M Mateo","year":"2018","unstructured":"Mateo, M., Teghem, J., & Tuyttens, D. (2018). A bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs. International Journal of Production Research, 56(3), 1030\u20131053.","journal-title":"International Journal of Production Research"},{"key":"4043_CR35","doi-asserted-by":"publisher","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. Computers & Operations Research, 24, 1097\u20131100.","journal-title":"Computers & Operations Research"},{"key":"4043_CR36","doi-asserted-by":"publisher","first-page":"2731","DOI":"10.1016\/j.cor.2004.04.001","volume":"32","author":"L M\u00f6nch","year":"2005","unstructured":"M\u00f6nch, L., Balasubramanian, H., Fowler, J. W., & Pfund, M. E. (2005). Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Computers and Operations Research, 32, 2731\u20132750.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"4043_CR37","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"ME Nawaz Jr","year":"1983","unstructured":"Nawaz, M. E., Jr., Enscore, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91\u201395.","journal-title":"Omega"},{"issue":"12","key":"4043_CR38","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"QK Pan","year":"2011","unstructured":"Pan, Q. K., Tasgetiren, M. F., Suganthan, P. N., & Chua, T. J. (2011). A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information Sciences, 181(12), 2455\u20132468.","journal-title":"Information Sciences"},{"key":"4043_CR39","volume-title":"Scheduling theory, algorithms, and systems","author":"M Pinedo","year":"2016","unstructured":"Pinedo, M. (2016). Scheduling theory, algorithms, and systems. (5th ed.). Hoboken: Prentice Hall.","edition":"5"},{"issue":"2","key":"4043_CR40","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0166-218X(85)90009-5","volume":"10","author":"CN Potts","year":"1985","unstructured":"Potts, C. N. (1985). Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Discrete Application Math, 10(2), 155\u2013164.","journal-title":"Discrete Application Math"},{"issue":"1\u20132","key":"4043_CR41","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0360-8352(97)00087-9","volume":"33","author":"AJ Ruiz-Torres","year":"1997","unstructured":"Ruiz-Torres, A. J., Enscore, E. E., & Barton, R. R. (1997). Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem. Computers & Industrial Engineering, 33(1\u20132), 257\u2013260.","journal-title":"Computers & Industrial Engineering"},{"key":"4043_CR42","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.cor.2017.06.019","volume":"88","author":"B Shahidi-Zadeh","year":"2017","unstructured":"Shahidi-Zadeh, B., Tavakkoli-Moghaddam, R., Taheri-Moghadam, A., & Rastgar, I. (2017). Solving a bi-objective unrelated parallel batch processing machines scheduling problem: A comparison study. Computers & Operations Research, 88, 71\u201390.","journal-title":"Computers & Operations Research"},{"issue":"1\u20133","key":"4043_CR43","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01586059","volume":"54","author":"J Sousa","year":"1992","unstructured":"Sousa, J., & Wolsey, L. (1992). A time-indexed integer programming formulation for non-preemptive single machine scheduling problems. Mathematical Programming, 54(1\u20133), 353\u2013367.","journal-title":"Mathematical Programming"},{"key":"4043_CR44","volume-title":"Multicriteria scheduling: Theory, models and algorithms","author":"V T\u2019Kindt","year":"2006","unstructured":"T\u2019Kindt, V., & Billaut, J.-C. (2006). Multicriteria scheduling: Theory, models and algorithms (2nd ed.). Berlin: Springer.","edition":"2"},{"issue":"1","key":"4043_CR45","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0305-0548(98)80005-1","volume":"25","author":"A Tuzikov","year":"1998","unstructured":"Tuzikov, A., Makhaniok, M., & M\u00e4nner, R. (1998). Bicriterion scheduling of identical processing time jobs by uniform processors. Computers & Operations Research, 25(1), 31\u201335.","journal-title":"Computers & Operations Research"},{"issue":"5","key":"4043_CR46","first-page":"3279","volume":"8","author":"KC Ying","year":"2012","unstructured":"Ying, K. C., & Lin, S. W. (2012). Unrelated parallel machine scheduling with sequence-and machine-dependent setup times and due date constraints. International Journal of Innovative Computing, Information and Control, 8(5), 3279\u20133297.","journal-title":"International Journal of Innovative Computing, Information and Control"},{"key":"4043_CR47","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.knosys.2016.10.026","volume":"116","author":"R Zhang","year":"2017","unstructured":"Zhang, R., Chang, P. C., Song, S., & Wu, C. (2017). A multi-objective artificial bee colony algorithm for parallel batch-processing machine scheduling in fabric dyeing processes. Knowledge-Based Systems, 116, 114\u2013129.","journal-title":"Knowledge-Based Systems"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04043-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04043-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04043-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T22:55:42Z","timestamp":1669416942000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04043-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,18]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["4043"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04043-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2021,4,18]]},"assertion":[{"value":"13 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}