Vadim Timkovsky
Vadim Timkovsky
Bestätigte E-Mail-Adresse bei southuniversity.edu
Titel
Zitiert von
Zitiert von
Jahr
Complexity of common subsequence and supersequence problems and related problems
VG Timkovskii
Cybernetics 25 (5), 565-580, 1989
1131989
Ten notes on equal-processing-time scheduling
P Baptiste, P Brucker, S Knust, VG Timkovsky
Quarterly Journal of the Belgian, French and Italian Operations Research …, 2004
602004
Minimizing total weighted error for imprecise computation tasks and related problems
JYT Leung
Handbook of Scheduling 34, 2004
57*2004
Is a unit-time job shop not easier than identical parallel machines?
VG Timkovsky
Discrete applied mathematics 85 (2), 149-162, 1998
401998
On scheduling cycle shops: Classification, complexity and approximation
M Middendorf, VG Timkovsky
Journal of Scheduling 5 (2), 135-169, 2002
382002
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
VG Timkovsky
European Journal of Operational Research 149 (2), 355-376, 2003
342003
On preemption redundancy in scheduling unit processing time jobs on two parallel machines
P Baptiste, VG Timkovsky
Operations Research Letters 28 (5), 205-212, 2001
312001
Total completion time minimization in two-machine job shops with unit-time operations
W Kubiak, V Timkovsky
European journal of operational research 94 (2), 310-320, 1996
301996
A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
VG Timkovsky
Discrete Applied Mathematics 77 (2), 185-200, 1997
271997
On the complexity of scheduling an arbitrary system
VG Timkovskiy
Soviet Journal of Computer and System Sciences 5, 46-52, 1985
261985
Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
P Baptiste, VG Timkovsky
Mathematical Methods of Operations Research 60 (1), 145-153, 2004
252004
Ideal preemptive schedules on two processors
EG Coffman, J Sethuraman, VG Timkovsky
Acta Informatica 39 (8), 597-612, 2003
232003
String noninclusion optimization problems
AR Rubinov, VG Timkovsky
SIAM Journal on Discrete Mathematics 11 (3), 456-467, 1998
231998
Cycle Shop Scheduling.
VG Timkovsky
Handbook of Scheduling, 7-1, 2004
202004
Transversal graphs for partially ordered sets: sequencing, merging and scheduling problems
M Middendorf, VG Timkovsky
Journal of Combinatorial Optimization 3 (4), 417-435, 1999
171999
Fourteen notes on equal-processing-time scheduling
P Baptiste, P Brucker, S Knust, VG Timkovsky
132002
Shortest consistent superstrings computable in polynomial time
T Jiang, VG Timkovsky
Theoretical computer science 143 (1), 113-122, 1995
131995
Polynomial-time algorithm for the Lenstra-Rinnooy Kan two-machine scheduling problem
VG Timkovsky
Kibernetika 2, 109-111, 1985
131985
On the approximation of shortest common non-subsequences and supersequences
VG Timkovsky
Technical report, 1993
111993
Ten notes on equal-processing-time scheduling, 4OR
P Baptiste, P Brucker, S Knust, V Timkovsky
Quarterly Journal of the Belgian, French and Italian Operations Research …, 2004
102004
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20