{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T08:58:29Z","timestamp":1781168309670,"version":"3.54.1"},"reference-count":40,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Production Research"],"published-print":{"date-parts":[[2019,2,16]]},"DOI":"10.1080\/00207543.2018.1504245","type":"journal-article","created":{"date-parts":[[2018,9,20]],"date-time":"2018-09-20T15:04:13Z","timestamp":1537455853000},"page":"1265-1282","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":28,"title":["A novel branch-and-bound algorithm for the chance-constrained resource-constrained project scheduling problem"],"prefix":"10.1080","volume":"57","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7093-0946","authenticated-orcid":false,"given":"Morteza","family":"Davari","sequence":"first","affiliation":[{"name":"Department of Decision Sciences and Information Management, KU Leuven, Leuven, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erik","family":"Demeulemeester","sequence":"additional","affiliation":[{"name":"Department of Decision Sciences and Information Management, KU Leuven, Leuven, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2018,9,20]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1002\/9780470611227"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1007\/s10696-012-9147-2"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00758-0"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1080\/1055678021000033937"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.02.027"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(83)90012-4"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1108\/02644401111179036"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.12.004"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-013-9218-x"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2016.09.009"},{"key":"CIT0011","doi-asserted-by":"crossref","unstructured":"Bruni, M. E., L. D. P. Pugliese, P. Beraldi, and F. Guerriero. 2018. \u201cA Two-stage Stochastic Programming Model for the Resource Constrained Project Scheduling Problem Under Uncertainty.\u201d Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, 194\u2013200. INSTICC, SciTePress.","DOI":"10.5220\/0006612601940200"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-015-0421-5"},{"key":"CIT0013","unstructured":"Davari, M. 2017. \u201cContributions to Complex Project and Machine Scheduling Problems.\u201d PhD thesis, Faculty of Economics and Business, KU Leuven."},{"key":"CIT0014","doi-asserted-by":"crossref","unstructured":"Davari, M., and E. Demeulemeester. 2016. \u201cA Novel Branch-and-bound Algorithm for the Chance-constrained RCPSP.\u201d Technical Report KBI_1620, KU Leuven.","DOI":"10.2139\/ssrn.2841157"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-017-0553-x"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.01.001"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.04.019"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.43.11.1485"},{"key":"CIT0019","volume-title":"Project Scheduling: A Research Handbook","author":"Demeulemeester E.","year":"2002"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1561\/0200000021"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011393"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4629-0"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00170-1"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.12.011"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0385-3"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-015-0423-3"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0684-6"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1137\/070702928"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0247-4"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.44.5.714"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-46534-5_6"},{"issue":"6","key":"CIT0032","first-page":"441","volume":"34","author":"Pr\u00e9kopa A.","year":"1990","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"CIT0033","doi-asserted-by":"crossref","unstructured":"Rostami, S., S. Creemers, and R. Leus. 2016. \u201cNew Benchmark Results for the Stochastic Resource-constrained Project Scheduling Problem.\u201d Technical Report, KU Leuven.","DOI":"10.2139\/ssrn.2724501"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0337-7"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.46.5.710.12044"},{"key":"CIT0036","unstructured":"Stork, F. 2000. \u201cBranch-and-bound Algorithms for Stochastic Resource-constrained Project Scheduling.\u201d Technical Report, Technische Universit\u00e4t Berlin."},{"key":"CIT0037","unstructured":"Stork, F. 2001. \u201cStochastic Resource-constrained Project Scheduling.\u201d PhD thesis, TU Berlin."},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.10.061"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-33768-5_2"},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.01.046"}],"container-title":["International Journal of Production Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207543.2018.1504245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,15]],"date-time":"2020-08-15T14:55:11Z","timestamp":1597503311000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207543.2018.1504245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,20]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,2,16]]}},"alternative-id":["10.1080\/00207543.2018.1504245"],"URL":"https:\/\/doi.org\/10.1080\/00207543.2018.1504245","relation":{},"ISSN":["0020-7543","1366-588X"],"issn-type":[{"value":"0020-7543","type":"print"},{"value":"1366-588X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,20]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2017-12-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-06-25","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-09-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}