{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T11:24:18Z","timestamp":1773660258634,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2026,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>A central problem in project management is the optimal use of limited resources. We consider the resource leveling problem, which minimizes the maximum resource load over the life of a project. This problem is motivated by the need to limit expensive resource acquisition. For several variants of this problem, we either provide an efficient optimal algorithm or show that the problem is intractable. We also consider a generalization of the resource leveling problem where work can be subcontracted. The subcontracting cost is defined either by task or by time of subcontracting. Our results show how the solvability of resource leveling problems depends on whether task times are unit or arbitrary, whether resource requirements are unit or binary, whether the project network is a chain, a tree, or an opposing forest, whether subcontracting costs for jobs are unit or binary, and whether the availability of subcontracting at a time period is constrained.<\/jats:p>","DOI":"10.1007\/s10951-025-00861-0","type":"journal-article","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T18:57:47Z","timestamp":1764615467000},"page":"39-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Resource leveling with subcontracting: algorithms and complexity"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4484-9252","authenticated-orcid":false,"given":"Nicholas G.","family":"Hall","sequence":"first","affiliation":[]},{"given":"Marc E.","family":"Posner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,1]]},"reference":[{"key":"861_CR1","doi-asserted-by":"publisher","first-page":"l1","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz, J., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1983). Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics, 5, l1-24.","journal-title":"Discrete Applied Mathematics"},{"key":"861_CR2","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.ijpe.2010.03.009","volume":"126","author":"TR Browning","year":"2010","unstructured":"Browning, T. R., & Yassine, A. A. (2010). Resource-constrained multi-project scheduling: Priority rule performance revisited. International Journal of Production Economics, 126, 212\u2013228.","journal-title":"International Journal of Production Economics"},{"key":"861_CR3","first-page":"76","volume":"13","author":"AR Burgess","year":"1962","unstructured":"Burgess, A. R., & Killebrew, J. B. (1962). Variation in activity level on a cyclical arrow diagram. Journal of Industrial Engineering, 13, 76\u201383.","journal-title":"Journal of Industrial Engineering"},{"key":"861_CR4","unstructured":"Crail, C. (2024). Payroll outsourcing in 2024: The ultimate guide. Forbes.com. August 17. Available at: https:\/\/www.forbes.com\/advisor\/business\/payroll-outsourcing\/ Last accessed: August 21, 2024."},{"key":"861_CR5","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1287\/mnsc.41.10.1590","volume":"41","author":"E Demeulemeester","year":"1995","unstructured":"Demeulemeester, E. (1995). Minimizing resource availability costs in time-limited project networks. Management Science, 41, 1590\u20131598.","journal-title":"Management Science"},{"key":"861_CR6","volume-title":"Project scheduling: A research handbook","author":"EL Demeulemeester","year":"2002","unstructured":"Demeulemeester, E. L., & Herroelen, W. S. (2002). Project scheduling: A research handbook. Boston, MA: Kluwer."},{"issue":"3","key":"861_CR7","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1057\/palgrave.jors.2601099","volume":"52","author":"A Drexl","year":"2001","unstructured":"Drexl, A., & Kimms, A. (2001). Optimization guided lower and upper bounds for the resource investment problem. Journal of the Operational Research Society, 52(3), 340\u2013351.","journal-title":"Journal of the Operational Research Society"},{"key":"861_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0890-5401(91)90009-Q","volume":"92","author":"J Du","year":"1991","unstructured":"Du, J., Leung, J.Y.-T., & Young, G. H. (1991). Scheduling chain-structured tasks to minimize makespan and mean flow time. Information and Computation, 92, 219\u2013236.","journal-title":"Information and Computation"},{"key":"861_CR9","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0360-8352(98)00122-3","volume":"35","author":"MH Elwany","year":"1998","unstructured":"Elwany, M. H., Korish, I. E., Barakat, M. A., & Hafez, S. M. (1998). Resource smoothening in repetitive projects. Computers and Industrial Engineering, 35, 415\u2013418.","journal-title":"Computers and Industrial Engineering"},{"key":"861_CR10","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman."},{"key":"861_CR11","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1137\/0604011","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M. R., Johnson, D. S., Tarjan, R. E., & Yannakakis, M. (1983). Scheduling opposing forests. SIAM Journal on Algebraic Discrete Methods, 4, 72\u201393.","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"key":"861_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham, R., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic machine scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"861_CR13","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., & Schrijver, A. (1988). Complexity, Oracles, and Numerical Computation. Geometric algorithms and combinatorial optimization: Springer. 0-387-13624-X","DOI":"10.1007\/978-3-642-97881-4"},{"key":"861_CR14","unstructured":"Hobbs, B., & Menard, P. (1993). Organizational choices for project management. In The AMA Handbook of Project Management, ed. P.C. Dinsmore, AMACON, New York."},{"key":"861_CR15","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"TC Hu","year":"1961","unstructured":"Hu, T. C. (1961). Parallel sequencing and assembly line problems. Operations Research, 9, 841\u2013848.","journal-title":"Operations Research"},{"issue":"5","key":"861_CR16","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1080\/00207543.2014.948972","volume":"53","author":"X Hu","year":"2015","unstructured":"Hu, X., Cui, N., & Demeulemeester, E. (2015). Effective expediting to improve project due date and cost performance through buffer management. International Journal of Production Research, 53(5), 1460\u20131471.","journal-title":"International Journal of Production Research"},{"key":"861_CR17","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1017\/S0890060498123053","volume":"12","author":"N Kartam","year":"1998","unstructured":"Kartam, N., & Tongthong, T. (1998). An artificial neural network for resource leveling problem. Artifical Intelligence for Engineering Design, Analysis & Manufacturing: AIEDAM, 12, 273\u2013287.","journal-title":"Artifical Intelligence for Engineering Design, Analysis & Manufacturing: AIEDAM"},{"key":"861_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/inte.29.4.19","volume":"29","author":"R Kolisch","year":"1999","unstructured":"Kolisch, R. (1999). Resource allocation capabilities of commercial project management software packages. Interfaces, 29, 19\u201331.","journal-title":"Interfaces"},{"key":"861_CR19","doi-asserted-by":"crossref","unstructured":"Kyriklidis, C., & Dounias, G. (2016). Evolutionary computation for resource leveling optimization in project management. Integrated Computer-Aided Engineering, 23, 173\u2013184.","DOI":"10.3233\/ICA-150508"},{"key":"861_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R McNaughton","year":"1959","unstructured":"McNaughton, R. (1959). Scheduling with deadlines and loss functions. Management Science, 6, 1\u201311.","journal-title":"Management Science"},{"issue":"1","key":"861_CR21","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1287\/opre.32.1.89","volume":"32","author":"RH M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R. H. (1984). Minimizing costs of resource requirements in project networks subject to a fixed completion time. Operations Research, 32(1), 89\u2013120.","journal-title":"Operations Research"},{"key":"861_CR22","doi-asserted-by":"crossref","unstructured":"Muntz, R. R., & Coffman, E. G., Jr. (1970). Preemptive scheduling of real-time tasks on multiprocessor systems. Journal of the ACM, 17, 324\u2013338.","DOI":"10.1145\/321574.321586"},{"key":"861_CR23","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/S0377-2217(98)00272-0","volume":"117","author":"K Neumann","year":"1999","unstructured":"Neumann, K., & Zimmermann, J. (1999). Resource levelling for projects with schedule-dependent time windows. European Journal of Operational Research, 117, 591\u2013605.","journal-title":"European Journal of Operational Research"},{"key":"861_CR24","first-page":"78","volume":"86","author":"GP Pisano","year":"2008","unstructured":"Pisano, G. P., & Verganti, R. (2008). Which kind of collaboration is right for you? Harvard Business Review, 86, 78\u201386.","journal-title":"Harvard Business Review"},{"key":"861_CR25","first-page":"79","volume":"68","author":"CK Prahalad","year":"1990","unstructured":"Prahalad, C. K., & Hamel, G. (1990). The core competence of the corporation. Harvard Business Review, 68, 79\u201391.","journal-title":"Harvard Business Review"},{"key":"861_CR26","unstructured":"Project Management Institute. (2013). A Guide to the Project Management Body of Knowledge (PMI Guide). Newton Square, PA: PMI Publications."},{"key":"861_CR27","first-page":"43","volume":"35","author":"JB Quinn","year":"1994","unstructured":"Quinn, J. B., & Hilmer, F. G. (1994). Strategic outsourcing. Sloan Management Review, 35, 43\u201355.","journal-title":"Sloan Management Review"},{"key":"861_CR28","doi-asserted-by":"publisher","first-page":"317","DOI":"10.3844\/ajassp.2007.317.322","volume":"4","author":"K Raja","year":"2007","unstructured":"Raja, K., & Kumanan, S. (2007). Resource leveling using Petrinet and memetic approach. American Journal of Applied Sciences, 4, 317\u2013322.","journal-title":"American Journal of Applied Sciences"},{"key":"861_CR29","doi-asserted-by":"crossref","unstructured":"Rieck, J., & Zimmermann, J. (2014). Exact methods for resource leveling problems. in Handbook on Project Management and Scheduling1, 361\u2013387. Springer, Switzerland.","DOI":"10.1007\/978-3-319-05443-8_17"},{"key":"861_CR30","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1093\/icc\/11.3.451","volume":"11","author":"TJ Sturgeon","year":"2002","unstructured":"Sturgeon, T. J. (2002). Modular production networks: A new American model of industrial organization. Industrial and Corporate Change, 11, 451\u2013496.","journal-title":"Industrial and Corporate Change"},{"key":"861_CR31","first-page":"124","volume":"130","author":"S Tully","year":"1994","unstructured":"Tully, S. (1994). You\u2019ll never guess who really makes $$\\ldots $$. Fortune, 130, 124\u2013129.","journal-title":"Fortune"},{"key":"861_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0360-8352(96)00116-7","volume":"31","author":"MA Younis","year":"1996","unstructured":"Younis, M. A., & Saad, B. (1996). Optimal resource leveling of multi-resource projects. Computers and Industrial Engineering, 31, 1\u20134.","journal-title":"Computers and Industrial Engineering"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-025-00861-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-025-00861-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-025-00861-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:41:45Z","timestamp":1773657705000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-025-00861-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,1]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["861"],"URL":"https:\/\/doi.org\/10.1007\/s10951-025-00861-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,1]]},"assertion":[{"value":"23 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}