Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: branch and bound scheme

Sortuj według:

Ogranicz wyniki do:

Applied a new method for multi-mode project scheduling

Pisz I., Banaszak Z.

Applied Computer Science

2008

Vol. 4, no 1

114--123

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.