Zobrazeno 1 - 2
of 2
pro vyhledávání: '"boolean linear programming model"'
Autor:
Romanuke Vadim
Publikováno v:
Applied Computer Systems, Vol 24, Iss 2, Pp 150-160 (2019)
Two possibilities of obtaining the minimal total weighted tardiness in tight-tardy single machine preemptive idling-free scheduling are studied. The Boolean linear programming model, which allows obtaining the exactly minimal tardiness, becomes too t
Externí odkaz:
https://doaj.org/article/b41b559906ac4891a947e8c9ce988f02
Autor:
Vadim V. Romanuke
Publikováno v:
Applied Computer Systems, Vol 24, Iss 2, Pp 150-160 (2019)
Two possibilities of obtaining the minimal total weighted tardiness in tight-tardy single machine preemptive idling-free scheduling are studied. The Boolean linear programming model, which allows obtaining the exactly minimal tardiness, becomes too t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5bd1d7095eb866131cb95614b0bcbc4
https://doaj.org/article/b41b559906ac4891a947e8c9ce988f02
https://doaj.org/article/b41b559906ac4891a947e8c9ce988f02