Timkovsky Vadim G.

Vadim G. Timkovsky

Information about the author Vadim G. Timkovsky will soon be added to the site.
Found 4 papers in total
Indential parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
Indential parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
2003
This paper surveys, analyses and establishes new polynomial-time reductions among...
On scheduling cycle shops: classification, complexity and approximation
On scheduling cycle shops: classification, complexity and approximation
2002
This paper considers problems of finding non-periodic and periodic schedules in a...
On preemption redundancy in scheduling unit processing time jobs on two parallel machines
On preemption redundancy in scheduling unit processing time jobs on two parallel machines
2001
McNaughton's theorem states that preemptions in scheduling arbitrary processing time...
Basket problems in margin calculation: Modelling and algorithms
Basket problems in margin calculation: Modelling and algorithms
2001
This paper considers combinatorial models and algorithms for the problems of...
Papers per page: