Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "milestones" wg kryterium: Wszystkie pola


Wyświetlanie 1-3 z 3
Tytuł:
Robust buffer allocation for scheduling of a project with predefined milestones
Autorzy:
Klimek, M.
Łebkowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/375929.pdf
Data publikacji:
2009
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
resource-constrained project scheduling
predictive-reactive scheduling
robust buffer allocation
milestones
Opis:
The paper discusses the problem of robust buffer allocation for Resource- Constrained Project Scheduling Problem (RCPSP) with predefined milestones(1) , for which execution deadlines have been established. To solve the problem, an algorithm is proposed supporting insertion of unit time buffers, with the simultaneous maximisation of new metrics of arrangement robustness. The presented results of experimental research speak for usability of the solutions proposed. The effectiveness is studied with use of test tasks(2) included in the Project Scheduling Problem Library (PSPLIB) with additionally specified project milestones.
Źródło:
Decision Making in Manufacturing and Services; 2009, 3, 1-2; 49-72
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Two-Phase Algorithm for a Resource Constrained Project Scheduling Problem with Discounted Cash Flows
Autorzy:
Klimek, M.
Łebkowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/375952.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
resource-constrained project scheduling
discounted cash flows
milestones
heuristics
Opis:
This paper presents a Resource-Constrained Project Scheduling Problem (RCPSP) settled by contractual milestones. The criterion analysed here is the maximisation of aggregate discounted cash flows from the contractor´s perspective, known as an RCPSP problem with Discounted Cash Flows (RCPSPDCF). The cash flows analysed here cover the contractor´s cash outflows (negative cash flows), related to the commencement of individual activities, and cash inflows (positive cash flows) after the fulfilment of individual milestones. The authors propose a two-phase algorithm for solving the problem defined. In the first phase, the simulated annealing metaheuristics is used, designed to identify a forward schedule with as high total DCF as possible. In the second phase, the best first-phase schedule is improved by right shifts of activities. To this end, the procedure which iteratively shifts tasks by one unit is applied, with a view to maximising the objective function. Activity shifts take into consideration precedence and resource constraints, and they are performed for a specified resource allocation to activities. This paper also includes an analysis of the problem for a sample project. The results of computational experiments are then analysed. The experiments were run with the use of standard test problems from the Project Scheduling Problem LIBrary (PSPLIB), with additionally defined cash flows and contractual milestones.
Źródło:
Decision Making in Manufacturing and Services; 2013, 7, 1-2; 51-68
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristics for project scheduling with discounted cash flows optimisation
Autorzy:
Klimek, M.
Łebkowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/202107.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
resource-constrained project scheduling
discounted cash flows
milestones
ograniczone zasoby planowania projektu
przepływy pieniężne
kamienie milowe
Opis:
The article presents the resource-constrained project scheduling problem with the maximisation of discounted cash flows from the contractor’s perspective: with cash outflows related to starting individual activities and with cash inflows for completing project stages (milestones). The authors propose algorithms for improving a forward active schedule by iterative one-unit right shifts of activities, taking into account different resource flow networks. To illustrate the algorithms and problem, a numerical example is presented. Finally, the algorithms are tested using standard test problems with additionally defined cash flows and contractual milestones.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2015, 63, 3; 613-622
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies