{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:37:24Z","timestamp":1762299444231,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T00:00:00Z","timestamp":1597104000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T00:00:00Z","timestamp":1597104000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71871176","71732006"],"award-info":[{"award-number":["71871176","71732006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71572138","71971167"],"award-info":[{"award-number":["71572138","71971167"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71971173"],"award-info":[{"award-number":["71971173"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2018M643685"],"award-info":[{"award-number":["2018M643685"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10878-020-00636-7","type":"journal-article","created":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T22:03:05Z","timestamp":1597183385000},"page":"1173-1202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Multimode time-cost-robustness trade-off project scheduling problem under uncertainty"],"prefix":"10.1007","volume":"43","author":[{"given":"Xue","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengwen","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nengmin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Vanhoucke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,11]]},"reference":[{"issue":"2","key":"636_CR1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.ejor.2004.04.006","volume":"165","author":"C Akkan","year":"2005","unstructured":"Akkan C, Drexl A, Kimms A (2005) Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. Eur J Oper Res 165(2):339\u2013358","journal-title":"Eur J Oper Res"},{"issue":"2","key":"636_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ijpe.2004.04.002","volume":"96","author":"MA Al-Fawzan","year":"2005","unstructured":"Al-Fawzan MA, Haouari M (2005) A bi-objective model for robust resource-constrained project scheduling. Int J Prod Econ 96(2):175\u2013187","journal-title":"Int J Prod Econ"},{"issue":"13","key":"636_CR3","doi-asserted-by":"crossref","first-page":"3950","DOI":"10.1080\/00207543.2014.923120","volume":"52","author":"\u00c1ngeles P\u00e9rez","year":"2014","unstructured":"P\u00e9rez \u00c1ngeles, Quintanilla S, Lino P, Valls V (2014) A multiobjective approach for a project scheduling problem with due dates and temporal constraints infeasibilities. Int J Prod Res 52(13):3950\u20133965","journal-title":"Int J Prod Res"},{"issue":"3","key":"636_CR4","doi-asserted-by":"crossref","first-page":"1186","DOI":"10.1016\/j.ejor.2006.05.014","volume":"180","author":"A Azaron","year":"2007","unstructured":"Azaron A, Tavakkoli-Moghaddam R (2007) Multiobjective time-cost trade-off in dynamic PERT networks using an interactive approach. Eur J Oper Res 180(3):1186\u20131200","journal-title":"Eur J Oper Res"},{"issue":"1","key":"636_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz J, Lenstra JK, Kan AHGR (1983) Scheduling subject to resource constraints: classification and complexity. Discret Appl Math 5(1):11\u201324","journal-title":"Discret Appl Math"},{"issue":"1","key":"636_CR6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10878-016-0051-7","volume":"34","author":"N Brauner","year":"2017","unstructured":"Brauner N, Finke G, Shafransky Y (2017) Lawler\u2019s minmax cost problem under uncertainty. J Comb Optim 34(1):31\u201346","journal-title":"J Comb Optim"},{"issue":"2","key":"636_CR7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10878-019-00385-2","volume":"38","author":"BC Choi","year":"2019","unstructured":"Choi BC, Kang C (2019) A linear time-cost tradeoff problem with multiple milestones under a comb graph. J Comb Optim 38(2):341\u2013361","journal-title":"J Comb Optim"},{"issue":"1","key":"636_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.ejor.2013.11.009","volume":"236","author":"BC Choi","year":"2014","unstructured":"Choi BC, Chung J (2014) Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs. Eur J Oper Res 236(1):61\u201368","journal-title":"Eur J Oper Res"},{"issue":"3","key":"636_CR9","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10878-009-9247-4","volume":"18","author":"S Cicerone","year":"2009","unstructured":"Cicerone S, D\u2019Angelo G, Stefano GD, Frigioni D, Navarra A (2009) Recoverable robust timetabling for single delay: complexity and polynomial algorithms for special cases. J Comb Optim 18(3):229\u2013257","journal-title":"J Comb Optim"},{"issue":"1","key":"636_CR10","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6","volume":"7","author":"P Czyzak","year":"1998","unstructured":"Czyzak P, Jaszkiewicz A (1998) Pareto simulated annealing - a metaheuristic technique for multiple-objective combinatorial optimization. J Multi Criteria Decis Anal 7(1):34\u201347","journal-title":"J Multi Criteria Decis Anal"},{"issue":"2","key":"636_CR11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0377-2217(94)00187-H","volume":"81","author":"P De","year":"1995","unstructured":"De P, Dunne EJ, Ghosh JB, Wells CE (1995) The discrete time-cost tradeoff problem revisited. Eur J Oper Res 81(2):225\u2013238","journal-title":"Eur J Oper Res"},{"issue":"1","key":"636_CR12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0377-2217(94)00181-2","volume":"88","author":"EL Demeulemeester","year":"1996","unstructured":"Demeulemeester EL, Herroelen WS, Elmaghraby SE (1996) Optimal procedures for the discrete time\/cost trade-off problem in project networks. Eur J Oper Res 88(1):50\u201368","journal-title":"Eur J Oper Res"},{"key":"636_CR13","first-page":"1","volume":"4","author":"G Du","year":"2017","unstructured":"Du G, Zheng L, Ouyang X (2017) Real-time scheduling optimization considering the unexpected events in home health care. J Comb Optim 4:1\u201325","journal-title":"J Comb Optim"},{"issue":"1","key":"636_CR14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2009.12.014","volume":"205","author":"S Elloumi","year":"2010","unstructured":"Elloumi S, Fortemps P (2010) A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem. Eur J Oper Res 205(1):31\u201341","journal-title":"Eur J Oper Res"},{"issue":"4\u2013part\u20131","key":"636_CR15","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1287\/mnsc.19.4.446","volume":"19","author":"JE Falk","year":"1972","unstructured":"Falk JE, Horowitz JL (1972) Critical path problems with concave cost-time curves. Manag Sci 19(4\u2013part\u20131):446\u2013455","journal-title":"Manag Sci"},{"issue":"30","key":"636_CR16","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.autcon.2012.11.014","volume":"30","author":"P Ghoddousi","year":"2013","unstructured":"Ghoddousi P, Eshtehardian E, Jooybanpour S, Javanmardi A (2013) Multi-mode resource-constrained discrete time-cost-resource optimization in project scheduling using non-dominated sorting genetic algorithm. Autom in Constr 30(30):216\u2013227","journal-title":"Autom in Constr"},{"issue":"2","key":"636_CR17","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.cor.2013.11.002","volume":"44","author":"HC Gomes","year":"2014","unstructured":"Gomes HC, Neves FDAD, Souza MJF (2014) Multiobjective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations. Comput Oper Res 44(2):92\u2013104","journal-title":"Comput Oper Res"},{"key":"636_CR18","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1287\/mnsc.21.6.718","volume":"21","author":"SK Goyal","year":"1975","unstructured":"Goyal SK (1975) Note-A note on \u201ca simple CPM time-cost tradeoff algorithm\u201d. Manag Sci 21:718\u2013722","journal-title":"Manag Sci"},{"issue":"4","key":"636_CR19","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1057\/jors.2009.20","volume":"61","author":"AB Haf\u0131Zo\u01e7Lu","year":"2010","unstructured":"Haf\u0131Zo\u01e7Lu AB, Azizo\u01e7Lu M (2010) Linear programming based approaches for the discrete time\/cost trade-off problem in project networks. J Oper Res Soc 61(4):676\u2013685","journal-title":"J Oper Res Soc"},{"issue":"1\u20134","key":"636_CR20","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1010902015091","volume":"102","author":"S Hartmann","year":"2001","unstructured":"Hartmann S (2001) Project scheduling with multiple modes: a genetic algorithm. Ann Oper Res 102(1\u20134):111\u2013135","journal-title":"Ann Oper Res"},{"issue":"4","key":"636_CR21","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.cor.2009.06.009","volume":"37","author":"O Haz\u0131r","year":"2010","unstructured":"Haz\u0131r O, Haouari M, Erel E (2010a) Discrete time\/cost trade-off problem: a decomposition-based solution algorithm for the budget version. Comput Oper Res 37(4):649\u2013655","journal-title":"Comput Oper Res"},{"issue":"2","key":"636_CR22","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/j.ejor.2010.05.046","volume":"207","author":"O Haz\u0131r","year":"2010","unstructured":"Haz\u0131r O, Haouari M, Erel E (2010b) Robust scheduling and robustness measures for the discrete time\/cost trade-off problem. Eur J Oper Res 207(2):633\u2013643","journal-title":"Eur J Oper Res"},{"issue":"1","key":"636_CR23","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ijpe.2010.11.018","volume":"130","author":"O Haz\u0131r","year":"2011","unstructured":"Haz\u0131r O, Erel E, G\u00fcnalay Y (2011) Robust optimization models for the discrete time\/cost trade-off problem. Int J Prod Econ 130(1):87\u201395","journal-title":"Int J Prod Econ"},{"issue":"feb.","key":"636_CR24","first-page":"564","volume":"78","author":"Z He","year":"2016","unstructured":"He Z, He H, Liu R, Wang N (2016) Variable neighbourhood search and tabu search for a discrete time\/cost trade-off problem to minimize the maximal cash flow gap. Comput Oper Res 78(feb.):564\u2013577","journal-title":"Comput Oper Res"},{"issue":"2","key":"636_CR25","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ejor.2004.04.002","volume":"165","author":"W Herroelen","year":"2005","unstructured":"Herroelen W, Leus R (2005) Project scheduling under uncertainty: Survey and research potentials. Eur J Oper Res 165(2):289\u2013306","journal-title":"Eur J Oper Res"},{"issue":"1","key":"636_CR26","first-page":"299","volume":"195","author":"B Jarboui","year":"2008","unstructured":"Jarboui B, Damak N, Siarry P, Rebai A (2008) A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Appl Math Comput 195(1):299\u2013308","journal-title":"Appl Math Comput"},{"issue":"4","key":"636_CR27","first-page":"314","volume":"5","author":"KC Kapur","year":"1973","unstructured":"Kapur KC (1973) An algorithm for project cost-duration analysis problem with quadratic and convex cost functions. A I I E Trans 5(4):314\u2013322","journal-title":"A I I E Trans"},{"key":"636_CR28","unstructured":"Knowles J, Corne D (2002) On metrics for comparing non-dominated sets. In: Proceedings of congress on evolutionary computation 2002"},{"issue":"1","key":"636_CR29","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1996","unstructured":"Kolisch R, Sprecher A (1996) PSPLIB\u2014a project scheduling problem library. Eur J Oper Res 96(1):205\u2013216","journal-title":"Eur J Oper Res"},{"issue":"2","key":"636_CR30","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/j.ijpe.2007.02.003","volume":"111","author":"O Lambrechts","year":"2008","unstructured":"Lambrechts O, Demeulemeester E, Herroelen W (2008) A tabu search procedure for developing robust predictive project schedules. Int J Prod Econ 111(2):493\u2013508","journal-title":"Int J Prod Econ"},{"issue":"4","key":"636_CR31","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.cie.2010.07.014","volume":"59","author":"J Li","year":"2010","unstructured":"Li J, Pan QK, Liang YC (2010) An effective hybrid tabu search algorithm for multiobjective flexible job-shop scheduling problems. Comput Ind Eng 59(4):647\u2013662","journal-title":"Comput Ind Eng"},{"issue":"6","key":"636_CR32","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1016\/j.cor.2010.10.004","volume":"38","author":"A Lim","year":"2011","unstructured":"Lim A, Ma H, Rodrigues B, Tan ST, Xiao F (2011) New concepts for activity float in resource-constrained project management. Comput Oper Res 38(6):917\u2013930","journal-title":"Comput Oper Res"},{"key":"636_CR33","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/j.cie.2019.04.014","volume":"131","author":"Z Ma","year":"2019","unstructured":"Ma Z, Demeulemeester E, He Z, Wang Nengmin (2019) A computational experiment to explore better robustness measures for project scheduling under two types of uncertain environments. Comput Ind Eng 131:382\u2013390","journal-title":"Comput Ind Eng"},{"issue":"3","key":"636_CR34","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.engappai.2008.10.018","volume":"22","author":"M Mart\u00ednez-Iranzo","year":"2009","unstructured":"Mart\u00ednez-Iranzo M, Herrero JM, Sanchis J, Blasco X, Garc\u00eda-Nieto S (2009) Applied Pareto multiobjective optimization by stochastic solvers. Eng Appl Artif Intell 22(3):455\u2013465","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"636_CR35","first-page":"455","volume":"213","author":"G Mavrotas","year":"2009","unstructured":"Mavrotas G (2009) Effective implementation of the $$\\varepsilon $$-constraint method in multiobjective mathematical programming problems. Appl Math Comput 213(2):455\u2013465","journal-title":"Appl Math Comput"},{"key":"636_CR36","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.cor.2018.01.001","volume":"92","author":"AEF Muritiba","year":"2018","unstructured":"Muritiba AEF, Rodrigues CD, Ara\u00f9jo da Costa F (2018) A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem. Comput Oper Res 92:145\u2013154","journal-title":"Comput Oper Res"},{"issue":"6","key":"636_CR37","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.ijproman.2008.10.009","volume":"27","author":"W Peng","year":"2009","unstructured":"Peng W, Wang C (2009) A multi-mode resource-constrained discrete time-cost tradeoff problem and its genetic algorithm based solution. Int J Project Manag 27(6):600\u2013609","journal-title":"Int J Project Manag"},{"key":"636_CR38","first-page":"628","volume":"259","author":"SS Said","year":"2015","unstructured":"Said SS, Haouari M (2015) A hybrid simulation-optimization approach for the robust discrete time\/cost trade-off problem. Appl Math Comput 259:628\u2013636","journal-title":"Appl Math Comput"},{"issue":"C","key":"636_CR39","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.cie.2015.04.027","volume":"87","author":"A Shahsavar","year":"2015","unstructured":"Shahsavar A, Najafi AA, Niaki STA (2015) Three self-adaptive multiobjective evolutionary algorithms for a triple-objective project scheduling problem. Comput Ind Eng 87(C):4\u201315","journal-title":"Comput Ind Eng"},{"issue":"4","key":"636_CR40","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/moor.23.4.909","volume":"23","author":"M Skutella","year":"1998","unstructured":"Skutella M (1998) Approximation algorithms for the discrete time-cost tradeoff problem. Math Oper Res 23(4):909\u2013929","journal-title":"Math Oper Res"},{"issue":"8","key":"636_CR41","first-page":"711","volume":"31","author":"R S\u0142owi\u0144ski","year":"1980","unstructured":"S\u0142owi\u0144ski R (1980) Two approaches to problems of resource allocation among project activities\u2014a comparative study. J Oper Res Soc 31(8):711\u2013723","journal-title":"J Oper Res Soc"},{"issue":"2","key":"636_CR42","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/S0377-2217(97)00348-2","volume":"107","author":"A Sprecher","year":"1998","unstructured":"Sprecher A, Drexl A (1998) Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. Eur J Oper Res 107(2):431\u2013450","journal-title":"Eur J Oper Res"},{"key":"636_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.05.017","author":"BH Tabrizi","year":"2016","unstructured":"Tabrizi BH, Ghaderi SF (2016) A robust bi-objective model for concurrent planning of project scheduling and material procurement. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2016.05.017","journal-title":"Comput Ind Eng"},{"key":"636_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.02.039","author":"J Tian","year":"2019","unstructured":"Tian J, Hao X, Gen M (2019) A hybrid multiobjective EDA for robust resource constraint project scheduling with uncertainty. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2019.02.039","journal-title":"Comput Ind Eng"},{"issue":"1","key":"636_CR45","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ejor.2014.06.025","volume":"240","author":"Umut Be\u015fikci","year":"2015","unstructured":"Be\u015fikci Umut, Bilge \u00dcmit, Ulusoy G\u00fcnd\u00fcz (2015) Multi-mode resource constrained multi-project scheduling and resource portfolio problem. Eur J Oper Res 240(1):22\u201331","journal-title":"Eur J Oper Res"},{"issue":"2","key":"636_CR46","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.ijpe.2004.08.004","volume":"97","author":"S Van de Vonder","year":"2005","unstructured":"Van de Vonder S, Demeulemeester E, Herroelen W, Leus R (2005) The use of buffers in project management: The trade-off between stability and makespan. Int J Prod Econ 97(2):227\u2013240","journal-title":"Int J Prod Econ"},{"issue":"1","key":"636_CR47","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.ejor.2013.10.012","volume":"235","author":"V Van Peteghem","year":"2014","unstructured":"Van Peteghem V, Vanhoucke M (2014) An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances. Eur J Oper Res 235(1):62\u201372","journal-title":"Eur J Oper Res"},{"issue":"4\u20135","key":"636_CR48","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10951-007-0031-y","volume":"10","author":"M Vanhoucke","year":"2007","unstructured":"Vanhoucke M, Debels D (2007) The discrete time\/cost trade-off problem: extensions and heuristic procedures. J Sched 10(4\u20135):311\u2013326","journal-title":"J Sched"},{"issue":"3","key":"636_CR49","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2010.03.037","volume":"208","author":"J Weglarz","year":"2011","unstructured":"Weglarz J, J\u00f3zefowska J, Mika M, Waligora G (2011) Project scheduling with finite or infinite number of activity processing modes\u2014a survey. Eur J Oper Res 208(3):177\u2013205","journal-title":"Eur J Oper Res"},{"issue":"1","key":"636_CR50","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1115\/1.1329875","volume":"123","author":"J Wu","year":"2001","unstructured":"Wu J, Azarm S (2001) Metrics for quality assessment of a multiobjective design optimization solution set. J Mech Des 123(1):18\u201325","journal-title":"J Mech Des"},{"issue":"3","key":"636_CR51","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1007\/s10878-012-9574-8","volume":"28","author":"G Xiong","year":"2014","unstructured":"Xiong G, Wang Y (2014) Best routes selection in multimodal networks using multiobjective genetic algorithm. J Comb Optim 28(3):655\u2013673","journal-title":"J Comb Optim"},{"issue":"3","key":"636_CR52","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.cie.2007.08.003","volume":"54","author":"B Yagmahan","year":"2008","unstructured":"Yagmahan B, Yenisey MM (2008) Ant colony optimization for multiobjective flow shop scheduling problem. Comput Ind Eng 54(3):411\u2013420","journal-title":"Comput Ind Eng"},{"key":"636_CR53","doi-asserted-by":"crossref","unstructured":"Zheng F, Sui Y (2019) A bi-objective model for dual-resource constrained job shop scheduling with the consideration of energy consumption. In: Proceedings of the international conference on industrial engineering systems management","DOI":"10.1109\/IESM45758.2019.8948171"},{"key":"636_CR54","doi-asserted-by":"crossref","unstructured":"Zhu C, Xue Y, He Z, Bao Z, Zhang Z, Hu K (2019) A multi-objective model for multi-skill project scheduling problem considering perform efficiency. In: Proceedings of the international conference on industrial engineering systems management","DOI":"10.1109\/IESM45758.2019.8948152"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00636-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00636-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00636-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T17:57:50Z","timestamp":1657735070000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00636-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,11]]},"references-count":54,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["636"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00636-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,8,11]]},"assertion":[{"value":"11 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}