Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Descending job order"'
Autor:
Vadim V. Romanuke
Publikováno v:
KPI Science News, Iss 4 (2021)
Background. In setting a problem of minimizing total weighted tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or descen
Externí odkaz:
https://doaj.org/article/29fc45d68ae4418f8379bf1a03fcd8ea
Autor:
Vadim V. Romanuke
Publikováno v:
KPI Science News, Iss 3 (2020)
Background. In setting a problem of minimizing total tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or descending orde
Externí odkaz:
https://doaj.org/article/48540e8d698f47dd8dcf8c68bedb5fc4
Autor:
Vadim V. Romanuke
Publikováno v:
KPI Science News, Iss 2 (2020)
Background. In setting a problem of minimizing total tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or descending orde
Externí odkaz:
https://doaj.org/article/ca71c23583894f8aa7e610d048d5a216
Autor:
Vadim V. Romanuke
Publikováno v:
Наукові вісті КПІ; № 2 (2020); 64-73
KPI Science News; № 2 (2020); 64-73
Научные вести КПИ; № 2 (2020); 64-73
KPI Science News, Vol 0, Iss 2, Pp 64-73 (2020)
KPI Science News; № 2 (2020); 64-73
Научные вести КПИ; № 2 (2020); 64-73
KPI Science News, Vol 0, Iss 2, Pp 64-73 (2020)
Background. In setting a problem of minimizing total tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or descending orde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50fd64be48ae86d80a6b40f44a3719e0
https://doi.org/10.20535/kpi-sn.2020.2.181869
https://doi.org/10.20535/kpi-sn.2020.2.181869
Autor:
Vadim V. Romanuke
Publikováno v:
KPI Science News, Vol 0, Iss 1, Pp 27-39 (2020)
Наукові вісті КПІ; № 1 (2020); 27-39
KPI Science News; № 1 (2020); 27-39
Научные вести КПИ; № 1 (2020); 27-39
Наукові вісті КПІ; № 1 (2020); 27-39
KPI Science News; № 1 (2020); 27-39
Научные вести КПИ; № 1 (2020); 27-39
Background. A schedule ensuring the exactly minimal total tardiness can be found with the respective integer linear programming problem. An open question is whether the exact schedule computation time changes if the job release dates are input to the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9df6ce359f83ab753c61938d9ba6483f
https://doi.org/10.20535/kpi-sn.2020.1.180877
https://doi.org/10.20535/kpi-sn.2020.1.180877
Autor:
Romanuke, Vadim V.
Publikováno v:
Наукові вісті КПІ; № 3 (2020); 32-42
KPI Science News; № 3 (2020); 32-42
Научные вести КПИ; № 3 (2020); 32-42
KPI Science News; № 3 (2020); 32-42
Научные вести КПИ; № 3 (2020); 32-42
Background. In setting a problem of minimizing total tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or descending orde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=scientific_p::5b477820eb9d0e540ca2b739ddde890e
http://scinews.kpi.ua/article/view/199850
http://scinews.kpi.ua/article/view/199850
Autor:
Vadim V. Romanuke
Publikováno v:
KPI Science News, Vol 0, Iss 3, Pp 32-42 (2020)
Проблематика. У постановці задачі мінімізації загального запізнювання за евристикою на основі використання залишкового наявного ресу
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ba76289381ce716d4af95aef2be06d7
https://ela.kpi.ua/handle/123456789/40445
https://ela.kpi.ua/handle/123456789/40445
Publikováno v:
Наукові вісті КПІ; № 4 (2020)
KPI Science News; No. 4 (2020)
Научные вести КПИ; № 4 (2020)
KPI Science News; No. 4 (2020)
Научные вести КПИ; № 4 (2020)
Background. In setting a problem of minimizing total weighted tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or descen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=scientific_p::4e7373466970a5e44b664ebf1365ae74
http://scinews.kpi.ua/article/view/209129
http://scinews.kpi.ua/article/view/209129
Autor:
Vadim V. Romanuke
Проблематика. У постановці задачі мінімізації загального зваженого запізнювання за евристикою на основі використання залишкового ная
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d65288e966b7522eab205f63574fdf7
https://doi.org/10.20535/kpisn.2020.4.209129
https://doi.org/10.20535/kpisn.2020.4.209129