{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:52Z","timestamp":1750220212574,"version":"3.41.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T00:00:00Z","timestamp":1746403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T00:00:00Z","timestamp":1746403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004252","name":"Qatar University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004252","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We consider the problem of scheduling independent multi-mode tasks with multiple renewable resource constraints, aiming to minimize the weighted sum of tardinesses. This problem commonly arises in the context of multiproject scheduling. We propose three pseudo-polynomial mixed-integer programming formulations and conduct a theoretical comparative analysis of their respective linear programming relaxations. We present the results of extensive computational experiments that provide evidence that a formulation based on Dantzig\u2013Wolfe reformulation exhibits very good empirical performance consistently solving all instances with fewer than 30 tasks. In addition, it achieved an average success rate of 94.28% for instances with tasks ranging from 40 to 100, compared to other formulations that on average achieved success rates of 64.28% and 58.57%.<\/jats:p>","DOI":"10.1007\/s12351-025-00924-2","type":"journal-article","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T13:57:49Z","timestamp":1746453469000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A comparative analysis of MIP formulations for the multi-mode resource-constrained independent task scheduling problem"],"prefix":"10.1007","volume":"25","author":[{"given":"Maryam","family":"Al-Khatib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Haouari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1469-7163","authenticated-orcid":false,"given":"Mohamed","family":"Kharbeche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,5]]},"reference":[{"key":"924_CR1","first-page":"427","volume":"29","author":"M Akhbari","year":"2022","unstructured":"Akhbari M (2022) Integration of multi-mode resource-constrained project scheduling under bonus-penalty policies with material ordering under quantity discount scheme for minimizing project cost. Sci Iran 29:427\u2013446","journal-title":"Sci Iran"},{"key":"924_CR2","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/j.ins.2016.09.010","volume":"373","author":"S Asta","year":"2016","unstructured":"Asta S, Karapetyan D, Kheiri A, \u00d6zcan E, Parkes AJ (2016) Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem. Inf Sci 373:476\u2013498","journal-title":"Inf Sci"},{"key":"924_CR3","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/s10696-012-9140-9","volume":"25","author":"U Besikci","year":"2013","unstructured":"Besikci U, Bilge U, Ulusoy G (2013) Resource dedication problem in a multi-project environment. Flex Serv Manuf J 25:206\u2013229","journal-title":"Flex Serv Manuf J"},{"key":"924_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ejor.2014.06.025","volume":"240","author":"U Be\u015fikci","year":"2015","unstructured":"Be\u015fikci U, Bilge \u00dc, Ulusoy G (2015) Multi-mode resource constrained multi-project scheduling and resource portfolio problem. Eur J Oper Res 240:22\u201331","journal-title":"Eur J Oper Res"},{"key":"924_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(95)00003-A","volume":"62","author":"L Bianco","year":"1995","unstructured":"Bianco L, Dell\u2019Olmo P, Speranza MG (1995) Scheduling independent tasks with multiple modes. Discret Appl Math 62:35\u201350","journal-title":"Discret Appl Math"},{"key":"924_CR6","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/S0377-2217(97)00347-0","volume":"107","author":"L Bianco","year":"1998","unstructured":"Bianco L, Dell\u2019Olmo P, Speranza MG (1998) Heuristics for multimode scheduling problems with dedicated resources. Eur J Oper Res 107:260\u2013271","journal-title":"Eur J Oper Res"},{"key":"924_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz J, Lenstra JK, Kan AR (1983) Scheduling subject to resource constraints: classification and complexity. Discret Appl Math 5:11\u201324","journal-title":"Discret Appl Math"},{"key":"924_CR8","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.orl.2022.08.003","volume":"50","author":"M Bold","year":"2022","unstructured":"Bold M, Goerigk M (2022) A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem. Oper Res Lett 50:581\u2013587","journal-title":"Oper Res Lett"},{"key":"924_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10951-009-0131-y","volume":"13","author":"TR Browning","year":"2010","unstructured":"Browning TR, Yassine AA (2010) A random generator of resource-constrained multi-project network problems. J Sched 13:143\u2013161","journal-title":"J Sched"},{"key":"924_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108201","volume":"169","author":"G \u00c7ak\u0131r","year":"2022","unstructured":"\u00c7ak\u0131r G, Subulan K, Yildiz ST, Hamzaday\u0131 A, As\u0131lkefeli C (2022) A comparative study of modeling and solution approaches for the multi-mode resource-constrained discrete time-cost trade-off problem: case study of an erp implementation project. Comput Ind Eng 169:108201","journal-title":"Comput Ind Eng"},{"key":"924_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10479-014-1555-0","volume":"217","author":"A Can","year":"2014","unstructured":"Can A, Ulusoy G (2014) Multi-project scheduling with two-stage decomposition. Ann Oper Res 217:95\u2013116","journal-title":"Ann Oper Res"},{"key":"924_CR12","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10732-007-9062-y","volume":"15","author":"M Caramia","year":"2009","unstructured":"Caramia M, Giordani S (2009) A new approach for scheduling independent tasks with multiple modes. J Heuristics 15:313\u2013329","journal-title":"J Heuristics"},{"key":"924_CR13","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.cie.2009.08.004","volume":"58","author":"M Caramia","year":"2010","unstructured":"Caramia M, Giordani S (2010) A fast metaheuristic for scheduling independent tasks with multiple modes. Comput Ind Eng 58:64\u201369","journal-title":"Comput Ind Eng"},{"key":"924_CR14","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1057\/jors.1966.72","volume":"17","author":"J Carruthers","year":"1966","unstructured":"Carruthers J, Battersby A (1966) Advances in critical path methods. J Oper Res Soc 17:359\u2013380","journal-title":"J Oper Res Soc"},{"key":"924_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108240","volume":"169","author":"JC Chen","year":"2022","unstructured":"Chen JC, Chen YY, Chen TL, Lin YH (2022) Multi-project scheduling with multi-skilled workforce assignment considering uncertainty and learning effect for large-scale equipment manufacturer. Comput Ind Eng 169:108240","journal-title":"Comput Ind Eng"},{"key":"924_CR16","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/0377-2217(87)90240-2","volume":"29","author":"N Christofides","year":"1987","unstructured":"Christofides N, Alvarez-Vald\u00e9s R, Tamarit JM (1987a) Project scheduling with resource constraints: a branch and bound approach. Eur J Oper Res 29:262\u2013273","journal-title":"Eur J Oper Res"},{"key":"924_CR17","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/0377-2217(87)90240-2","volume":"29","author":"N Christofides","year":"1987","unstructured":"Christofides N, Alvarezvaldes R, Tamarit J (1987b) Project scheduling with resource constraints\u2014a branch and bound approach. Eur J Oper Res 29:262\u2013273","journal-title":"Eur J Oper Res"},{"key":"924_CR18","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s001860000091","volume":"52","author":"U Dorndorf","year":"2000","unstructured":"Dorndorf U, Pesch E, Phan-Huy T (2000) A branch-and-bound algorithm for the resource-constrained project scheduling problem. Math Methods Oper Res 52:413\u2013439","journal-title":"Math Methods Oper Res"},{"key":"924_CR19","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.1287\/opre.21.5.1114","volume":"21","author":"ML Fisher","year":"1973","unstructured":"Fisher ML (1973) Optimal solution of scheduling problems using Lagrange multipliers: part I. Oper Res 21:1114\u20131127","journal-title":"Oper Res"},{"key":"924_CR20","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.ejor.2016.07.024","volume":"256","author":"MJ Geiger","year":"2017","unstructured":"Geiger MJ (2017) A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem. Eur J Oper Res 256:729\u2013741","journal-title":"Eur J Oper Res"},{"key":"924_CR21","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/j.ejor.2022.01.018","volume":"302","author":"N He","year":"2022","unstructured":"He N, Zhang DZ, Yuce B (2022) Integrated multi-project planning and scheduling\u2014a multiagent approach. Eur J Oper Res 302:688\u2013699","journal-title":"Eur J Oper Res"},{"key":"924_CR22","volume":"13","author":"JE Kelley","year":"1963","unstructured":"Kelley JE (1963) The critical-path method: resource planning and scheduling. Ind Schedul 13:347365","journal-title":"Ind Schedul"},{"key":"924_CR23","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10107-004-0551-6","volume":"103","author":"T Kis","year":"2005","unstructured":"Kis T (2005) A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. Math Program 103:515\u2013539","journal-title":"Math Program"},{"key":"924_CR24","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0305-0483(00)00046-3","volume":"29","author":"R Kolisch","year":"2001","unstructured":"Kolisch R, Padman R (2001) An integrated survey of deterministic project scheduling. Omega 29:249\u2013272","journal-title":"Omega"},{"key":"924_CR25","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"EL Lawler","year":"1977","unstructured":"Lawler EL (1977) A \u201cpseudopolynomial\u2019\u2019 algorithm for sequencing jobs to minimize total tardiness. Ann Discrete Math 1:331\u2013342","journal-title":"Ann Discrete Math"},{"key":"924_CR26","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York, p 118"},{"key":"924_CR27","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1287\/mnsc.20.6.990","volume":"20","author":"JH Patterson","year":"1974","unstructured":"Patterson JH, Huber WD (1974) A horizon-varying, zero-one approach to project scheduling. Manag Sci 20:990\u2013998","journal-title":"Manag Sci"},{"key":"924_CR28","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1080\/05695557608975107","volume":"8","author":"JH Patterson","year":"1976","unstructured":"Patterson JH, Roth GW (1976) Scheduling a project under multiple resource constraints: a zero-one programming approach. AIIE Trans 8:449\u2013455","journal-title":"AIIE Trans"},{"key":"924_CR29","doi-asserted-by":"publisher","first-page":"337","DOI":"10.3390\/math11020337","volume":"11","author":"AS Ramos","year":"2023","unstructured":"Ramos AS, Miranda-Gonzalez PA, Nucamendi-Guill\u00e9n S, Olivares-Benitez E (2023) A formulation for the stochastic multi-mode resource-constrained project scheduling problem solved with a multi-start iterated local search metaheuristic. Mathematics 11:337","journal-title":"Mathematics"},{"key":"924_CR30","doi-asserted-by":"publisher","first-page":"151279","DOI":"10.1109\/ACCESS.2020.2971650","volume":"8","author":"M Rauf","year":"2020","unstructured":"Rauf M, Guan Z, Yue L, Guo Z, Mumtaz J, Ullah S (2020) Integrated planning and scheduling of multiple manufacturing projects under resource constraints using raccoon family optimization algorithm. IEEE Access 8:151279\u2013151295","journal-title":"IEEE Access"},{"key":"924_CR31","doi-asserted-by":"publisher","first-page":"958","DOI":"10.1016\/j.ejor.2022.09.033","volume":"309","author":"MG S\u00e1nchez","year":"2023","unstructured":"S\u00e1nchez MG, Lalla-Ruiz E, Gil AF, Castro C, Vo\u00df S (2023) Resource-constrained multi-project scheduling problem: a survey. Eur J Oper Res 309:958\u2013976","journal-title":"Eur J Oper Res"},{"key":"924_CR32","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1061\/(ASCE)0733-9364(2004)130:6(869)","volume":"130","author":"AB Senouci","year":"2004","unstructured":"Senouci AB, Eldin NN (2004) Use of genetic algorithms in resource scheduling of construction projects. J Constr Eng Manag 130:869\u2013877","journal-title":"J Constr Eng Manag"},{"key":"924_CR33","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/S0377-2217(97)00348-2","volume":"107","author":"A Sprecher","year":"1998","unstructured":"Sprecher A, Drexl A (1998) Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. Eur J Oper Res 107:431\u2013450","journal-title":"Eur J Oper Res"},{"key":"924_CR34","first-page":"205","volume":"96","author":"A Sprecher","year":"1996","unstructured":"Sprecher A, Kolisch R (1996) PSPLIB\u2014a project scheduling problem library. Eur J Oper Res 96:205\u2013216","journal-title":"Eur J Oper Res"},{"key":"924_CR35","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1287\/mnsc.28.10.1197","volume":"28","author":"FB Talbot","year":"1982","unstructured":"Talbot FB (1982) Resource-constrained project scheduling with time-resource tradeoffs: the nonpreemptive case. Manag Sci 28:1197\u20131210","journal-title":"Manag Sci"},{"key":"924_CR36","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10951-015-0422-4","volume":"19","author":"TA Toffolo","year":"2016","unstructured":"Toffolo TA, Santos HG, Carvalho MA, Soares JA (2016) An integer programming approach to the multimode resource-constrained multiproject scheduling problem. J Sched 19:295\u2013307","journal-title":"J Sched"},{"key":"924_CR37","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. J Sched 23:301\u2013325","journal-title":"J Sched"},{"key":"924_CR38","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/opre.48.1.111.12453","volume":"48","author":"F Vanderbeck","year":"2000","unstructured":"Vanderbeck F (2000) On Dantzig\u2013Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Oper Res 48:111\u2013128","journal-title":"Oper Res"},{"doi-asserted-by":"crossref","unstructured":"Varakantham P, Fu N, Lau HC (2016) A proactive sampling approach to project scheduling under uncertainty. In: Proceedings of the AAAI conference on artificial intelligence","key":"924_CR39","DOI":"10.1609\/aaai.v30i1.10404"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-00924-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-025-00924-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-00924-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:04:24Z","timestamp":1750187064000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-025-00924-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,5]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["924"],"URL":"https:\/\/doi.org\/10.1007\/s12351-025-00924-2","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2025,5,5]]},"assertion":[{"value":"12 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose regarding this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"43"}}