Temat: teoria algorytmów - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Assignment and sequencing of parts to autonomous workstations
Autorzy:: Lucertini, M.
Nicolo, F.
Smriglio, S.
Powiązania:: https://bibliotekanauki.pl/articles/206675.pdf
Data publikacji:: 2000
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: sterowanie porodukcją
teoria algorytmów
teoria systemów
złożoność obliczeniowa
bipartie matching
coordination mechanism
distributed algorithm
polynomial-time algorithm
Opis:: We present an optimization-based coordination protocol among autonomous workstations in a multiprocessor stage devoted to painting of the shutters in a furniture production process. The coordination aims to maximize the number of parallel operations executable at each machine cycle, while fulfilling constraints on the unique-copy tools. The mechanism is derived by a distributed implementation of a bipartite matching algorithm. The resulting procedure is shown to be compatible with the several autonomous decisions characterizing the process.
Źródło:: Control and Cybernetics; 2000, 29, 1; 221-236
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Parallel approaches to parametric optimization and the convergence of interactive decision support
Autorzy:: Wierzbicki, A.
Powiązania:: https://bibliotekanauki.pl/articles/205708.pdf
Data publikacji:: 2000
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: matematyka obliczeniowa
optymalizacja
optymalizacja parametryczna
programowanie liniowe
programowanie nieliniowe
przetwarzanie równoległe
teoria algorytmów
interactive decision support
optimization
parallel computations
Opis:: In the perspective of parallel processing, a new sense of parametric optimization might be promoted. The paper shows that it, is possible to propose new parallel versions of basic optimization algorithms, as well as an advanced method of securing convergence in interactive mnltiobjective optimization and decision support, all based on a modified concept of parametric embedding. This general idea is exemplified for the case of the simplex algorithm of linear programming by a parameterized and coarse-grain parallel augmented simplex algorithm, where a linear optimization problem can be embedded into a multiple-ohjective family which introduces diversified directions of search cutting through the interior of the original admissible set. For the case of nonlinear programming, a parameterized and coarse-grain parallel variable metric pulsar algorithm is shortly presented, where parallel directional searches are combined with a parametrized variable metric to produce a pulsating, robust nonliear programming algorithm. These two examples concern very basic optimization tools ; at the other end of the spectrmn of optimization-related methods, a general method called outranking trials of securing convergence of interactive multiobjective optimization and decision suport is obtained through parameterizing an outranking relation and using basic properties of order-consistent achievement functions in reference point methodology for testing the existence of outranking points by parallel optimization runs. Thus, the paper presents the use of parallel processing to solve a wide range of modified parametric embedding problems related to optimization and decision support.
Źródło:: Control and Cybernetics; 2000, 29, 1; 427-444
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "teoria algorytmów" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język