Browsing by Author "Haouari, Mohamed"

Now showing 1 - 2 of 2

Citation - WoS: 43
Citation - Scopus: 55
Discrete Time/Cost Trade-Off Problem: a Decomposition-Based Solution Algorithm for the Budget Version
(Pergamon-elsevier Science Ltd, 2010) Hazir, Oencue; Haouari, Mohamed; Erel, Erdal
This paper investigates the budget variant of the discrete time/cost trade-off problem (DTCTP). This multi-mode project scheduling problem requires assigning modes to the activities of a project so that the total completion time is minimized and the budget and the precedence constraints are satisfied. This problem is often encountered in practice as timely completion of the projects without exceeding the budget is crucial. The contribution of this paper to the literatures is to describe an effective Benders Decomposition-based exact algorithm to solve the DTCTP instances of realistic sizes. Although Benders Decomposition often exhibits a very slow convergence, we have included several algorithmic features to enhance the performance of the proposed tailored approach. Computational results attest to the efficacy of the proposed algorithm, which can solve large-scale instances to optimality. (C) 2009 Elsevier Ltd. All rights reserved.
Citation - WoS: 102
Robust Scheduling and Robustness Measures for the Discrete Time/Cost Trade-Off Problem
(Elsevier Science Bv, 2010) Hazir, Oencue; Haouari, Mohamed; Erel, Erdal
Projects are often subject to various sources of uncertainties that have a negative impact on activity durations and costs. Therefore, it is crucial to develop effective approaches to generate robust project schedules that are less vulnerable to disruptions caused by uncontrollable factors. In this paper, we investigate the robust discrete time/cost trade-off problem, which is a multi-mode project scheduling problem with important practical relevance. We introduce surrogate measures that aim at providing an accurate estimate of the schedule robustness. The pertinence of each proposed measure is assessed through computational experiments. Using the insights revealed by the computational study, we propose a two-stage robust scheduling algorithm. Finally, we provide evidence that the proposed approach can be extended to solve a complex robust problem with tardiness penalties and earliness revenues. (C) 2010 Elsevier B.V. All rights reserved.