Discrete time/cost trade-off problem: a decomposition-based solutionalgorithm for the budget version

Name: Discrete time/cost trade-off problem: a decomposition-based solutionalgorithm for the budget version
Author: Hazır, Ö., Haouari, Mohamed, Erel, E.

İsim	Discrete time/cost trade-off problem: a decomposition-based solutionalgorithm for the budget version
Yazar	Hazır, Ö., Haouari, Mohamed, Erel, E.
Basım Tarihi:	2010-04
Basım Yeri	- Elsevier
Konu	Project scheduling, Time/cost trade-off, Benders decomposition
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0305-0548
Kayıt Numarası	e9fb303f-b469-404c-b846-370df2fcc15c
Lokasyon	Industrial Engineering
Tarih	2010-04
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	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.
DOI	10.1016/j.cor.2009.06.009
Cilt	37

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Discrete time/cost trade-off problem: a decomposition-based solutionalgorithm for the budget version

Yazar Hazır, Ö., Haouari, Mohamed, Erel, E.

Basım Tarihi 2010-04

Basım Yeri - Elsevier

Konu Project scheduling, Time/cost trade-off, Benders decomposition

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0305-0548

Kayıt Numarası e9fb303f-b469-404c-b846-370df2fcc15c

Lokasyon Industrial Engineering

Tarih 2010-04

Notlar Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Örnek Metin 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.

DOI 10.1016/j.cor.2009.06.009

Cilt 37