{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:31:17Z","timestamp":1764977477778,"version":"3.46.0"},"reference-count":34,"publisher":"Walter de Gruyter GmbH","issue":"5","license":[{"start":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T00:00:00Z","timestamp":1508716800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9,25]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The resource constraint project scheduling problem (RCPSP) has attracted growing attention since the last decades. Precedence constraints are considered as well as resources with limited capacities. During the project, the same resource can be required by several in-process jobs and it is compulsory to ensure that the consumptions do not exceed the limited capacities. In this paper, several criteria are involved, namely makespan, total job tardiness, and workload balancing level. Our problem is firstly solved by the non-dominated sorting genetic algorithm-II (NSGAII) as well as the recently proposed NSGAIII. Giving emphasis to the selection procedure, we apply both the traditional Pareto dominance and the less documented Lorenz dominance into the niching mechanism of NSGAIII. Hence, we adopt and modify L-NSGAII to our problem and propose L-NSGAIII by integrating the notion of Lorenz dominance. Our methods are tested by 1350 randomly generated instances, considering problems with 30\u2013150 jobs and different configurations of resources and due dates. Hypervolume and C-metric are considered to evaluate the results. The Lorenz dominance leads the population more toward the ideal point. As experiments show, it allows improving the original NSGA approach.<\/jats:p>","DOI":"10.1515\/jisys-2017-0241","type":"journal-article","created":{"date-parts":[[2017,10,22]],"date-time":"2017-10-22T06:01:59Z","timestamp":1508652119000},"page":"791-806","source":"Crossref","is-referenced-by-count":2,"title":["Non-dominated Sorting Genetic Algorithms for a Multi-objective Resource Constraint Project Scheduling Problem"],"prefix":"10.1515","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6318-2591","authenticated-orcid":false,"given":"Xixi","family":"Wang","sequence":"first","affiliation":[{"name":"University of Technology of Troyes, ICD-LOSI, UMR CNRS 6281 , 12 rue Marie Curie, CS 42060 , 10004 Troyes Cedex , France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farouk","family":"Yalaoui","sequence":"additional","affiliation":[{"name":"University of Technology of Troyes, ICD-LOSI, UMR CNRS 6281 , 12 rue Marie Curie, CS 42060 , 10004 Troyes Cedex , France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Dugardin","sequence":"additional","affiliation":[{"name":"University of Technology of Troyes, ICD-LOSI, UMR CNRS 6281 , 12 rue Marie Curie, CS 42060 , 10004 Troyes Cedex , France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2017,10,23]]},"reference":[{"key":"2025120523294075598_j_jisys-2017-0241_ref_001_w2aab3b7b9b1b6b1ab1b6b1Aa","unstructured":"B. Abbasi, S. Shadrokh and J. Arkat, Bi-objective resource-constrained project scheduling with robustness and makespan criteria, Appl. Math. Comput.96 (2006), 175\u2013187."},{"key":"2025120523294075598_j_jisys-2017-0241_ref_002_w2aab3b7b9b1b6b1ab1b6b2Aa","doi-asserted-by":"crossref","unstructured":"M. A. Al-Fawzan and M. Haouari, A bi-objective model for robust resource-constrained project scheduling, Int. J. Prod. Econ.180 (2006), 146\u2013152.","DOI":"10.1016\/j.amc.2005.11.160"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_003_w2aab3b7b9b1b6b1ab1b6b3Aa","doi-asserted-by":"crossref","unstructured":"R. Alvarez-Vald\u00e9s and J. M. Tamarit, The project scheduling polyhedron: dimension, facets and lifting theorems, Eur. J. Oper. Res.67 (1993), 204\u2013220.10.1016\/0377-2217(93)90062-R","DOI":"10.1016\/0377-2217(93)90062-R"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_004_w2aab3b7b9b1b6b1ab1b6b4Aa","doi-asserted-by":"crossref","unstructured":"T. Baar, P. Brucker and S. Knust, Tabu search algorithms and lower bounds for the resource-constrained project scheduling problem, in: S. Vo\u00df, S. Martello, I. H. Osman and C. Roucairol (eds.), Meta-Heuristics, pp. 1\u201318, Springer US, New York, NY, 1999.","DOI":"10.1007\/978-1-4615-5775-3_1"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_005_w2aab3b7b9b1b6b1ab1b6b5Aa","doi-asserted-by":"crossref","unstructured":"L. Bianco and M. Camaria, A new formulation for the project scheduling problem under limited resources, Flexible Serv. Manuf. J.25 (2013), 6\u201324.10.1007\/s10696-011-9127-y","DOI":"10.1007\/s10696-011-9127-y"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_006_w2aab3b7b9b1b6b1ab1b6b6Aa","doi-asserted-by":"crossref","unstructured":"J. Blazewicz, J. K. Lenstra and A. H. G. R. Kan, Scheduling subject to resource constraints: classification and complexity, Discrete Appl. Math.5 (1983), 11\u201324.10.1016\/0166-218X(83)90012-4","DOI":"10.1016\/0166-218X(83)90012-4"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_007_w2aab3b7b9b1b6b1ab1b6b7Aa","doi-asserted-by":"crossref","unstructured":"P. Brucker, S. Knust, A. Schoo and O. Thiele, A branch and bound algorithm for the resource-constrained project scheduling problem, Eur. J. Oper. Res.107 (1998), 272\u2013288.10.1016\/S0377-2217(97)00335-4","DOI":"10.1016\/S0377-2217(97)00335-4"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_008_w2aab3b7b9b1b6b1ab1b6b8Aa","doi-asserted-by":"crossref","unstructured":"N. Christofides, R. Alvarez-Valdes and J. M. Tamarit, Project scheduling with resource constraints: a branch and bound approach, Eur. J. Oper. Res.29 (1987), 262\u2013273.10.1016\/0377-2217(87)90240-2","DOI":"10.1016\/0377-2217(87)90240-2"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_009_w2aab3b7b9b1b6b1ab1b6b9Aa","doi-asserted-by":"crossref","unstructured":"N. Damak, B. Jarboui and T. Loukil, Non-dominated sorting genetic algorithm-II to solve bi-objective multi-mode resource-constrained project scheduling problem, in: 2013 International Conference on Control, Decision and Information Technologies (CoDIT), Hammamet, Tunisia, pp. 842\u2013846, 2013.","DOI":"10.1109\/CoDIT.2013.6689652"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_010_w2aab3b7b9b1b6b1ab1b6c10Aa","doi-asserted-by":"crossref","unstructured":"P. P. Das and S. Acharyya, Meta-heuristic approaches for solving resource constrained project scheduling problem: a comparative study, in: 2011 IEEE International Conference on Computer Science and Automation Engineering (CSAE), vol. 2, pp. 474\u2013478, 2011.","DOI":"10.1109\/CSAE.2011.5952511"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_011_w2aab3b7b9b1b6b1ab1b6c11Aa","doi-asserted-by":"crossref","unstructured":"K. Deb and H. Jain, An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints, IEEE Trans. Evol. Comput.18 (2014), 577\u2013601.10.1109\/TEVC.2013.2281535","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_012_w2aab3b7b9b1b6b1ab1b6c12Aa","doi-asserted-by":"crossref","unstructured":"K. Deb, A. Pratap, S. Agarwal and T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans. Evol. Comput.6 (2002), 182\u2013197.10.1109\/4235.996017","DOI":"10.1109\/4235.996017"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_013_w2aab3b7b9b1b6b1ab1b6c13Aa","doi-asserted-by":"crossref","unstructured":"D. Debels and M. Vanhoucke, A decomposition-based genetic algorithm for the resource-constrained project-scheduling problem, Oper. Res.55 (2007), 457\u2013469.10.1287\/opre.1060.0358","DOI":"10.1287\/opre.1060.0358"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_014_w2aab3b7b9b1b6b1ab1b6c14Aa","doi-asserted-by":"crossref","unstructured":"E. Demeulemeester and W. Herroelen, A branch-and-bound procedure for the multiple resource-constrained project scheduling problem, Manage. Sci.38 (1992), 1803\u20131818.10.1287\/mnsc.38.12.1803","DOI":"10.1287\/mnsc.38.12.1803"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_015_w2aab3b7b9b1b6b1ab1b6c15Aa","doi-asserted-by":"crossref","unstructured":"F. Dugardin, F. Yalaoui and L. Amodeo, New multi-objective method to solve re-entrant hybrid flow shop scheduling problem, Eur. J. Oper. Res.203 (2012), 22\u201331.","DOI":"10.1016\/j.ejor.2009.06.031"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_016_w2aab3b7b9b1b6b1ab1b6c16Aa","doi-asserted-by":"crossref","unstructured":"C. M. Fonseca, L. Paquete and M. Lopez-Ibanez, An improved dimension-sweep algorithm for the hypervolume indicator, in: IEEE Congress on Evolutionary Computation, 2006, CEC 2006, Vancouver, BC, Canada, pp. 1157\u20131163, July 2006.","DOI":"10.1109\/CEC.2006.1688440"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_017_w2aab3b7b9b1b6b1ab1b6c17Aa","doi-asserted-by":"crossref","unstructured":"H. C. Gomes, F. de Assis das Neves and M. J. F. Souza, Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations, Comput. Oper. Res.44 (2014), 92\u2013104.10.1016\/j.cor.2013.11.002","DOI":"10.1016\/j.cor.2013.11.002"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_018_w2aab3b7b9b1b6b1ab1b6c18Aa","doi-asserted-by":"crossref","unstructured":"W. J. Gutjahr, Bi-objective multi-mode project scheduling under risk aversion, Eur. J. Oper. Res.246 (2015), 421\u2013434.10.1016\/j.ejor.2015.05.004","DOI":"10.1016\/j.ejor.2015.05.004"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_019_w2aab3b7b9b1b6b1ab1b6c19Aa","doi-asserted-by":"crossref","unstructured":"Q. Jia and Y. Seo, Solving resource-constrained project scheduling problems: conceptual validation of {FLP} formulation and efficient permutation-based {ABC} computation, Comput. Oper. Res.40 (2013), 2037\u20132050.10.1016\/j.cor.2013.02.012","DOI":"10.1016\/j.cor.2013.02.012"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_020_w2aab3b7b9b1b6b1ab1b6c20Aa","doi-asserted-by":"crossref","unstructured":"S. Khalili, A. A. Najafi and S. T. A. Niaki, Bi-objective resource constrained project scheduling problem with makespan and net present value criteria: two meta-heuristic algorithms, Int. J. Adv. Manuf. Technol.69 (2013), 617\u2013626.10.1007\/s00170-013-5057-z","DOI":"10.1007\/s00170-013-5057-z"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_021_w2aab3b7b9b1b6b1ab1b6c21Aa","doi-asserted-by":"crossref","unstructured":"K. Kim, Y. Yun, J. Yoon, M. Gen and G. Yamazaki, Hybrid genetic algorithm with adaptive abilities for resource-constrained multiple project scheduling, Comput. Ind.56 (2005), 143\u2013160.10.1016\/j.compind.2004.06.006","DOI":"10.1016\/j.compind.2004.06.006"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_022_w2aab3b7b9b1b6b1ab1b6c22Aa","doi-asserted-by":"crossref","unstructured":"R. Klein, Project scheduling with time-varying resource constraints, Int. J. Prod. Res.38 (2000), 3937\u20133952.10.1080\/00207540050176094","DOI":"10.1080\/00207540050176094"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_023_w2aab3b7b9b1b6b1ab1b6c23Aa","doi-asserted-by":"crossref","unstructured":"O. Kon\u00e9, C. Artigues, P. Lopez and M. Mongeau, Event-based MILP models for resource-constrained project scheduling problems, Comput. Oper. Res.38 (2011), 3\u201313.10.1016\/j.cor.2009.12.011","DOI":"10.1016\/j.cor.2009.12.011"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_024_w2aab3b7b9b1b6b1ab1b6c24Aa","doi-asserted-by":"crossref","unstructured":"M. Kostreva, W. Ogryczak and A. Wierzbick, Equitable aggregation and multiple criteria analysis, Eur. J. Oper. Res.158 (2004), 362\u2013377.10.1016\/j.ejor.2003.06.010","DOI":"10.1016\/j.ejor.2003.06.010"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_025_w2aab3b7b9b1b6b1ab1b6c25Aa","doi-asserted-by":"crossref","unstructured":"A. Mingozzi, V. Maniezzo, S. Ricciardelli and L. Bianco, An exact algorithm for the resource constrained project scheduling problem based on a new mathematical formulation, Manage. Sci.44 (1998), 714\u2013729.10.1287\/mnsc.44.5.714","DOI":"10.1287\/mnsc.44.5.714"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_026_w2aab3b7b9b1b6b1ab1b6c26Aa","doi-asserted-by":"crossref","unstructured":"A. Moghaddam, F. Yalaoui and L. Amodeo, Lorenz versus Pareto dominance in a single machine scheduling problem with rejection, in: Evolutionary Multi-criterion Optimization: 6th International Conference, EMO 2011, Ouro Preto, Brazil, April 5\u20138, 2011, Proceedings, pp. 520\u2013534, Springer, Berlin, 2011.","DOI":"10.1007\/978-3-642-19893-9_36"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_027_w2aab3b7b9b1b6b1ab1b6c27Aa","doi-asserted-by":"crossref","unstructured":"K. Neumann and J. Zimmermann, Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints, Eur. J. Oper. Res.127 (2000), 425\u2013443.10.1016\/S0377-2217(99)00498-1","DOI":"10.1016\/S0377-2217(99)00498-1"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_028_w2aab3b7b9b1b6b1ab1b6c28Aa","doi-asserted-by":"crossref","unstructured":"Y. Ouazene, F. Yalaoui, H. Chehade and A. Yalaoui, Workload balancing in identical parallel machine scheduling using a mathematical programming method, Int. J. Comput. Intell. Syst.7 (2014), 58\u201367.10.1080\/18756891.2013.853932","DOI":"10.1080\/18756891.2013.853932"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_029_w2aab3b7b9b1b6b1ab1b6c29Aa","doi-asserted-by":"crossref","unstructured":"V. V. Peteghem and M. Vanhoucke, A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem, Eur. J. Oper. Res.201 (2010), 409\u2013418.10.1016\/j.ejor.2009.03.034","DOI":"10.1016\/j.ejor.2009.03.034"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_030_w2aab3b7b9b1b6b1ab1b6c30Aa","doi-asserted-by":"crossref","unstructured":"A. A. B. Pritsker, L. J. Watters and P. M. Wolfe, Multiproject scheduling with limited resources: a zero-one programming approach, Manage. Sci.16 (1969), 93\u2013108.10.1287\/mnsc.16.1.93","DOI":"10.1287\/mnsc.16.1.93"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_031_w2aab3b7b9b1b6b1ab1b6c31Aa","doi-asserted-by":"crossref","unstructured":"R. Sirdey, J. Carlier and D. Nace, Approximate solution of a resource-constrained scheduling problem, J. Heuristics15 (2007), 1\u201317.","DOI":"10.1007\/s10732-007-9052-0"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_032_w2aab3b7b9b1b6b1ab1b6c32Aa","doi-asserted-by":"crossref","unstructured":"S. C. Vanucci, R. Bicalho, E. G. Carrano and R.H.C. Takahashi, A modified NSGA-II for the multiobjective multi-mode resource-constrained project scheduling problem, in: 2012 IEEE Congress on Evolutionary Computation (CEC), Brisbane, Australia, pp. 1\u20137, 2012.","DOI":"10.1109\/CEC.2012.6256616"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_033_w2aab3b7b9b1b6b1ab1b6c33Aa","doi-asserted-by":"crossref","unstructured":"X. Wang, F. Dugardin and F. Yalaoui, An exact method to solve a bi-objective resource constraint project scheduling problem, in: 8th IFAC Conference on Manufacturing Modelling, Management and Control, France, June 2016.","DOI":"10.1016\/j.ifacol.2016.07.579"},{"key":"2025120523294075598_j_jisys-2017-0241_ref_034_w2aab3b7b9b1b6b1ab1b6c34Aa","doi-asserted-by":"crossref","unstructured":"E. Zitzler, L. Thiele, M. Laumanns, C. M. Fonseca and V. G. da Fonseca, Performance assessment of multiobjective optimizers: an analysis and review, IEEE Trans. Evol. Comput.7 (2003), 117\u2013132.10.1109\/TEVC.2003.810758","DOI":"10.1109\/TEVC.2003.810758"}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/jisys.2019.28.issue-5\/jisys-2017-0241\/jisys-2017-0241.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2017-0241\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2017-0241\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:29:55Z","timestamp":1764977395000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2017-0241\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,23]]},"references-count":34,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2017,10,25]]},"published-print":{"date-parts":[[2019,9,25]]}},"alternative-id":["10.1515\/jisys-2017-0241"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2017-0241","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"type":"electronic","value":"2191-026X"},{"type":"print","value":"0334-1860"}],"subject":[],"published":{"date-parts":[[2017,10,23]]}}}