BazTech - Yadda

Ograniczanie wyników

1 Management and Production Engineering Review

1 2010

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: permutation flow shop

Sortuj według:

Ogranicz wyniki do:

Some heuristics for makespan minimization in permutation flow-shop

Dolgui A., Ofitserov D.

Management and Production Engineering Review

2010

Vol. 1, No. 4

19-25

This paper deals with the study of makespan optimization for the flow-shop production systems with or without infinite buffers between machines. Two scheduling algorithms are presented. They are based on several ideas from global optimization for continuous functions. In particular, ψ-transform technique is employed. This is a very interesting research direction to find heuristics with solid theoretical foundations and with a possibility to estimate subsequently their error. Consequently, problems of real size and actual complexity can be dealt with a certain confidence in the quality of the results. The algorithms proposed include also the Petrov matrix and the Gilmore-Gomory methods. The effciency of the algorithms proposed is illustrated with numerical tests on examples known in literature and on randomly generated tests.