Wyniki wyszukiwania - BazTech

1

Project oriented production optimization

Skołud B, Marcińczyk B.

Journal of Machine Engineering

|

2012

|

Vol. 12, No. 3

80--90

EN

In this paper the resource - constrained scheduling problem is discussed. The objective function is minimization of makespan under constrained resources and due time. The metaheuristic based on Ant Colony Optimization (ACO) is proposed for multi-project scheduling. The elaborated method, algorithm and example illustrating ACO application for the multi-project scheduling problem is presented.

2

The resources occupancy in resource - constrained multi project scheduling problem

Skołud B., Marcińczyk B.

Computer Methods in Materials Science

|

2011

|

Vol. 11, No. 2

290-296

EN

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.

3

Ant colony optimization in project management

Skołud B., Marcińczyk B.

Computer Assisted Mechanics and Engineering Sciences

|

2007

|

Vol. 14, No. 4

745-752

EN

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.