Linear programming based approaches for the discrete time/cost trade-off problem in project networks / A. B. Hafizoglu in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 676–685 Titre : Linear programming based approaches for the discrete time/cost trade-off problem in project networks Type de document : texte imprimé Auteurs : A. B. Hafizoglu, Auteur ; Azizoglu, M., Auteur Année de publication : 2010 Article en page(s) : pp. 676–685 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Project management Time/cost trade-off Linear programming Branch and bound Index. décimale : 001.424 Résumé : In project management, the activity durations can often be reduced by dedicating additional resources. The Time/Cost Trade-off Problem considers the compromise between the total cost and the project duration. The discrete version of the problem assumes a number of time/cost pairs, called modes, and selects a mode for each activity. In this paper, we consider the Discrete Time/Cost Trade-off Problem. We study the Deadline Problem, that is, the problem of minimizing total cost subject to a deadline on the project duration. To solve the Deadline Problem, we propose optimization and approximation algorithms that are based on the optimal Linear Programming Relaxation solutions. Our computational results from large-sized problem instances reveal the satisfactory behaviour of our algorithms. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200920a.html [article] Linear programming based approaches for the discrete time/cost trade-off problem in project networks [texte imprimé] / A. B. Hafizoglu, Auteur ; Azizoglu, M., Auteur . - 2010 . - pp. 676–685. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 676–685 Mots-clés : Project management Time/cost trade-off Linear programming Branch and bound Index. décimale : 001.424 Résumé : In project management, the activity durations can often be reduced by dedicating additional resources. The Time/Cost Trade-off Problem considers the compromise between the total cost and the project duration. The discrete version of the problem assumes a number of time/cost pairs, called modes, and selects a mode for each activity. In this paper, we consider the Discrete Time/Cost Trade-off Problem. We study the Deadline Problem, that is, the problem of minimizing total cost subject to a deadline on the project duration. To solve the Deadline Problem, we propose optimization and approximation algorithms that are based on the optimal Linear Programming Relaxation solutions. Our computational results from large-sized problem instances reveal the satisfactory behaviour of our algorithms. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200920a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire