This paper presents an adaptation of the Theory of Constraint (TOC ) to the multi - project scheduling problem. Variables customer expectations have forced changes in the company management. Now more than 25% of economic activity suited to manage the projects. This concerns mainly the areas such as engineering, public works sector, aerospace and defense, shipbuilding, organizational consulting, etc. The project is a single, unique event, finished in a certain period of time without exceeding the established budget.The interpretation of TOC and constrained - based scheduling is a solution to maximize the number of project, which the enterprise is able to implement simultaneously. Scheduling problems arise in situations where a set of activities has to be processed by a limited number of resources during a limited period of time. The scheduling problem consists of resources allocation and resources scheduling - ordering of activities on each resource. The alternative way of resources occupancy is presented.
PL
W artykule zaprezentowano adaptację Teorii Ograniczeń w środowisku wieloprojektowym. Obecnie ponad 25% działalności gospodarczej nadaje się do zarządzania przez projekty (inżynieria, doradztwo, przemysł lotniczy itp.). Projekt to jednorazowe działanie niepowtarzalne, złożone, skończone w określonym czasie, które prowadzi do zrealizowania unikatowego zdarzenia. Zastosowanie teorii ograniczeń do harmonogramowania w warunkach ograniczeń zasobowym umożliwia maksymalizację projektów przyjętych do realizacji. Problemy harmonogramowania powstają w sytuacjach, gdzie zbiór czynności musi zostać zrealizowany na ograniczonej liczbie zasobów w zadanym czasie. W artykule zaproponowano alternatywne podejście do zajętości zasobów w harmonogramowaniu projektów w środowisku wieloprojektowym.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
This paper presents an Ant Colony Optimization (ACO) approach to the resource-constrained project scheduling problem (RCPSP). RCPSP as a generalization of the classical job shop scheduling problem belongs to the class of NP-hard optimization problems. Therefore, the use of heuristic solution procedures when solving large problem is well-founded. Most of the heuristic methods used for solving resource-constrained project scheduling problems either belong to the class of priority rule based methods or to the class of metaheuristic based approaches. ACO is a metaheuristic method in which artificial ants build solutions by probabilistic selecting from problem-specific solutions components influenced by a parametrized model of solution, called pheromone model. In ACO several generations of artificial ants search for good solution. Every ant builds a solution step by step going through several probabilistic decisions. If ant find a good solution mark their paths by putting some amount of pheromone (which is guided by some problem specific heuristic) on the edges of the path.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The paper deals with the problem of new projects acceptance into the multi project environment, where constraints are limiting the number of projects that a company is able to carry out concurrently. The objective of this paper is to answer the question: Is it possible to execute new project on time in the multiproject environment? For answering the question combination of Theory of Constraints and conditions guaranteeing project due dates with constraint-based scheduling are proposed. As a result the decision of the project implementation and the schedule of project activities, which the company is able to implement concurrently are obtained.
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ć.