{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:57:00Z","timestamp":1752674220563,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,11,3]],"date-time":"2024-11-03T00:00:00Z","timestamp":1730592000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,3]],"date-time":"2024-11-03T00:00:00Z","timestamp":1730592000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10951-024-00822-z","type":"journal-article","created":{"date-parts":[[2024,11,3]],"date-time":"2024-11-03T18:01:53Z","timestamp":1730656913000},"page":"587-606","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems"],"prefix":"10.1007","volume":"27","author":[{"given":"Pascale","family":"Bendotti","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6470-4229","authenticated-orcid":false,"given":"Luca","family":"Brunod Indrigo","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Chr\u00e9tienne","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Escoffier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,3]]},"reference":[{"issue":"2","key":"822_CR1","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/j.ejor.2017.10.022","volume":"266","author":"T Atan","year":"2018","unstructured":"Atan, T., & Eren, E. (2018). Optimal project duration for resource leveling. European Journal of Operational Research, 266(2), 508\u2013520.","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"822_CR2","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C Berge","year":"1957","unstructured":"Berge, C. (1957). Two theorems in graph theory. Proceedings of the National Academy of Sciences, 43(9), 842\u2013844.","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"2","key":"822_CR3","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s00291-016-0435-1","volume":"38","author":"L Bianco","year":"2016","unstructured":"Bianco, L., Caramia, M., & Giordani, S. (2016). Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities. OR Spectrum, 38(2), 405\u2013425.","journal-title":"OR Spectrum"},{"issue":"6","key":"822_CR4","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1504\/EJIE.2017.089106","volume":"11","author":"L Bianco","year":"2017","unstructured":"Bianco, L., Caramia, M., & Giordani, S. (2017). The total adjustment cost problem with variable activity durations and intensities. European Journal of Industrial Engineering, 11(6), 708\u2013724.","journal-title":"European Journal of Industrial Engineering"},{"issue":"1","key":"822_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2019.12.003","volume":"284","author":"X Chen","year":"2020","unstructured":"Chen, X., Liang, Y., Sterna, M., et al. (2020). Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date. European Journal of Operational Research, 284(1), 67\u201374.","journal-title":"European Journal of Operational Research"},{"key":"822_CR6","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10951-015-0464-7","volume":"19","author":"X Chen","year":"2016","unstructured":"Chen, X., Sterna, M., Han, X., et al. (2016). Scheduling on parallel identical machines with late work criterion: Offline and online cases. Journal of Scheduling, 19, 729\u2013736.","journal-title":"Journal of Scheduling"},{"key":"822_CR7","doi-asserted-by":"crossref","unstructured":"Christodoulou, S. E., Michaelidou-Kamenou, A., & Ellinas, G. (2015). Heuristic methods for resource leveling problems. In: Handbook on project management and scheduling, vol. 1. Springer, pp. 389\u2013407.","DOI":"10.1007\/978-3-319-05443-8_18"},{"key":"822_CR8","doi-asserted-by":"crossref","unstructured":"Coffman, E.J.r., & Graham, R. (1971\/1972). Optimal scheduling for two-processor systems. Acta Informatica, 1, 200\u2013213.","DOI":"10.1007\/BF00288685"},{"issue":"10","key":"822_CR9","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(10), 1590\u20131598.","journal-title":"Management Science"},{"issue":"1","key":"822_CR10","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.ejor.2011.01.043","volume":"212","author":"M Dr\u00f3tos","year":"2011","unstructured":"Dr\u00f3tos, M., & Kis, T. (2011). Resource leveling in a machine environment. European Journal of Operational Research, 212(1), 12\u201321.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"822_CR11","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. T., & Young, G. (1991). Scheduling chain-structured tasks to minimize makespan and mean flow time. Information and Computation, 92(2), 219\u2013236.","journal-title":"Information and Computation"},{"issue":"2","key":"822_CR12","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1061\/(ASCE)0733-9364(1989)115:2(302)","volume":"115","author":"SM Easa","year":"1989","unstructured":"Easa, S. M. (1989). Resource leveling in construction by optimization. Journal of Construction Engineering and Management, 115(2), 302\u2013316.","journal-title":"Journal of Construction Engineering and Management"},{"issue":"4","key":"822_CR13","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1137\/0117070","volume":"17","author":"M Fujii","year":"1969","unstructured":"Fujii, M., Kasami, T., & Ninomiya, K. (1969). Optimal sequencing of two equivalent processors. SIAM Journal on Applied Mathematics, 17(4), 784\u2013789.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"3","key":"822_CR14","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0206029","volume":"6","author":"MR Garey","year":"1977","unstructured":"Garey, M. R., & Johnson, D. S. (1977). Two-processor scheduling with start-times and deadlines. SIAM Journal on Computing, 6(3), 416\u2013426.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"822_CR15","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"M Garey","year":"1978","unstructured":"Garey, M., & Johnson, D. (1978). Strong NP-completeness results: Motivation, examples, and implications. Journal for Association Computing Machinery, 25(3), 499\u2013508.","journal-title":"Journal for Association Computing Machinery"},{"key":"822_CR16","doi-asserted-by":"crossref","unstructured":"Graham, R. L., Lawler, E. L., & Lenstra, J. K., et\u00a0al. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. In: Annals of discrete mathematics, vol\u00a05. Elsevier, pp. 287\u2013326.","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"1","key":"822_CR17","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.ejor.2020.03.032","volume":"286","author":"P Gy\u00f6rgyi","year":"2020","unstructured":"Gy\u00f6rgyi, P., & Kis, T. (2020). A common approximation framework for early work, late work, and resource leveling problems. European Journal of Operational Research, 286(1), 129\u2013137.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"822_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2021.05.004","volume":"297","author":"S Hartmann","year":"2022","unstructured":"Hartmann, S., & Briskorn, D. (2022). An updated survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, 297(1), 1\u201314.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"822_CR19","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(6), 841\u2013848.","journal-title":"Operations Research"},{"key":"822_CR20","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J Lenstra","year":"1977","unstructured":"Lenstra, J., Rinnooy Kan, A., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"822_CR21","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.eswa.2017.12.030","volume":"97","author":"H Li","year":"2018","unstructured":"Li, H., & Dong, X. (2018). Multi-mode resource leveling in projects with mode-dependent generalized precedence relations. Expert Systems with Applications, 97, 193\u2013204.","journal-title":"Expert Systems with Applications"},{"issue":"5","key":"822_CR22","doi-asserted-by":"publisher","first-page":"2054","DOI":"10.1080\/00207543.2017.1355120","volume":"56","author":"H Li","year":"2018","unstructured":"Li, H., Xiong, L., Liu, Y., et al. (2018). An effective genetic algorithm for the resource levelling problem with generalised precedence relations. International Journal of Production Research, 56(5), 2054\u20132075.","journal-title":"International Journal of Production Research"},{"key":"822_CR23","doi-asserted-by":"crossref","unstructured":"Micali, S., & Vazirani, V. V. (1980). An $${O}(\\sqrt{|V|}.|{E}|)$$ algorithm for finding maximum matching in general graphs. in: 21st annual symposium on foundations of computer science (FOCS 1980), IEEE, pp. 17\u201327.","DOI":"10.1109\/SFCS.1980.12"},{"issue":"3","key":"822_CR24","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(3), 591\u2013605.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"822_CR25","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1111\/mice.12233","volume":"32","author":"JL Ponz-Tienda","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), 474\u2013498.","journal-title":"Computer-Aided Civil and Infrastructure Engineering"},{"key":"822_CR26","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.autcon.2017.01.018","volume":"77","author":"JL Ponz-Tienda","year":"2017","unstructured":"Ponz-Tienda, J. L., Salcedo-Bernal, A., Pellicer, E., et al. (2017). Improved adaptive harmony search algorithm for the resource leveling problem with minimal lags. Automation in Construction, 77, 82\u201392.","journal-title":"Automation in Construction"},{"key":"822_CR27","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.autcon.2017.12.022","volume":"87","author":"J Qiao","year":"2018","unstructured":"Qiao, J., & Li, Y. (2018). Resource leveling using normalized entropy and relative entropy. Automation in Construction, 87, 263\u2013272.","journal-title":"Automation in Construction"},{"key":"822_CR28","doi-asserted-by":"crossref","unstructured":"Rieck, J., & Zimmermann, J. (2015). Exact methods for resource leveling problems. in: Handbook on project management and scheduling, vol. 1, Springer, pp. 361\u2013387.","DOI":"10.1007\/978-3-319-05443-8_17"},{"issue":"1","key":"822_CR29","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ejor.2012.03.003","volume":"221","author":"J Rieck","year":"2012","unstructured":"Rieck, J., Zimmermann, J., & Gather, T. (2012). Mixed-integer linear programming for resource leveling problems. European Journal of Operational Research, 221(1), 27\u201337.","journal-title":"European Journal of Operational Research"},{"key":"822_CR30","doi-asserted-by":"crossref","unstructured":"Rodrigues, S. B., & Yamashita, D. S. (2015). Exact methods for the resource availability cost problem. in Handbook on project management and scheduling, vol. 1, Springer, pp. 319\u2013338.","DOI":"10.1007\/978-3-319-05443-8_15"},{"key":"822_CR31","doi-asserted-by":"crossref","unstructured":"Sterna, M. (2011). A survey of scheduling problems with late work criteria. Omega, 39(2), 120\u2013129.","DOI":"10.1016\/j.omega.2010.06.006"},{"key":"822_CR32","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/s10957-017-1147-7","volume":"174","author":"M Sterna","year":"2017","unstructured":"Sterna, M., & Czerniachowska, K. (2017). Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work. Journal of Optimization Theory and Applications, 174, 927\u2013944.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"822_CR33","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"J Ullman","year":"1975","unstructured":"Ullman, J. (1975). NP-complete scheduling problems. Journal of Computer and System Science, 10, 384\u2013393.","journal-title":"Journal of Computer and System Science"},{"issue":"1","key":"822_CR34","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/s10696-011-9117-0","volume":"25","author":"V Van Peteghem","year":"2013","unstructured":"Van Peteghem, V., & Vanhoucke, M. (2013). An artificial immune system algorithm for the resource availability cost problem. Flexible Services and Manufacturing Journal, 25(1), 122\u2013144.","journal-title":"Flexible Services and Manufacturing Journal"},{"issue":"2","key":"822_CR35","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00291-016-0458-7","volume":"39","author":"C Verbeeck","year":"2017","unstructured":"Verbeeck, C., Van Peteghem, V., Vanhoucke, M., et al. (2017). A metaheuristic solution approach for the time-constrained project scheduling problem. OR Spectrum, 39(2), 353\u2013371.","journal-title":"OR Spectrum"},{"issue":"3","key":"822_CR36","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1111\/j.1540-5915.1975.tb01041.x","volume":"6","author":"BM Woodworth","year":"1975","unstructured":"Woodworth, B. M., & Willie, C. J. (1975). A heuristic algorithm for resource leveling in multi-project, multi-resource scheduling. Decision Sciences, 6(3), 525\u2013540.","journal-title":"Decision Sciences"},{"issue":"3","key":"822_CR37","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1016\/j.ejor.2016.08.049","volume":"257","author":"X Zhu","year":"2017","unstructured":"Zhu, X., Ruiz, R., Li, S., et al. (2017). An effective heuristic for project scheduling with resource availability cost. European Journal of Operational Research, 257(3), 746\u2013762.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00822-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-024-00822-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00822-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T13:03:59Z","timestamp":1731762239000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-024-00822-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,3]]},"references-count":37,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["822"],"URL":"https:\/\/doi.org\/10.1007\/s10951-024-00822-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2024,11,3]]},"assertion":[{"value":"14 August 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}