A comparative analysis of MIP formulations for the multi-mode resource-constrained independent task scheduling problem
<p dir="ltr">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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , |
| منشور في: |
2025
|
| الموضوعات: | |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | <p dir="ltr">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–Wolfe 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%.</p><h2>Other Information</h2><p dir="ltr">Published in: Operational Research<br>License: <a href="https://creativecommons.org/licenses/by/4.0" target="_blank">https://creativecommons.org/licenses/by/4.0</a><br>See article on publisher's website: <a href="https://dx.doi.org/10.1007/s12351-025-00924-2" target="_blank">https://dx.doi.org/10.1007/s12351-025-00924-2</a></p> |
|---|