Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Elena Borisovna Misura"'
Publikováno v:
Вісник Національного технічного університету "ХПÌ": Системний аналіз, управління та інформаційні технології, Iss 1, Pp 20-24 (2019)
We consider tasks scheduling problem on identical parallel machines by the criterion of minimizing the total weighted tardiness of tasks. All tasks arrive for processing at the same time. Weights and processing times are agreeable, that is, a greater
Externí odkaz:
https://doaj.org/article/c851391372c44b6687eda69c4121c4df
Publikováno v:
Bulletin of National Technical University "KhPI". Series: System Analysis, Control and Information Technologies. :20-24
We consider n tasks scheduling problem on m identical parallel machines by the criterion of minimizing the total weighted tardiness of tasks. All tasks arrive for processing at the same time. Weights and processing times are agreeable, that is, a gre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13b1d0712d152f86d4268f9564ffdd34
https://doi.org/10.20998/2079-0023.2019.01.04
https://doi.org/10.20998/2079-0023.2019.01.04
Autor:
Elena Borisovna Misura, Oleg Valentinovich Melnikov, Iryna Mukha, Alexander A. Pavlov, Kateryna Lishchuk
Publikováno v:
Advances in Computer Science for Engineering and Education II ISBN: 9783030166205
We investigate and justify the efficiency of PSC-algorithm for solving the NP-hard in the strong sense scheduling problem of the total weighted tardiness of jobs minimization on one machine. The problem is used widely in the automation of planning pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6783e8b5a3b83712ac7a94c478c908f0
https://doi.org/10.1007/978-3-030-16621-2_14
https://doi.org/10.1007/978-3-030-16621-2_14
Autor:
Elena Borisovna Misura, Alexander A. Pavlov, Iryna Mukha, Kateryna Lishchuk, Oleg Valentinovich Melnikov
Publikováno v:
Advances in Computer Science for Engineering and Education II ISBN: 9783030166205
We present an approximation algorithm to solve the NP-hard scheduling problem of minimizing the total tardiness on identical parallel machines with a common due date and release dates of jobs. The algorithm has an estimate of the maximum possible dev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a93f78440903a243875e07e39cfd6221
https://doi.org/10.1007/978-3-030-16621-2_43
https://doi.org/10.1007/978-3-030-16621-2_43
Autor:
Oleg Valentinovich Melnikov, Kateryna Lishchuk, Elena Borisovna Misura, Alexander A. Pavlov, Iryna Mukha
Publikováno v:
Advances in Computer Science for Engineering and Education II ISBN: 9783030166205
We study the efficiency of polynomial approximation algorithms for solving NP-hard scheduling problems to minimize total tardiness and total weighted tardiness on one machine. The algorithms are based on PSC-algorithms for the considered problems giv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::895a03080ebc4e3ed8869861a7bf00c5
https://doi.org/10.1007/978-3-030-16621-2_37
https://doi.org/10.1007/978-3-030-16621-2_37
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783319910079
In this paper, we consider an intractable problem of total tardiness of tasks minimization on single machine. The problem has a broad applications solutions during planning process automation in systems in various spheres of human activity. We invest
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9189a464f461802e89714d06fb738545
https://doi.org/10.1007/978-3-319-91008-6_43
https://doi.org/10.1007/978-3-319-91008-6_43