{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:39:18Z","timestamp":1767141558594,"version":"build-2238731810"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T00:00:00Z","timestamp":1688342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T00:00:00Z","timestamp":1688342400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100007229","name":"Bijzonder Onderzoeksfonds","doi-asserted-by":"publisher","award":["DOC014-18 Van Eynde"],"award-info":[{"award-number":["DOC014-18 Van Eynde"]}],"id":[{"id":"10.13039\/501100007229","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10479-023-05470-8","type":"journal-article","created":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T00:01:35Z","timestamp":1688342495000},"page":"593-625","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On the summary measures for the resource-constrained project scheduling problem"],"prefix":"10.1007","volume":"337","author":[{"given":"Rob","family":"Van Eynde","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6702-3563","authenticated-orcid":false,"given":"Mario","family":"Vanhoucke","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Coelho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,3]]},"reference":[{"issue":"6","key":"5470_CR1","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1137\/0221065","volume":"21","author":"WW Bein","year":"1992","unstructured":"Bein, W. W., Kamburowski, J., & Stallmann, M. F. (1992). Optimal reduction of two-terminal directed acyclic graphs. SIAM Journal on Computing, 21(6), 1112\u20131129.","journal-title":"SIAM Journal on Computing"},{"key":"5470_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.cor.2018.01.017","volume":"93","author":"J Coelho","year":"2018","unstructured":"Coelho, J., & Vanhoucke, M. (2018). An exact composite lower bound strategy for the resource-constrained project scheduling problem. Computers & Operations Research, 93, 135\u2013150.","journal-title":"Computers & Operations Research"},{"issue":"104","key":"5470_CR3","first-page":"976","volume":"121","author":"J Coelho","year":"2020","unstructured":"Coelho, J., & Vanhoucke, M. (2020). Going to the core of hard resource-constrained project scheduling instances. Computers & Operations Research, 121(104), 976.","journal-title":"Computers & Operations Research"},{"issue":"11","key":"5470_CR4","doi-asserted-by":"publisher","first-page":"1186","DOI":"10.1287\/mnsc.22.11.1186","volume":"22","author":"DF Cooper","year":"1976","unstructured":"Cooper, D. F. (1976). Heuristics for scheduling resource-constrained projects: An experimental investigation. Management Science, 22(11), 1186\u20131194.","journal-title":"Management Science"},{"issue":"4","key":"5470_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1080\/05695557308974922","volume":"5","author":"E Dar-El","year":"1973","unstructured":"Dar-El, E. (1973). Malb-a heuristic technique for balancing large single-model assembly lines. AIIE Transactions, 5(4), 343\u2013356.","journal-title":"AIIE Transactions"},{"issue":"4","key":"5470_CR6","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1057\/jors.1973.107","volume":"24","author":"E Davies","year":"1973","unstructured":"Davies, E. (1973). An experimental investigation of resource allocation in multiactivity projects. Journal of the Operational Research Society, 24(4), 587\u2013591.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"5470_CR7","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1080\/05695557508974995","volume":"7","author":"EW Davis","year":"1975","unstructured":"Davis, E. W. (1975). Project network summary measures constrained-resource scheduling. AIIE Transactions, 7(2), 132\u2013142.","journal-title":"AIIE Transactions"},{"key":"5470_CR8","unstructured":"De Reyck, B. (1995). On the use of the restrictiveness as a measure of complexity for resource-constrained project scheduling. Katholieke Universiteit Leuven, Departement Toegepaste Economische Wetenschappen."},{"issue":"2","key":"5470_CR9","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0377-2217(94)00344-0","volume":"91","author":"B De Reyck","year":"1996","unstructured":"De Reyck, B., & Herroelen, W. (1996). On the use of the complexity index as a measure of complexity in activity networks. European Journal of Operational Research, 91(2), 347\u2013366.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5470_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1022283403119","volume":"6","author":"E Demeulemeester","year":"2003","unstructured":"Demeulemeester, E., Vanhoucke, M., & Herroelen, W. (2003). Rangen: A random network generator for activity-on-the-node networks. Journal of scheduling, 6(1), 17\u201338.","journal-title":"Journal of scheduling"},{"issue":"1","key":"5470_CR11","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/0377-2217(94)00181-2","volume":"88","author":"EL Demeulemeester","year":"1996","unstructured":"Demeulemeester, E. L., Herroelen, W. S., & Elmaghraby, S. E. (1996). Optimal procedures for the discrete time\/cost trade-off problem in project networks. European Journal of Operational Research, 88(1), 50\u201368.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5470_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"RP Dilworth","year":"1950","unstructured":"Dilworth, R. P. (1950). A decomposition theorem for partially ordered sets. Annals of Mathematics, 51(1), 161\u2013166.","journal-title":"Annals of Mathematics"},{"issue":"4","key":"5470_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0377-2217(80)90053-3","volume":"5","author":"SE Elmaghraby","year":"1980","unstructured":"Elmaghraby, S. E., & Herroelen, W. S. (1980). On the measurement of complexity in activity networks. European Journal of Operational Research, 5(4), 223\u2013234.","journal-title":"European Journal of Operational Research"},{"issue":"114","key":"5470_CR14","first-page":"116","volume":"167","author":"W Guo","year":"2021","unstructured":"Guo, W., Vanhoucke, M., Coelho, J., et al. (2021). Automatic detection of the best performing priority rule for the resource-constrained project scheduling problem. Expert Systems with Applications, 167(114), 116.","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"5470_CR15","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1057\/palgrave.jors.2600680","volume":"50","author":"W Herroelen","year":"1999","unstructured":"Herroelen, W., & De Reyck, B. (1999). Phase transitions in project scheduling. Journal of the Operational Research Society, 50(2), 148\u2013156.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"5470_CR16","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1287\/mnsc.21.2.172","volume":"21","author":"RA Kaimann","year":"1974","unstructured":"Kaimann, R. A. (1974). Coefficient of network complexity. Management Science, 21(2), 172\u2013177.","journal-title":"Management Science"},{"key":"5470_CR17","unstructured":"Kamburowski, J., Michael, D., & Stallmann, M. (1992). Optimal construction of project activity networks. In: Proceedings of the 1992 Annual Meeting of the Decision Sciences Institute, San Francisco, pp. 1424\u20131426."},{"issue":"2","key":"5470_CR18","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1287\/opre.30.2.375","volume":"30","author":"EP Kao","year":"1982","unstructured":"Kao, E. P., & Queyranne, M. (1982). On dynamic programming methods for assembly line balancing. Operations Research, 30(2), 375\u2013390.","journal-title":"Operations Research"},{"issue":"1","key":"5470_CR19","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., & Sprecher, A. (1997). Psplib-a project scheduling problem library: Or software-orsep operations research software exchange program. European Journal of Operational Research, 96(1), 205\u2013216.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"5470_CR20","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","volume":"41","author":"R Kolisch","year":"1995","unstructured":"Kolisch, R., Sprecher, A., & Drexl, A. (1995). Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science, 41(10), 1693\u20131703.","journal-title":"Management Science"},{"issue":"11","key":"5470_CR21","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1287\/mnsc.16.11.728","volume":"16","author":"AA Mastor","year":"1970","unstructured":"Mastor, A. A. (1970). An experimental investigation and comparative evaluation of production line balancing techniques. Management Science, 16(11), 728\u2013746.","journal-title":"Management Science"},{"issue":"3","key":"5470_CR22","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.ejor.2013.08.021","volume":"233","author":"T Messelis","year":"2014","unstructured":"Messelis, T., & De Causmaecker, P. (2014). An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem. European Journal of Operational Research, 233(3), 511\u2013528.","journal-title":"European Journal of Operational Research"},{"issue":"38","key":"5470_CR23","first-page":"31","volume":"10","author":"TL Pascoe","year":"1966","unstructured":"Pascoe, T. L. (1966). Allocation of resources cpm. Revue Francaise de Recherche Operationnele, 10(38), 31\u201331.","journal-title":"Revue Francaise de Recherche Operationnele"},{"issue":"1","key":"5470_CR24","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800230110","volume":"23","author":"JH Patterson","year":"1976","unstructured":"Patterson, J. H. (1976). Project scheduling: The effects of problem structure on heuristic performance. Naval Research Logistics Quarterly, 23(1), 95\u2013123.","journal-title":"Naval Research Logistics Quarterly"},{"key":"5470_CR25","unstructured":"Schwindt, C. (1995). Progen\/max: A new problem generator for different resource-constrained project scheduling problems with minimal and maximal time lags."},{"issue":"2","key":"5470_CR26","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10472-011-9230-5","volume":"61","author":"K Smith-Miles","year":"2011","unstructured":"Smith-Miles, K., & van Hemert, J. (2011). Discovering the suitability of optimisation algorithms by learning from evolved instances. Annals of Mathematics and Artificial Intelligence, 61(2), 87\u2013104.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"5","key":"5470_CR27","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K Smith-Miles","year":"2012","unstructured":"Smith-Miles, K., & Lopes, L. (2012). Measuring instance difficulty for combinatorial optimization problems. Computers & Operations Research, 39(5), 875\u2013889.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"5470_CR28","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0377-2217(93)E0294-8","volume":"80","author":"A Sprecher","year":"1995","unstructured":"Sprecher, A., Kolisch, R., & Drexl, A. (1995). Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. European Journal of Operational Research, 80(1), 94\u2013102.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5470_CR29","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/S0377-2217(99)00150-2","volume":"119","author":"LV Tavares","year":"1999","unstructured":"Tavares, L. V., Ferreira, J. A., & Coelho, J. S. (1999). The risk of delay of a project in terms of the morphology of its network. European Journal of Operational Research, 119(2), 510\u2013537.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"5470_CR30","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1002\/net.3230070302","volume":"7","author":"A Thesen","year":"1977","unstructured":"Thesen, A. (1977). Measures of the restrictiveness of project networks. Networks, 7(3), 193\u2013208.","journal-title":"Networks"},{"issue":"3","key":"5470_CR31","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10951-020-00651-w","volume":"23","author":"R Van Eynde","year":"2020","unstructured":"Van Eynde, R., & Vanhoucke, M. (2020). Resource-constrained multi-project scheduling: Benchmark datasets and decoupled scheduling. Journal of Scheduling, 23(3), 301\u2013325.","journal-title":"Journal of Scheduling"},{"key":"5470_CR32","doi-asserted-by":"crossref","unstructured":"Van\u00a0Eynde, R., & Vanhoucke, M. (2021). New summary measures and datasets for the multi-project scheduling problem. European Journal of Operational Research","DOI":"10.1016\/j.ejor.2021.10.006"},{"issue":"105","key":"5470_CR33","first-page":"750","volume":"143","author":"R Van Eynde","year":"2022","unstructured":"Van Eynde, R., & Vanhoucke, M. (2022). A reduction tree approach for the discrete time\/cost trade-off problem. Computers & Operations Research, 143(105), 750.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"5470_CR34","doi-asserted-by":"publisher","first-page":"3156","DOI":"10.1287\/moor.2021.1237","volume":"47","author":"R Van Eynde","year":"2022","unstructured":"Van Eynde, R., & Vanhoucke, M. (2022). A theoretical framework for instance complexity of the resource-constrained project scheduling problem. Mathematics of Operations Research, 47(4), 3156\u201383.","journal-title":"Mathematics of Operations Research"},{"key":"5470_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-1014-1","volume-title":"Measuring time: Improving project performance using earned value management","author":"M Vanhoucke","year":"2009","unstructured":"Vanhoucke, M. (2009). Measuring time: Improving project performance using earned value management (Vol. 136). Berlin: Springer."},{"key":"5470_CR36","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.cie.2018.02.001","volume":"118","author":"M Vanhoucke","year":"2018","unstructured":"Vanhoucke, M., & Coelho, J. (2018). A tool to test and validate algorithms for the resource-constrained project scheduling problem. Computers & Industrial Engineering, 118, 251\u2013265.","journal-title":"Computers & Industrial Engineering"},{"issue":"105","key":"5470_CR37","first-page":"260","volume":"132","author":"M Vanhoucke","year":"2021","unstructured":"Vanhoucke, M., & Coelho, J. (2021). An analysis of network and resource indicators for resource-constrained project scheduling problem instances. Computers & Operations Research, 132(105), 260.","journal-title":"Computers & Operations Research"},{"issue":"8","key":"5470_CR38","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1287\/mnsc.47.8.1113.10226","volume":"47","author":"M Vanhoucke","year":"2001","unstructured":"Vanhoucke, M., Demeulemeester, E., & Herroelen, W. (2001). On maximizing the net present value of a project under renewable resource constraints. Management Science, 47(8), 1113\u20131121.","journal-title":"Management Science"},{"issue":"2","key":"5470_CR39","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.ejor.2007.03.032","volume":"187","author":"M Vanhoucke","year":"2008","unstructured":"Vanhoucke, M., Coelho, J., Debels, D., et al. (2008). An evaluation of the adequacy of project network generators with systematically sampled networks. European Journal of Operational Research, 187(2), 511\u2013524.","journal-title":"European Journal of Operational Research"}],"updated-by":[{"DOI":"10.1007\/s10479-023-05511-2","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T00:00:00Z","timestamp":1689292800000}}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05470-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-023-05470-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05470-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T11:14:41Z","timestamp":1717154081000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-023-05470-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,3]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["5470"],"URL":"https:\/\/doi.org\/10.1007\/s10479-023-05470-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,3]]},"assertion":[{"value":"14 June 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2023","order":3,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":4,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10479-023-05511-2","URL":"https:\/\/doi.org\/10.1007\/s10479-023-05511-2","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}