Browsing by Subject "Solution algorithms"

Now showing 1 - 2 of 2

Open Access
Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
(Pergamon Press, 2010-04) Hazır, O.; Haouari, M.; Erel, E.
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.
Open Access
Parametric pension reform with higher retirement ages: a computational investigation of alternatives for a pay-as-you-go-based pension system
(Elsevier BV, 2001) Sayan, S.; Kiraci, A.
This. paper discusses parametric reform options to control losses generated by a publicly managed pay-as-you-go (PAYG) pension system under alternative deficit reduction (reform) strategies involving changes in contribution and replacement rates and statutory retirement ages. Two different problems corresponding to different pension reform strategies are considered using computational techniques. The techniques are illustrated through exercises employing data for the financially troubled pension system in Turkey. (C) 2001 Elsevier Science B.V. All rights reserved.