Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "LINGO" wg kryterium: Temat


Wyświetlanie 1-2 z 2
Tytuł:
Minimizing length in a mixed model two sided assembly line using exact search method
Autorzy:
Yadav, Ashish
Verma, Pawan
Agrawal, Sunil
Powiązania:
https://bibliotekanauki.pl/articles/406705.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
two-sided assembly line balancing
mixed model
mathematical model
lingo-17 solver
Opis:
In the two-sided mixed-model assembly line, there is a process of installing two single stations in each position left and right of the assembly line with the combining of the product model. The main aim of this paper is to develop a new mathematical model for the mixed model two-sided assembly line balancing (MTALB) generally occurs in plants producing large-sized high-volume products such as buses or trucks. According to the literature review, authors focus on research gap that indicate in MTALB problem, minimize the length of the line play crucial role in industry space optimization.In this paper, the proposed mathematical model is applied to solve benchmark problems of two-sided mixed-model assembly line balancing problem to maximize the workload on each workstation which tends to increase the compactness in the beginning workstations which also helps to minimize the length of the line. Since the problem is well known as np-hard problem benchmark problem is solved using a branch and bound algorithm on lingo 17.0 solver and based on the computational results, station line effectiveness and efficiency that is obtained by reducing the length of the line in mated stations of the assembly line is increased.
Źródło:
Management and Production Engineering Review; 2019, 10, 4; 72-80
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fuzzy goal programming technique for multi-objective indefinite quadratic bilevel programming problem
Autorzy:
Arora, R.
Gupta, K.
Powiązania:
https://bibliotekanauki.pl/articles/1403683.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
bilevel programming
indefinite quadratic programming
multi-objective programming
pay-off matrix
Taylor series approximation
LINGO 17.0
Opis:
Bilevel programming problem is a non-convex two stage decision making process in which the constraint region of upper level is determined by the lower level problem. In this paper, a multi-objective indefinite quadratic bilevel programming problem (MOIQBP) is presented. The defined problem (MOIQBP) has multi-objective functions at both the levels. The followers are independent at the lower level. A fuzzy goal programming methodology is employed which minimizes the sum of the negative deviational variables of both the levels to obtain highest membership value of each of the fuzzy goal. The membership function for the objective functions at each level is defined. As these membership functions are quadratic they are linearized by Taylor series approximation. The membership function for the decision variables at both levels is also determined. The individual optimal solution of objective functions at each level is used for formulating an integrated pay-off matrix. The aspiration levels for the decision makers are ascertained from this matrix. An algorithm is developed to obtain a compromise optimal solution for (MOIQBP). A numerical example is exhibited to evince the algorithm. The computing software LINGO 17.0 has been used for solving this problem.
Źródło:
Archives of Control Sciences; 2020, 30, 4; 683-699
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies