{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:17:36Z","timestamp":1750220256600,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T00:00:00Z","timestamp":1653609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,27]]},"DOI":"10.1145\/3545801.3545810","type":"proceedings-article","created":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T16:11:58Z","timestamp":1662739918000},"page":"58-66","source":"Crossref","is-referenced-by-count":1,"title":["Different Approaches of Evolutionary Algorithms to Multiple Objective RCPSP"],"prefix":"10.1145","author":[{"given":"Son Tung","family":"Ngo","sequence":"first","affiliation":[{"name":"Department of Computer and Information Sciences, Universiti Teknologi Petronas, Malaysia and \rICT Department, FPT University, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jafreezal","family":"Jaafar","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Sciences, Universiti Teknologi Petronas, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Izzatdin Abdul","family":"Aziz","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Sciences, Universiti Teknologi Petronas, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giang Truong","family":"Tong","sequence":"additional","affiliation":[{"name":"ICT Department, FPT University, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giang Hoang","family":"Nguyen","sequence":"additional","affiliation":[{"name":"ICT Department, FPT University, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anh Ngoc","family":"Bui","sequence":"additional","affiliation":[{"name":"ICT Department, FPT University, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,9,9]]},"reference":[{"issue":"3","key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","first-page":"3429","DOI":"10.32604\/cmc.2021.017710","article-title":"A Compromise Programming to Task Assignment Problem in Software Development Project","volume":"69","author":"Tung Son N.","year":"2021","unstructured":"Tung Son , N. , Jaafar , J. , Abdul Aziz , I. , Ngoc Anh , B. , Duc Binh , H. , & Umar Aftab , M. ( 2021 ). A Compromise Programming to Task Assignment Problem in Software Development Project . Computers, Materials & Continua , 69 ( 3 ), 3429 \u2013 3444 . https:\/\/doi.org\/10.32604\/cmc.2021.017710. Tung Son, N., Jaafar, J., Abdul Aziz, I., Ngoc Anh, B., Duc Binh, H., & Umar Aftab, M. (2021). A Compromise Programming to Task Assignment Problem in Software Development Project. Computers, Materials & Continua, 69(3), 3429\u20133444. https:\/\/doi.org\/10.32604\/cmc.2021.017710.","journal-title":"Computers, Materials & Continua"},{"volume-title":"Journal of Project Management","author":"Ben T.","unstructured":"I. S. Ben and T. Yiliu , \u201c A survey in the resource-constrained project and multi-project scheduling problems ,\u201d Journal of Project Management , vol. 5 , no. 2, pp. 117\u2013138, 2020. I. S. Ben and T. Yiliu, \u201cA survey in the resource-constrained project and multi-project scheduling problems,\u201d Journal of Project Management, vol. 5, no. 2, pp. 117\u2013138, 2020.","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","volume-title":"An updated survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research. https:\/\/doi.org\/10.1016\/j.ejor.2021.05.004","author":"Hartmann S.","year":"2021","unstructured":"Hartmann , S. , & Briskorn , D. ( 2021 ). An updated survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research. https:\/\/doi.org\/10.1016\/j.ejor.2021.05.004 Hartmann, S., & Briskorn, D. (2021). An updated survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research. https:\/\/doi.org\/10.1016\/j.ejor.2021.05.004"},{"volume-title":"Journal of Project Management","author":"Habibi F.","unstructured":"F. Habibi , F. Barzinpour and S. J. Sadjadi ,\u00a0 \u201cResource-constrained project scheduling problem: review of past and recent developments ,\u201d Journal of Project Management , vol. 3 , no. 2, pp. 55\u201388, 2018. F. Habibi, F. Barzinpour and S. J. Sadjadi,\u00a0\u201cResource-constrained project scheduling problem: review of past and recent developments,\u201d Journal of Project Management, vol. 3, no. 2, pp. 55\u201388, 2018.","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","volume-title":"A novel algorithm for solving resource-constrained project scheduling problems: a case study. Journal of Advances in Management Research, 16(2). https:\/\/doi.org\/10.1108\/JAMR-03-2018-0033","author":"Kasravi M.","year":"2019","unstructured":"Kasravi , M. , Mahmoudi , A. , & Feylizadeh , M. R. ( 2019 ). A novel algorithm for solving resource-constrained project scheduling problems: a case study. Journal of Advances in Management Research, 16(2). https:\/\/doi.org\/10.1108\/JAMR-03-2018-0033 Kasravi, M., Mahmoudi, A., & Feylizadeh, M. R. (2019). A novel algorithm for solving resource-constrained project scheduling problems: a case study. Journal of Advances in Management Research, 16(2). https:\/\/doi.org\/10.1108\/JAMR-03-2018-0033"},{"doi-asserted-by":"crossref","unstructured":"de Azevedo G. H. I. Pessoa A. A. & Subramanian A. (2021). A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints. European Journal of Operational Research 289(3). https:\/\/doi.org\/10.1016\/j.ejor.2019.07.056  de Azevedo G. H. I. Pessoa A. A. & Subramanian A. (2021). A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints. European Journal of Operational Research 289(3). https:\/\/doi.org\/10.1016\/j.ejor.2019.07.056","key":"e_1_3_2_1_6_1","DOI":"10.1016\/j.ejor.2019.07.056"},{"key":"e_1_3_2_1_7_1","volume-title":"A Parallel Branch and Bound Algorithm for the Resource Leveling Problem with Minimal Lags. Computer-Aided Civil and Infrastructure Engineering, 32(6). https:\/\/doi.org\/10.1111\/mice.12233","author":"Ponz-Tienda J. L.","year":"2017","unstructured":"Ponz-Tienda , J. L. , Salcedo-Bernal , A. , & Pellicer , E. ( 2017 ). A Parallel Branch and Bound Algorithm for the Resource Leveling Problem with Minimal Lags. Computer-Aided Civil and Infrastructure Engineering, 32(6). https:\/\/doi.org\/10.1111\/mice.12233 Ponz-Tienda, J. L., Salcedo-Bernal, A., & Pellicer, E. (2017). A Parallel Branch and Bound Algorithm for the Resource Leveling Problem with Minimal Lags. Computer-Aided Civil and Infrastructure Engineering, 32(6). https:\/\/doi.org\/10.1111\/mice.12233"},{"doi-asserted-by":"crossref","unstructured":"Watermeyer K. & Zimmermann J. (2020). A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints. OR Spectrum 42(2). https:\/\/doi.org\/10.1007\/s00291-020-00583-z  Watermeyer K. & Zimmermann J. (2020). A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints. OR Spectrum 42(2). https:\/\/doi.org\/10.1007\/s00291-020-00583-z","key":"e_1_3_2_1_8_1","DOI":"10.1007\/s00291-020-00583-z"},{"key":"e_1_3_2_1_9_1","volume-title":"Consolidated optimization algorithm for resource-constrained project scheduling problems. Information Sciences, 418\u2013419. https:\/\/doi.org\/10.1016\/j.ins.2017.08.023","author":"Elsayed S.","year":"2017","unstructured":"Elsayed , S. , Sarker , R. , Ray , T. , & Coello , C. C. ( 2017 ). Consolidated optimization algorithm for resource-constrained project scheduling problems. Information Sciences, 418\u2013419. https:\/\/doi.org\/10.1016\/j.ins.2017.08.023 Elsayed, S., Sarker, R., Ray, T., & Coello, C. C. (2017). Consolidated optimization algorithm for resource-constrained project scheduling problems. Information Sciences, 418\u2013419. https:\/\/doi.org\/10.1016\/j.ins.2017.08.023"},{"key":"e_1_3_2_1_10_1","volume-title":"The Scientific World Journal, 2014","author":"Abello M. B.","year":"2014","unstructured":"Abello , M. B. , & Michalewicz , Z. ( 2014 ). Multiobjective Resource-Constrained Project Scheduling with a Time-Varying Number of Tasks . The Scientific World Journal, 2014 . https:\/\/doi.org\/10.1155\/2014\/420101 Abello, M. B., & Michalewicz, Z. (2014). Multiobjective Resource-Constrained Project Scheduling with a Time-Varying Number of Tasks. The Scientific World Journal, 2014. https:\/\/doi.org\/10.1155\/2014\/420101"},{"key":"e_1_3_2_1_11_1","volume-title":"Scheduling resource-constrained projects with a flexible project structure. European Journal of Operational Research, 246(2). https:\/\/doi.org\/10.1016\/j.ejor.2015.05.003","author":"Kellenbrink C.","year":"2015","unstructured":"Kellenbrink , C. , & Helber , S. ( 2015 ). Scheduling resource-constrained projects with a flexible project structure. European Journal of Operational Research, 246(2). https:\/\/doi.org\/10.1016\/j.ejor.2015.05.003 . Kellenbrink, C., & Helber, S. (2015). Scheduling resource-constrained projects with a flexible project structure. European Journal of Operational Research, 246(2). https:\/\/doi.org\/10.1016\/j.ejor.2015.05.003."},{"key":"e_1_3_2_1_12_1","volume-title":"F.","author":"Gomes H. C.","year":"2014","unstructured":"Gomes , H. C. , de Assis das Neves , F. , & Souza, M. J. F. ( 2014 ). Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations. Computers & Operations Research , 44. https:\/\/doi.org\/10.1016\/j.cor.2013.11.002. Gomes, H. C., de Assis das Neves, F., & Souza, M. J. F. (2014). Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations. Computers & Operations Research, 44. https:\/\/doi.org\/10.1016\/j.cor.2013.11.002."},{"key":"e_1_3_2_1_13_1","volume-title":"Integration of electromagnetism with multi-objective evolutionary algorithms for RCPSP. European Journal of Operational Research, 251(1). https:\/\/doi.org\/10.1016\/j.ejor.2015.10.059","author":"Xiao J.","year":"2016","unstructured":"Xiao , J. , Wu , Z. , Hong , X.-X. , Tang , J.-C. , & Tang , Y. ( 2016 ). Integration of electromagnetism with multi-objective evolutionary algorithms for RCPSP. European Journal of Operational Research, 251(1). https:\/\/doi.org\/10.1016\/j.ejor.2015.10.059 Xiao, J., Wu, Z., Hong, X.-X., Tang, J.-C., & Tang, Y. (2016). Integration of electromagnetism with multi-objective evolutionary algorithms for RCPSP. European Journal of Operational Research, 251(1). https:\/\/doi.org\/10.1016\/j.ejor.2015.10.059"},{"key":"e_1_3_2_1_14_1","volume-title":"A review of multi-objective optimization: Methods and its applications. Cogent Engineering, 5(1). https:\/\/doi.org\/10.1080\/23311916.2018.1502242","author":"Gunantara N.","year":"2018","unstructured":"Gunantara , N. ( 2018 ). A review of multi-objective optimization: Methods and its applications. Cogent Engineering, 5(1). https:\/\/doi.org\/10.1080\/23311916.2018.1502242 . Gunantara, N. (2018). A review of multi-objective optimization: Methods and its applications. Cogent Engineering, 5(1). https:\/\/doi.org\/10.1080\/23311916.2018.1502242."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1007\/s00500-017-2965-0"},{"volume-title":"Search Methodologies (pp. 273\u2013316)","author":"Deb K.","unstructured":"Deb , K. (n.d.). Multi-Objective Optimization . In Search Methodologies (pp. 273\u2013316) . Springer US. https:\/\/doi.org\/10.1007\/0-387-28356-0_10. Deb, K. (n.d.). Multi-Objective Optimization. In Search Methodologies (pp. 273\u2013316). Springer US. https:\/\/doi.org\/10.1007\/0-387-28356-0_10.","key":"e_1_3_2_1_16_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1007\/s40747-018-0080-1"},{"key":"e_1_3_2_1_18_1","volume-title":"2019 Evolutionary Algorithms Review. https:\/\/doi.org\/10.1007\/978-3-030-39958-0_16","author":"Sloss A. N.","year":"2020","unstructured":"Sloss , A. N. , & Gustafson , S. ( 2020 ). 2019 Evolutionary Algorithms Review. https:\/\/doi.org\/10.1007\/978-3-030-39958-0_16 Sloss, A. N., & Gustafson, S. (2020). 2019 Evolutionary Algorithms Review. https:\/\/doi.org\/10.1007\/978-3-030-39958-0_16"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1016\/j.swevo.2018.04.011"},{"key":"e_1_3_2_1_20_1","volume-title":"International Journal of Industrial Engineering Computations, 359\u2013376. https:\/\/doi.org\/10.5267\/j.ijiec.2020.1.003","author":"Ojstersek R.","year":"2020","unstructured":"Ojstersek , R. , Brezocnik , M. , & Buchmeister , B. ( 2020 ). Multi-objective optimization of production scheduling with evolutionary computation: A review . International Journal of Industrial Engineering Computations, 359\u2013376. https:\/\/doi.org\/10.5267\/j.ijiec.2020.1.003 Ojstersek, R., Brezocnik, M., & Buchmeister, B. (2020). Multi-objective optimization of production scheduling with evolutionary computation: A review. International Journal of Industrial Engineering Computations, 359\u2013376. https:\/\/doi.org\/10.5267\/j.ijiec.2020.1.003"},{"key":"e_1_3_2_1_21_1","volume-title":"2021 4th International Conference on Information Management and Management Science (IMMS 2021)","author":"Tung Son Ngo","year":"2021","unstructured":"Tung Son Ngo , Jafreezal Jaafar, Izzatdin Abdul Aziz and Hoang Giang Nguyen. 2021 . Introduction to A Compromise Programming Based Method for Complex Scheduling and Planning Problems . In 2021 4th International Conference on Information Management and Management Science (IMMS 2021) , August 27-29, 2021, Chengdu, China. ACM, New York, NY, USA, 11 Pages. https:\/\/doi.org\/10.1145\/3485190.3485231. Tung Son Ngo, Jafreezal Jaafar, Izzatdin Abdul Aziz and Hoang Giang Nguyen. 2021. Introduction to A Compromise Programming Based Method for Complex Scheduling and Planning Problems. In 2021 4th International Conference on Information Management and Management Science (IMMS 2021), August 27-29, 2021, Chengdu, China. ACM, New York, NY, USA, 11 Pages. https:\/\/doi.org\/10.1145\/3485190.3485231."},{"key":"e_1_3_2_1_22_1","volume-title":"Meta-Heuristic Algorithms for Learning Path Recommender at MOOC","author":"Son N. T.","year":"2021","unstructured":"Son , N. T. , Jaafar , J. , Aziz , I. A. , & Anh , B. N. ( 2021 ). Meta-Heuristic Algorithms for Learning Path Recommender at MOOC . IEEE Access , 1\u20131. https:\/\/doi.org\/10.1109\/ACCESS.2021.3072222. Son, N. T., Jaafar, J., Aziz, I. A., & Anh, B. N. (2021). Meta-Heuristic Algorithms for Learning Path Recommender at MOOC. IEEE Access, 1\u20131. https:\/\/doi.org\/10.1109\/ACCESS.2021.3072222."},{"key":"e_1_3_2_1_23_1","volume-title":"Phan Lac Duong, and Bui Ngoc Anh.","author":"Ngo Tung Son","year":"2021","unstructured":"Ngo Tung Son , Jafreezal Jaafar , Doan Van Thang , Phan Lac Duong, and Bui Ngoc Anh. 2021 . The Effectiveness of Reference Point Selection Methods for Compromise Programming in Multi-Criteria Learning Path Search Algorithm. In 2021 4th International Conference on Information Management and Management Science (IMMS 2021), August 27\u201329, 2021, Chengdu, China. ACM, New York, NY, USA , 7 pages. https:\/\/doi.org\/10.1145\/3485190.3485236. Ngo Tung Son, Jafreezal Jaafar, Doan Van Thang, Phan Lac Duong, and Bui Ngoc Anh. 2021. The Effectiveness of Reference Point Selection Methods for Compromise Programming in Multi-Criteria Learning Path Search Algorithm. In 2021 4th International Conference on Information Management and Management Science (IMMS 2021), August 27\u201329, 2021, Chengdu, China. ACM, New York, NY, USA, 7 pages. https:\/\/doi.org\/10.1145\/3485190.3485236."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.3991\/ijet.v16i11.21017"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.3390\/computers10020015"},{"key":"e_1_3_2_1_26_1","volume-title":"2021 10th International Conference on Software and Computer Applications (ICSCA","author":"Son Tung Ngo","year":"2021","unstructured":"Son Tung Ngo , Jaafar Jafreezal, Giang Hoang Nguyen , and Anh Ngoc Bui. 2021 . \u00a0A Genetic Algorithm for Multi-Objective Optimization in Complex Course Timetabling . In 2021 10th International Conference on Software and Computer Applications (ICSCA 2021). Association for Computing Machinery, New York, NY, USA, 229\u2013237. DOI:https:\/\/doi.org\/10.1145\/3457784.3457821 Son Tung Ngo, Jaafar Jafreezal, Giang Hoang Nguyen, and Anh Ngoc Bui. 2021.\u00a0A Genetic Algorithm for Multi-Objective Optimization in Complex Course Timetabling. In 2021 10th International Conference on Software and Computer Applications (ICSCA 2021). Association for Computing Machinery, New York, NY, USA, 229\u2013237. DOI:https:\/\/doi.org\/10.1145\/3457784.3457821"},{"key":"e_1_3_2_1_27_1","volume-title":"Some Algorithms to Solve a Bi-Objectives Problem for Team Selection. Appl. Sci","author":"Ngo T.S.","year":"2020","unstructured":"Ngo , T.S. ; Bui , N.A. ; Tran , T.T. ; Le , P.C. ; Bui , D.C. ; Nguyen , T.D. ; Phan , L.D. ; Kieu , Q.T. ; Nguyen , B.S. ; Tran , S.N. Some Algorithms to Solve a Bi-Objectives Problem for Team Selection. Appl. Sci . 2020 , 10, 2700. Ngo, T.S.; Bui, N.A.; Tran, T.T.; Le, P.C.; Bui, D.C.; Nguyen, T.D.; Phan, L.D.; Kieu, Q.T.; Nguyen, B.S.; Tran, S.N. Some Algorithms to Solve a Bi-Objectives Problem for Team Selection. Appl. Sci. 2020, 10, 2700."},{"issue":"3","key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","first-page":"388","DOI":"10.3390\/e24030388","article-title":"Metaheuristic Algorithms Based on Compromise Programming for the Multi-Objective Urban Shipment Problem","volume":"24","author":"Ngo S.","year":"2022","unstructured":"Ngo , Tung S. , Jafreezal Jaafar , Izzatdin A. Aziz , Muhammad U. Aftab , Hoang G. Nguyen , and Ngoc A. Bui . 2022 . \" Metaheuristic Algorithms Based on Compromise Programming for the Multi-Objective Urban Shipment Problem \" Entropy 24 , no. 3 : 388 . https:\/\/doi.org\/10.3390\/e24030388 Ngo, Tung S., Jafreezal Jaafar, Izzatdin A. Aziz, Muhammad U. Aftab, Hoang G. Nguyen, and Ngoc A. Bui. 2022. \"Metaheuristic Algorithms Based on Compromise Programming for the Multi-Objective Urban Shipment Problem\" Entropy 24, no. 3: 388. https:\/\/doi.org\/10.3390\/e24030388","journal-title":"Entropy"},{"issue":"11","key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","first-page":"2018","DOI":"10.3390\/math8112018","article-title":"Comparison between Single and Multi-Objective Evolutionary Algorithms to Solve the Knapsack Problem and the Travelling Salesman Problem","volume":"8","author":"Mahrach M.","year":"2020","unstructured":"Mahrach , M. , Miranda , G. , Le\u00f3n , C. , & Segredo , E. ( 2020 ). Comparison between Single and Multi-Objective Evolutionary Algorithms to Solve the Knapsack Problem and the Travelling Salesman Problem . Mathematics , 8 ( 11 ), 2018 . https:\/\/doi.org\/10.3390\/math8112018 Mahrach, M., Miranda, G., Le\u00f3n, C., & Segredo, E. (2020). Comparison between Single and Multi-Objective Evolutionary Algorithms to Solve the Knapsack Problem and the Travelling Salesman Problem. Mathematics, 8(11), 2018. https:\/\/doi.org\/10.3390\/math8112018","journal-title":"Mathematics"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1007\/s00500-017-2965-0"}],"event":{"acronym":"ICBDC 2022","name":"ICBDC 2022: 2022 7th International Conference on Big Data and Computing","location":"Shenzhen China"},"container-title":["2022 7th International Conference on Big Data and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545801.3545810","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3545801.3545810","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:47Z","timestamp":1750188647000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545801.3545810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,27]]},"references-count":30,"alternative-id":["10.1145\/3545801.3545810","10.1145\/3545801"],"URL":"https:\/\/doi.org\/10.1145\/3545801.3545810","relation":{},"subject":[],"published":{"date-parts":[[2022,5,27]]}}}