| Keyword search (4,163 papers available) | ![]() |
"Multi-mode resource investment problem" Keyword-tagged Publications:
| Title | Authors | PubMed ID | |
|---|---|---|---|
| 1 | On-site workshop investment problem: A novel mathematical approach and solution procedure | Moradi N; Kayvanfar V; Baldacci R; | 38125448 ENCS |
| Title: | On-site workshop investment problem: A novel mathematical approach and solution procedure | ||||
| Authors: | Moradi N, Kayvanfar V, Baldacci R | ||||
| Link: | https://pubmed.ncbi.nlm.nih.gov/38125448/ | ||||
| DOI: | 10.1016/j.heliyon.2023.e22678 | ||||
| Publication: | Heliyon | ||||
| Keywords: | Genetic algorithm; Multi-mode resource investment problem; On-site workshop; Project scheduling; | ||||
| PMID: | 38125448 | Category: | Date Added: | 2023-12-21 | |
| Dept Affiliation: |
ENCS
1 Concordia Institute for Information and Systems Engineering, Concordia University, Montreal, Canada. 2 Division of Engineering Management and Decision Sciences, College of Science and Engineering, Hamad Bin Khalifa University, Qatar Foundation, Doha, Qatar. |
||||
Description: |
In real-world construction sites, On-Site Workshops (OSW) are installed to accelerate construction activities and facilitate the material handling process. These temporary OSWs are cost-effective, leading to decreasing the material handling cost and project makespan, which indicates their important role as a part of a construction project. However, considering the OSW, which has not been addressed in the project scheduling problems, requires the construction site to have a space capacity constraint while considering the workshop size, availability level, and other project-related constraints. In the present work, by considering the OSWs, a real construction project scheduling problem is studied as a Multi-Mode On-Site Workshop Investment Problem with Tardiness (MOSWIPT) while finding the installation/dismantling time of the OSWs. Two new (linear) mathematical programming models are proposed for MOSWIPT. Next, due to the NP-hardness of the problem, an enhanced Genetic Algorithm (GA)-based metaheuristic with efficient problem-specific improvement rules as local search and effective crossover and mutation operators is proposed. Computational experiments show that the proposed method has solved most of the instances of the addressed problem to optimality and outperformed the existing metaheuristics, e.g., Simulated Annealing (SA) and Particle Swarm Optimization (PSO). Finally, conclusions and suggestions for future studies are stated. |



