PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 11

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  resource-constrained project scheduling
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available Insertion algorithms to solve the resource-constrained multi-stage project scheduling problem with discounted cash flow maximization
Klimek M.
Management and Production Engineering Review
|
2018
|
Vol. 9, No. 4
106--116
EN
The article presents the problem of scheduling a multi-stage project with limited availability of resources with the discounted cash flow maximization criterion from the perspective of a contractor. The contractor’s cash outflows are associated with the execution of activities. The client’s payments (cash inflows for the contractor) are performed after completing the agreed project’s stages. The proposed solution for this problem is the use of insertion algorithms. Schedules are generated using forward and backward schedule generation schemes and modified justification techniques. The effectiveness of the proposed procedures is the subject of the examination with the use of standard test instances with additionally defined financial settlements of a project.
2
Content available Symulowane wyżarzanie dla problemu harmonogramowania projektu z ograniczonymi zasobami
Klimek M.
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
|
2016
|
nr 15
53--65
PL
W artykule przedstawiony jest problem harmonogramowania projektu z ograniczonymi zasobami z kryterium minimalizacji czasu trwania przedsięwzięcia. Do rozwiązania zagadnienia stosowany jest algorytm symulowanego wyżarzania, którego skuteczność testowana jest przy wykorzystaniu standardowych zadań testowych. Eksperymenty przeprowadzane są przy różnych konfiguracjach algorytmu w celu ustalenia najlepszych parametrów: schematu chłodzenia, technik przeszukiwania (ruchów), schematów generowania rozwiązań.
EN
In this paper resource-constrained project scheduling problem with optimisation criterion of minimising makespan is presented. To solve the problem is applied simulated annealing algorithm, whose effectiveness is tested using standard test instances. Experiments are performed with different configurations algorithm to determine the best parameters: cooling schemes, search techniques (moves), schedule generation schemes.
3
Improvement algorithm for a scheduling problem with maximising criterion for discounted cash flows in a project settled by milestones
Klimek M., Łebkowski P.
Logistyka
|
2015
|
nr 2
352--358, CD1
EN
The paper presents the project scheduling problem with DCF maximising criteri on . The authors analyse their independently developed model in which a project is settled by milestones, while cash flows are linked to the execution of individual activities and milestones. Rules are discussed governing the development of a schedule appropriate for the NPV optimising problem. A procedure is proposed for improving solutions obtained with the use of schedule generation schemes; the procedure provides for right - hand side shifts of activities. The both model and improvement algorithm developed are applied to a specific project. The paper concludes with the presentation of results of computational experiments and analysis thereof.
PL
W artykule przedstawiony jest problem harmonogramowania projektu z kryterium maksymalizacji zdyskontowanych przepływów pieniężnych . Analizowany jest autorski model, w którym projekt rozliczany jest etapowo a przepływy pieniężne związane są z realizacją zadań i umownych etapów projektu (kamieni milowych). Omówione są zasady tworzenia harmonogramu odpowiedniego dla problemu optymalizacji NPV. Zaproponowana jest procedura poprawy rozwiązań uzyskiwanych przy użyciu schematów generowania harmonogramu przez przesunięcia prawostronne czynności. Model i opracowany algorytm poprawy zilustrowane są dla przykładowego projektu. Na koniec zademonstrowane są wyniki eksperymentów obliczeniowych i analiza tych wyników.
4
Content available Heuristics for project scheduling with discounted cash flows optimisation
Klimek M., Łebkowski P.
Bulletin of the Polish Academy of Sciences. Technical Sciences
|
2015
|
Vol. 63, nr 3
613--622
EN
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.
5
Content available A Two-Phase Algorithm for a Resource Constrained Project Scheduling Problem with Discounted Cash Flows
Klimek M., Łebkowski P.
Decision Making in Manufacturing and Services
|
2013
|
Vol. 7, no. 1-2
51--68
EN
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.
6
Content available Resource allocation for robust project scheduling
Klimek M., Łebkowski P.
Bulletin of the Polish Academy of Sciences. Technical Sciences
|
2011
|
Vol. 59, nr 1
51-55
EN
The paper presents a formal description of the resource allocation problem for resource-constrained project scheduling. A schedule can be executed by various resource flow networks which may differ in terms of resistance to disruptions occurring during project execution. The authors define such criteria of evaluating a resource flow network which can be more useful than robustness metrics used so far in the research. The authors discuss the importance of robust scheduling for execution projects and propose metrics for resource allocation robustness which take into consideration the stability of the final schedule. Those metrics make it possible to carry out a more precise analysis concerning the properties of the resource flow network in terms of its robustness to disruptions in comparison with a well known flexibility indicator, flex.
7
Content available Alokacja zasobów dla problemu harmonogramowania projektu z ważonymi kosztami niestabilności
Klimek M., Łebkowski P.
Automatyka / Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie
|
2011
|
T. 15, z. 2
237-245
PL
Artykuł przedstawia problem alokacji zasobów dla zagadnienia harmonogramowania projektu z ograniczoną dostępnością zasobów z ważonymi kosztami niestabilności zadań. Wskazano na zasady rozdziału, które mogą wpłynąć na wzrost odporności harmonogramu. Zaproponowano miary odporności rozdziału zasobów, które uwzględniają wpływ wydłużenia czynności na stabilność zrealizowanego uszeregowania.
EN
Article presents resource allocation problem for resource-constrained project scheduling problem with weighted instability costs of tasks. Rules of allocations which may have an influence on increase robustness of schedule were denoted. Measures of robustness of resource allocations which take into consideration the effect of the duration lengthening for individual activities on the stability of the schedule completed were proposed.
8
Algorytm priorytetowy alokacji buforów dla problemu harmonogramowania projektu ze zdefiniowanymi kamieniami milowymi
Klimek M., Łebkowski P.
Logistyka
|
2010
|
nr 2
PL
Artykuł prezentuje model harmonogramowania projektu z ograniczoną dostępnością zasobów (ang. RCPSP - Resource-Constrained Project Scheduling Problem) ze zdefiniowanymi terminami realizacji kamieni milowych projektu. Dla tego modelu proponowany jest priorytetowy algorytm alokacji buforów. Skuteczność opisanego algorytmu jest testowana przy użyciu zbioru instancji J30 i J90 z biblioteki PSPLIB (ang. Project Scheduling Problem LIBrary).
EN
This paper presents a model of the Resource-Constrained Project Scheduling Problem (RCPSP) with defined terms of milestones achievement. For this model is proposed priority algorithm of buffer allocation. Effectiveness of described algorithm is tested using a set of J30 and J90 problem instances from the Project Scheduling Problem LIBrary (PSPLIB).
9
Content available Robust buffer allocation for scheduling of a project with predefined milestones
Klimek M., Łebkowski P.
Decision Making in Manufacturing and Services
|
2009
|
Vol. 3, no. 1-2
49-72
EN
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.
10
Content available Algorytmy odpornej alokacji zasobów dla problemu harmonogramowania projektu z ograniczoną dostępnością zasobów
Klimek M., Łebkowski P.
Automatyka / Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie
|
2009
|
T. 13, z. 2
371-379
PL
W artykule przedstawiono algorytmy odpornej alokacji zasobów dla problemu harmonogramowania projektu z ograniczoną dostępnością zasobów. Skuteczność algorytmów przydziału zasobów przetestowano przy użyciu zbioru zadań testowych J90 z biblioteki PSPLIB. Jako kryterium oceny stosowano zaproponowane przez autorów miary odporności alokacji zasobów.
EN
In article are presented algorithms of robust resource allocation for resource-constrained project scheduling problem. Effectiveness of algorithms have been tested on the J90 instance set of PSPLIB. As the evaluation criterion proposed by authors measures of robustness of resource allocations were applied.
11
Content available Applied a new method for multi-mode project scheduling
Pisz I., Banaszak Z.
Applied Computer Science
|
2008
|
Vol. 4, no 1
114--123
EN
The aim of this paper is to present a modelling heuristic framework that enables one to cope with a problem of a project-driven manufacturing. The objective is to find computationally effective method aimed at scheduling of a new project subject to constraints imposed by a multi-project environment. The application of a heuristic method of scheduling is demonstrated on one example of a makespan-feasible schedule that follows the constraints imposed by the precedence relation and by the time-constrained resources availability. This heuristic method is based on concept of critical path and branch and bound scheme.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.