MATHEMATICAL MODELING OF FINDING EFFECTIVE ALGORITHMS OF TRANSPORT COMPANY FUNCTIONING
Słowa kluczowe:
technological processes, system structure, mathematical model, transport company, algorithmization, operating schedule
Abstrakt
This article is devoted to the study of certain stages of transport enterprises operation processes. The subject of consideration is the technological processes of production of a certain type of products at a single transport enterprise during the technological process in the mechanical assembly shop. To fully represent and consideration of all factors of influence, the enterprise was considered as a human-machine system and further, during the research, an analysis of the structure of the system and the principles of its operation was carried out. This article provides a model of a certain technological process, which, despite its simplicity, is so meaningful that it encompasses a wide range of practical optimization tasks.
Wykaz bibliografii
1. Dudek, R.A., Smith, M.L., Panwalkar, S.S. (1974). Use of a case study in sequencing/ scheduling research. Baltimore: Johns Hopkins University, OMEGA.
2. Hefetz N., Adiri I. (1982). An efficient optimal algorithm for the two-machines, unit-time, jobshop, schedule-length, problem. Math. Oper. Res.
3. Mikhalevich, V.S., Kuksa A.I. (1983). Metodi posledovatelnoy optimizacii v diskretnikh setevikh zadachakh optimalnogo raspredeleniya resursov [Sequential optimization methods in discrete network tasks of optimal resource allocation]. Moskva: Nauka. [in Russian].
4. Van Dam J.P., Gaalman G.J.C., Sierksma G. (1994) Possibilities and Limitations of Using Scheduling Theory in the Process Industry. Springer, Berlin, Heidelberg: Operations Research Proceedings (Gesellschaftfür Operations Research e.V.), vol 1993.
5. Fisher M.L., Lageweg B.J., Lenstra J.K. (1983) Surrogate duality relaxation for job shop scheduling. Elsevier, Amsterdam: Discrete Applied Mathematics
2. Hefetz N., Adiri I. (1982). An efficient optimal algorithm for the two-machines, unit-time, jobshop, schedule-length, problem. Math. Oper. Res.
3. Mikhalevich, V.S., Kuksa A.I. (1983). Metodi posledovatelnoy optimizacii v diskretnikh setevikh zadachakh optimalnogo raspredeleniya resursov [Sequential optimization methods in discrete network tasks of optimal resource allocation]. Moskva: Nauka. [in Russian].
4. Van Dam J.P., Gaalman G.J.C., Sierksma G. (1994) Possibilities and Limitations of Using Scheduling Theory in the Process Industry. Springer, Berlin, Heidelberg: Operations Research Proceedings (Gesellschaftfür Operations Research e.V.), vol 1993.
5. Fisher M.L., Lageweg B.J., Lenstra J.K. (1983) Surrogate duality relaxation for job shop scheduling. Elsevier, Amsterdam: Discrete Applied Mathematics
Abstract views: 117 PDF Downloads: 112
Opublikowane
2021-08-26
Jak cytować
Levterov, A., Kozachok, L., & Kostikova, M. (2021). MATHEMATICAL MODELING OF FINDING EFFECTIVE ALGORITHMS OF TRANSPORT COMPANY FUNCTIONING. Periodyk Naukowy Akademii Polonijnej, 45(2), 309-314. https://doi.org/10.23856/4536
Dział
TECHNOLOGIA, KREATYWNOŚĆ, WDROŻENIE
