A Benders decomposition algorithm for the multi-mode resource-constrained multi-project scheduling problem with uncertainty

Maryam Sadeghloo (), Saeed Emami () and Ali Divsalar ()
Additional contact information
Maryam Sadeghloo: Babol Noshirvani University of Technology
Saeed Emami: Babol Noshirvani University of Technology
Ali Divsalar: Babol Noshirvani University of Technology

Annals of Operations Research, 2024, vol. 339, issue 3, No 20, 1637-1677

Abstract: Abstract In this research, we focus on the multi-mode resource-constrained multi-project scheduling problem from the perspective of consultants who attend design-bid-build contracts and put their efforts to optimize the client and contractors’ profits simultaneously. Each contractor may have a different level of knowledge and experience to perform a project. Therefore, the contractor selection to execute a project may affect the quality and satisfaction level of the project. This study aims to schedule activities of a certain number of projects with multiple execution modes and pre-specified relations. A multi-objective mixed-integer linear programming model is proposed to maximize satisfaction in contractor selection, minimize the total cost of projects and earliness and tardiness penalties, and minimize the total completion time of projects subject to resource constraints. It is assumed that activity durations are uncertain; thereby the globalized robust counterpart of the formulation is presented such that the normal range of the perturbation is the intersection of a box and a polyhedral. The proposed multi-objective model is solved by the multi-choice goal programming approach. This problem is computationally complex and the Benders decomposition (BD) method is utilized to solve it. Numerical experiments on different instances prove the quality of the proposed BD method and illustrate that the proposed model is capable of selecting a proper contractor and multi-project scheduling.

Keywords: Multi-mode multi-project scheduling; Multi-choice goal programming; Globalized robust counterpart; Benders decomposition algorithm (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-023-05403-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:339:y:2024:i:3:d:10.1007_s10479-023-05403-5

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-023-05403-5

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().