Zobrazeno 1 - 6
of 6
pro vyhledávání: ''
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
Autor:
Loupis, Michalis
Publikováno v:
Business Systems Research; Mar2014, Vol. 5 Issue 1, p6-20, 15p
Publikováno v:
Organizacija; Nov/Dec2009, Vol. 42 Issue 6, p233-240, 8p, 3 Diagrams, 4 Graphs
Autor:
Rabiej, Małgorzata, Rabiej, Stanisław
Publikováno v:
Fibres & Textiles in Eastern Europe; Jan/Dec2005, Vol. 13 Issue 5, p75-78, 4p, 5 Graphs
Autor:
Vladimir V. Kamburg, Vadim V. Romanuke
Publikováno v:
Applied Computer Systems, Vol 20, Iss 1, Pp 5-14 (2016)
Approximation in solving the infinite two-person non-cooperative games is studied in the paper. An approximation approach with conversion of infinite game into finite one is suggested. The conversion is fulfilled in three stages. Primarily the player
Publikováno v:
Fibres & Textiles in Eastern Europe; May/Jun2012, Vol. 20 Issue 3, p43-45, 3p