{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T05:14:06Z","timestamp":1777180446983,"version":"3.51.4"},"reference-count":70,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T00:00:00Z","timestamp":1714262400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Resource Constraint Project Scheduling Problems with Discounted Cash Flows (RCPSPDC) focuses on maximizing the net present value by summing the discounted cash flows of project activities. An extension of this problem is the Payment at Event Occurrences (PEO) scheme, where the client makes multiple payments to the contractor upon completion of predefined activities, with additional final settlement at project completion. Numerous approximation methods such as metaheuristics have been proposed to solve this NP-hard problem. However, these methods suffer from parameter control and\/or the computational cost of correcting infeasible solutions. Alternatively, approximate dynamic programming (ADP) sequentially generates a schedule based on strategies computed via Monte Carlo (MC) simulations. This saves the computations required for solution corrections, but its performance is highly dependent on its strategy. In this study, we propose the hybridization of ADP with three different metaheuristics to take advantage of their combined strengths, resulting in six different models. The Estimation of Distribution Algorithm (EDA) and Ant Colony Optimization (ACO) were used to recommend policies for ADP. A Discrete cCuckoo Search (DCS) further improved the schedules generated by ADP. Our experimental analysis performed on the j30, j60, and j90 datasets of PSPLIB has shown that ADP\u2013DCS is better than ADP alone. Implementing the EDA and ACO as prioritization strategies for Monte Carlo simulations greatly improved the solutions with high statistical significance. In addition, models with the EDA showed better performance than those with ACO and random priority, especially when the number of events increased.<\/jats:p>","DOI":"10.3390\/a17050180","type":"journal-article","created":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T06:13:22Z","timestamp":1714371202000},"page":"180","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Maximizing Net Present Value for Resource Constraint Project Scheduling Problems with Payments at Event Occurrences Using Approximate Dynamic Programming"],"prefix":"10.3390","volume":"17","author":[{"given":"Tshewang","family":"Phuntsho","sequence":"first","affiliation":[{"name":"Department of Information and Computer Sciences, Sophia University, Chiyoda-ku, Tokyo 102-8554, Japan"},{"name":"Gedu College of Business Studies, Royal University of Bhutan, Bongo, Chukha P.O. Box 21006, Bhutan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9424-3078","authenticated-orcid":false,"given":"Tad","family":"Gonsalves","sequence":"additional","affiliation":[{"name":"Department of Information and Computer Sciences, Sophia University, Chiyoda-ku, Tokyo 102-8554, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,4,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Phuntsho, T., and Gonsalves, T. (2022, January 17\u201319). Hybrid of Simplified Small World and Group Counseling Optimization Algorithms with Matured Random Initialization and Variable Insertion Neighborhood Search Technique to Solve Resource Constrained Project Scheduling Problems with Discounted Cash Flows. Proceedings of the 2022 5th Artificial Intelligence and Cloud Computing Conference, Osaka, Japan.","DOI":"10.1145\/3582099.3582110"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Klimek, M. (2021). Financial Optimization of the Resource-Constrained Project Scheduling Problem with Milestones Payments. Appl. Sci., 11.","DOI":"10.3390\/app11020661"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1287\/mnsc.1040.0319","article-title":"The Impact of Contractor Behavior on the Client\u2019s Payment-Scheduling Problem","volume":"51","author":"Szmerekovsky","year":"2005","journal-title":"Manag. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1016\/j.ejor.2003.10.053","article-title":"Simulated Annealing and Tabu Search for Multi-Mode Resource-Constrained Project Scheduling with Positive Discounted Cash Flows and Different Payment Models","volume":"164","author":"Mika","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1023\/A:1010914417817","article-title":"Four Payment Models for the Multi-Mode Resource Constrained Project Scheduling Problem with Discounted Cash Flows","volume":"102","author":"Ulusoy","year":"2001","journal-title":"Ann. Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.cie.2015.11.008","article-title":"Payment Models and Net Present Value Optimization for Resource-Constrained Project Scheduling","volume":"91","author":"Leyman","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1016\/S0377-2217(02)00452-6","article-title":"Progress Payments in Project Scheduling Problems","volume":"148","author":"Vanhoucke","year":"2003","journal-title":"Eur. J. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1016\/0377-2217(95)00088-7","article-title":"Identifying Pareto-Optimal Settlements for Two-Party Resource Allocation Negotiations","volume":"93","author":"Teich","year":"1996","journal-title":"Eur. J. Oper. Res."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1023\/A:1012297813663","article-title":"Interactive Multiple-Criteria Methods for Reaching Pareto Optimal Agreements in Negotiations","volume":"10","author":"Ehtamo","year":"2001","journal-title":"Group Decis. Negot."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1654","DOI":"10.1287\/mnsc.47.12.1654.10242","article-title":"Project Contracts and Payment Schedules: The Client\u2019s Problem","volume":"47","author":"Dayanand","year":"2001","journal-title":"Manag. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s00170-012-4023-5","article-title":"Study of Payment Scheduling Problem to Achieve Client\u2013Contractor Agreement","volume":"64","author":"Bahrami","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2771","DOI":"10.1080\/00207543.2014.980463","article-title":"A New Scheduling Technique for the Resource\u2013Constrained Project Scheduling Problem with Discounted Cash Flows","volume":"53","author":"Leyman","year":"2015","journal-title":"Int. J. Prod. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"116589","DOI":"10.1016\/j.eswa.2022.116589","article-title":"Multi-Operator Immune Genetic Algorithm for Project Scheduling with Discounted Cash Flows","volume":"195","author":"Asadujjaman","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/978-3-319-91086-4_12","article-title":"Metaheuristic Hybrids","volume":"Volume 272","author":"Gendreau","year":"2019","journal-title":"Handbook of Metaheuristics"},{"key":"ref_15","first-page":"71","article-title":"Hybrid Metaheuristic Algorithms: Past, Present, and Future","volume":"Volume 585","author":"Yang","year":"2015","journal-title":"Recent Advances in Swarm Intelligence and Evolutionary Computation"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/11890584_1","article-title":"A Unified View on Hybrid Metaheuristics","volume":"Volume 4030","author":"Almeida","year":"2006","journal-title":"Hybrid Metaheuristics"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-3-319-67669-2_2","article-title":"A Review of No Free Lunch Theorems, and Their Implications for Metaheuristic Optimisation","volume":"Volume 744","author":"Yang","year":"2018","journal-title":"Nature-Inspired Algorithms and Applied Optimization"},{"key":"ref_18","unstructured":"Puterman, M.L. (2014). Markov Decision Processes: Discrete Stochastic Dynamic Programming, John Wiley & Sons."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.ejor.2015.04.015","article-title":"Solving Stochastic Resource-Constrained Project Scheduling Problems by Closed-Loop Approximate Dynamic Programming","volume":"246","author":"Li","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1016\/j.ejor.2017.07.017","article-title":"A Markov Decision Process Model for Equitable Distribution of Supplies under Uncertainty","volume":"264","author":"Fianu","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ejor.2008.03.023","article-title":"An Approximate Dynamic Programming Approach for the Vehicle Routing Problem with Stochastic Demands","volume":"196","author":"Novoa","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/j.apm.2021.03.048","article-title":"An Approximate Dynamic Programming Approach to Project Scheduling with Uncertain Resource Availabilities","volume":"97","author":"Xie","year":"2021","journal-title":"Appl. Math. Model."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"26177","DOI":"10.1109\/ACCESS.2021.3057366","article-title":"An Immune Genetic Algorithm for Solving NPV-Based Resource Constrained Project Scheduling Problem","volume":"9","author":"Asadujjaman","year":"2021","journal-title":"IEEE Access"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1983","DOI":"10.1080\/00207540802010781","article-title":"A Scatter Search Heuristic for Maximising the Net Present Value of a Resource-Constrained Project with Fixed Activity Cash Flows","volume":"48","author":"Vanhoucke","year":"2010","journal-title":"Int. J. Prod. Res."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Powell, W.B. (2011). Approximate Dynamic Programming: Solving the Curses of Dimensionality, John Wiley & Sons.","DOI":"10.1002\/9781118029176"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Bibiks, K., Hu, F., Li, J.-P., and Smith, A. (2015, January 21\u201323). Discrete Cuckoo Search for Resource Constrained Project Scheduling Problem. Proceedings of the 2015 IEEE 18th International Conference on Computational Science and Engineering, Porto, Portugal.","DOI":"10.1109\/CSE.2015.39"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/j.asoc.2018.04.047","article-title":"Improved Discrete Cuckoo Search for the Resource-Constrained Project Scheduling Problem","volume":"69","author":"Bibiks","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Quoc, H.D., Nguyen The, L., Doan, C.N., and Phan Thanh, T. (2019, January 12\u201313). Solving Resource Constrained Project Scheduling Problem by a Discrete Version of Cuckoo Search Algorithm. Proceedings of the 2019 6th NAFOSTED Conference on Information and Computer Science (NICS), Hanoi, Vietnam.","DOI":"10.1109\/NICS48868.2019.9023867"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/j.cor.2011.05.008","article-title":"An Effective Estimation of Distribution Algorithm for the Multi-Mode Resource-Constrained Project Scheduling Problem","volume":"39","author":"Wang","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s10696-015-9210-x","article-title":"An Estimation of Distribution Algorithm and New Computational Results for the Stochastic Resource-Constrained Project Scheduling Problem","volume":"27","author":"Fang","year":"2015","journal-title":"Flex. Serv. Manuf. J."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/TEVC.2002.802450","article-title":"Ant Colony Optimization for Resource-Constrained Project Scheduling","volume":"6","author":"Merkle","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Zhao, J.-C., Zhang, Y.-M., Qu, H.-Y., and Qi, H. (2009, January 23\u201324). Ant Colony Optimization for Resource-Constrained Multi-Project Scheduling. Proceedings of the 2009 International Workshop on Intelligent Systems and Applications, Wuhan, China.","DOI":"10.1109\/IWISA.2009.5072736"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1111\/j.1540-5915.1987.tb01550.x","article-title":"Using a late-start resource-constrained project schedule to improve project net present value","volume":"18","author":"Aquilano","year":"1987","journal-title":"Decis. Sci."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Phuntsho, T., and Gonsalves, T. (2023, January 5\u20137). Maximizing the Net Present Value of Resource-Constrained Project Scheduling Problems Using Recurrent Neural Network with Genetic Algorithm. Proceedings of the 2023 International Conference on Intelligent Data Communication Technologies and Internet of Things (IDCIoT), Bengaluru, India.","DOI":"10.1109\/IDCIoT56793.2023.10053390"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"2365","DOI":"10.4304\/jcp.6.11.2365-2375","article-title":"A Serial Insertion Schedule Generation Scheme for Resource-Constrained Project Scheduling","volume":"6","author":"Liu","year":"2011","journal-title":"J. Comput."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1061\/(ASCE)0733-9364(2010)136:2(160)","article-title":"Comparing Schedule Generation Schemes in Resource-Constrained Project Scheduling Using Elitist Genetic Algorithm","volume":"136","author":"Kim","year":"2010","journal-title":"J. Constr. Eng. Manag."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Kim, J.-L. (2009). Proposed Methodology for Comparing Schedule Generation Schemes in Construction Resource Scheduling, ACM.","DOI":"10.1109\/WSC.2009.5429252"},{"key":"ref_38","first-page":"794","article-title":"Parallel Mode Schedule Generation Scheme","volume":"48","author":"Pinha","year":"2015","journal-title":"IFAC-Pap."},{"key":"ref_39","unstructured":"Demeulemeester, E., Herroelen, W.S., and Herroelen, W. (2002). Project Scheduling: A Research Handbook, Kluwer Academic Publishers."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1186\/s40467-016-0054-z","article-title":"Uncertain Resource-Constrained Project Scheduling Problem with Net Present Value Criterion","volume":"4","author":"Zhao","year":"2016","journal-title":"J. Uncertain. Anal. Appl."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Phuntsho, T., and Gonsalves, T. (2022, January 9\u201311). Solving NPV-Based Resource Constrained Project Scheduling Problem Using Genetic Algorithm. Proceedings of the 2022 10th International Conference on Information and Education Technology (ICIET), Matsue, Japan.","DOI":"10.1109\/ICIET55102.2022.9779035"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TSMCC.2009.2027335","article-title":"Optimizing Discounted Cash Flows in Project Scheduling\u2014An Ant Colony Optimization Approach","volume":"40","author":"Chen","year":"2010","journal-title":"IEEE Trans. Syst. Man Cybern. Part C Appl. Rev."},{"key":"ref_43","first-page":"340","article-title":"A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects","volume":"Volume 7874","author":"Gomes","year":"2013","journal-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10951-016-0505-x","article-title":"New Strategies for Stochastic Resource-Constrained Project Scheduling","volume":"21","author":"Rostami","year":"2018","journal-title":"J. Sched."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s10951-007-0012-1","article-title":"When It Is Worthwhile to Work with the Stochastic RCPSP?","volume":"10","year":"2007","journal-title":"J. Sched."},{"key":"ref_46","unstructured":"Bertsekas, D.P. (2012). Dynamic Programming and Optimal Control, Athena Scientific. [4th ed.]."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1111\/j.1937-5956.2009.01023.x","article-title":"Resource-Constrained Project Scheduling for Timely Project Completion with Stochastic Activity Durations","volume":"18","author":"Leus","year":"2009","journal-title":"Prod. Oper. Manag."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1016\/j.ejor.2018.04.025","article-title":"Efficient Priority Rules for the Stochastic Resource-Constrained Project Scheduling Problem","volume":"270","author":"Chen","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., Du, D.-Z., and Graham, R.L. (2013). Handbook of Combinatorial Optimization, Springer.","DOI":"10.1007\/978-1-4419-7997-1"},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"1921","DOI":"10.1016\/j.scient.2012.10.034","article-title":"A Discrete Artificial Bee Colony Algorithm with Composite Mutation Strategies for Permutation Flow Shop Scheduling Problem","volume":"19","author":"Li","year":"2012","journal-title":"Sci. Iran."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1016\/j.compchemeng.2003.09.024","article-title":"Dynamic Programming in a Heuristically Confined State Space: A Stochastic Resource-Constrained Project Scheduling Application","volume":"28","author":"Choi","year":"2004","journal-title":"Comput. Chem. Eng."},{"key":"ref_52","unstructured":"Baptiste, P., Le Pape, C., and Nuijten, W. (2013). Constraint-Based Scheduling Applying Constraint Programming to Scheduling Problems, Springer."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","article-title":"Experimental Investigation of Heuristics for Resource-Constrained Project Scheduling: An Update","volume":"174","author":"Kolisch","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"3284","DOI":"10.1016\/j.cor.2007.02.016","article-title":"Augmenting Priority Rule Heuristics with Justification and Rollout to Solve the Resource-Constrained Project Scheduling Problem","volume":"35","author":"Xu","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10951-008-0079-3","article-title":"Scheduling Projects with Multi-Skilled Personnel by a Hybrid MILP\/CP Benders Decomposition Algorithm","volume":"12","author":"Li","year":"2009","journal-title":"J. Sched."},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Sammut, C., and Webb, G.I. (2011). Encyclopedia of Machine Learning, Springer.","DOI":"10.1007\/978-0-387-30164-8"},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.physa.2016.06.083","article-title":"On the Bellman\u2019s Principle of Optimality","volume":"462","author":"Gross","year":"2016","journal-title":"Phys. Stat. Mech. Its Appl."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"105","DOI":"10.4310\/MAA.2010.v17.n1.a4","article-title":"On Bellman\u2019s Equations with VMO Coefficients","volume":"17","author":"Krylov","year":"2010","journal-title":"Methods Appl. Anal."},{"key":"ref_59","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., Du, D., and Graham, R.L. (2013). Handbook of Combinatorial Optimization, Springer. [2nd ed.]. Springer Reference.","DOI":"10.1007\/978-1-4419-7997-1"},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Grobler, J., Engelbrecht, A.P., Kendall, G., and Yadavalli, V.S.S. (2012, January 10\u201315). Investigating the Use of Local Search for Improving Meta-Hyper-Heuristic Performance. Proceedings of the 2012 IEEE Congress on Evolutionary Computation, Brisbane, Australia.","DOI":"10.1109\/CEC.2012.6252970"},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1007\/s10732-018-9381-1","article-title":"Survey and Unification of Local Search Techniques in Metaheuristics for Multi-Objective Combinatorial Optimisation","volume":"24","author":"Blot","year":"2018","journal-title":"J. Heuristics"},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"1290","DOI":"10.1109\/CEC.2002.1004429","article-title":"Solving Traveling Salesman Problems by Combining Global and Local Search Mechanisms","volume":"Volume 2","author":"Tsai","year":"2002","journal-title":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC\u201902 (Cat. No.02TH8600)"},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"014036","DOI":"10.1088\/0031-8949\/2009\/T135\/014036","article-title":"Simulations of L\u00e9vy Flights","volume":"T135","author":"Pantaleo","year":"2009","journal-title":"Phys. Scr."},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"1830","DOI":"10.1016\/j.jcp.2007.06.008","article-title":"L\u00e9vy Flights, Non-Local Search and Simulated Annealing","volume":"226","author":"Pavlyukevich","year":"2007","journal-title":"J. Comput. Phys."},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"3764","DOI":"10.1080\/03610926.2010.498648","article-title":"New Generalizations of Cauchy Distribution","volume":"40","year":"2011","journal-title":"Commun. Stat. Theory Methods"},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","article-title":"A Review on Genetic Algorithm: Past, Present, and Future","volume":"80","author":"Katoch","year":"2021","journal-title":"Multimed. Tools Appl."},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0377-0427(00)00355-1","article-title":"The Epsilon Algorithm and Related Topics","volume":"122","author":"Roberts","year":"2000","journal-title":"J. Comput. Appl. Math."},{"key":"ref_68","unstructured":"Tuong-Bach, N., and Isabelle, S. (2016, January 3\u20135). Epsilon-Covering: A Greedy Optimal Algorithm for Simple Shapes. Proceedings of the CCCG 2016 28th Canadian Conference on Computational Geometry, Vancouver, BC, Canada."},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","article-title":"PSPLIB\u2014A Project Scheduling Problem Library","volume":"96","author":"Kolisch","year":"1997","journal-title":"Eur. J. Oper. Res."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","article-title":"Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems","volume":"41","author":"Kolisch","year":"1995","journal-title":"Manag. Sci."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/5\/180\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:35:06Z","timestamp":1760106906000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/5\/180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,28]]},"references-count":70,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2024,5]]}},"alternative-id":["a17050180"],"URL":"https:\/\/doi.org\/10.3390\/a17050180","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,28]]}}}