Vladimir Kotov

Publication Activity (10 Years)

Years Active: 1996-2018
Publications (10 Years): 4

Top Topics

Scheduling Problem

Online Learning

Processing Times

Top Venues

Oper. Res. Lett.

Inf. Process. Lett.

Publications

Alexandre Dolgui, Vladimir Kotov, Aliaksandr Nekrashevich, Alain Quilliot
General parametric scheme for the online uniform machine scheduling problem with two different speeds. Inf. Process. Lett. 134 (2018)
Michaël Gabay, Nadia Brauner, Vladimir Kotov
Improved lower bounds for the online bin stretching problem. 4OR 15 (2) (2017)
Hans Kellerer, Vladimir Kotov, Michaël Gabay
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time. J. Sched. 18 (6) (2015)
Michaël Gabay, Vladimir Kotov, Nadia Brauner
Online bin stretching with bunch techniques. Theor. Comput. Sci. 602 (2015)
Hans Kellerer, Vladimir Kotov
An efficient algorithm for bin stretching. Oper. Res. Lett. 41 (4) (2013)
T. C. E. Cheng, Hans Kellerer, Vladimir Kotov
Algorithms better than LPT for semi-online scheduling with decreasing processing times. Oper. Res. Lett. 40 (5) (2012)
Hans Kellerer, Vladimir Kotov
A 3/2-approximation algorithm for 3/2-partitioning. Oper. Res. Lett. 39 (5) (2011)
Dayong Cao, Vladimir Kotov
A best-fit heuristic algorithm for two-dimensional bin packing problem. EMEIT (2011)
Vladimir Kotov
Reuse in Software Development Organizations in Latvia. Sci. J. Riga Tech. Univ. Ser. Comput. Sci. 41 (2010)
C. T. Ng, T. C. Edwin Cheng, Vladimir Kotov, Mikhail Y. Kovalyov
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications. Discret. Appl. Math. 157 (8) (2009)
M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov, Mikhail Y. Kovalyov
Batch scheduling of step deteriorating jobs. J. Sched. 11 (1) (2008)
T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov
A new algorithm for online uniform-machine scheduling to minimize the makespan. Inf. Process. Lett. 99 (3) (2006)
T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov
Semi-on-line multiprocessor scheduling with given total processing time. Theor. Comput. Sci. 337 (1-3) (2005)
Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
Algorithms for on-line bin-packing problems with cardinality constraints. Discret. Appl. Math. 143 (1-3) (2004)
T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov
Lower Bounds and Semi On-line Multiprocessor Scheduling. Comput. Sci. J. Moldova 11 (2) (2003)
Hans Kellerer, Vladimir Kotov
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing. Oper. Res. Lett. 31 (1) (2003)
Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
On-Line Algorithms for Cardinality Constrained Bin Packing Problems. ISAAC (2001)
Hans Kellerer, Vladimir Kotov, Franz Rendl, Gerhard J. Woeginger
The Stock Size Problem. Oper. Res. 46 (3-Supplement-3) (1998)
Luitpold Babel, Hans Kellerer, Vladimir Kotov
-partitioning problem. Math. Methods Oper. Res. 47 (1) (1998)
Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza
Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21 (5) (1997)
Vladimir Kotov, Michail M. Kovalev
Maximum travelling salesman problem. Math. Methods Oper. Res. 43 (2) (1996)