Nodari Vakhania
Nodari Vakhania
Dirección de correo verificada de uaem.mx
TítuloCitado porAño
An optimal rounding gives a better approximation for scheduling unrelated machines
EV Shchepin, N Vakhania
Operations Research Letters 33 (2), 127-133, 2005
1322005
Restarts can help in the on‐line minimization of the maximum delivery time on a single machine
M Akker, H Hoogeveen, N Vakhania
Journal of Scheduling 3 (6), 333-341, 2000
362000
Restarts can help in the on‐line minimization of the maximum delivery time on a single machine
M Akker, H Hoogeveen, N Vakhania
Journal of Scheduling 3 (6), 333-341, 2000
362000
Preemptive scheduling in overloaded systems
M Chrobak, L Epstein, J Noga, J Sgall, R van Stee, T Tichý, N Vakhania
International Colloquium on Automata, Languages, and Programming, 800-811, 2002
312002
Single-machine scheduling with release times and tails
N Vakhania
Annals of Operations Research 129 (1-4), 253-271, 2004
292004
A better algorithm for sequencing with release and delivery times on identical machines
N Vakhania
Journal of Algorithms 48 (2), 273-293, 2003
272003
Preemptive scheduling of equal-length jobs to maximize weighted throughput
P Baptiste, M Chrobak, C Dürr, W Jawor, N Vakhania
Operations Research Letters 32 (3), 258-264, 2004
222004
Preemptive scheduling of equal-length jobs to maximize weighted throughput
P Baptiste, M Chrobak, C Dürr, W Jawor, N Vakhania
Operations Research Letters 32 (3), 258-264, 2004
222004
Task distributions on multiprocessor systems
EV Shchepin, NN Vakhania
IFIP International Conference on Theoretical Computer Science, 112-125, 2000
182000
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
N Vakhania, F Werner
Theoretical Computer Science 501, 72-81, 2013
17*2013
Preemptive scheduling in overloaded systems
M Chrobak, L Epstein, J Noga, J Sgall, R van Stee, T Tichý, N Vakhania
Journal of Computer and System Sciences 67 (1), 183-197, 2003
172003
Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
N Vakhania
Operations Research Letters 37 (6), 405-410, 2009
122009
Concurrent operations can be parallelized in scheduling multiprocessor job shop
N Vakhania, E Shchepin
Journal of Scheduling 5 (3), 227-245, 2002
122002
A study of single-machine scheduling problem to maximize throughput
N Vakhania
Journal of Scheduling 16 (4), 395-403, 2013
112013
Branch less, cut more and minimize the number of late equal-length jobs on identical machines
N Vakhania
Theoretical Computer Science 465, 49-60, 2012
92012
On the geometry, preemptions and complexity of multiprocessor and shop scheduling
EV Shchepin, N Vakhania
Annals of Operations Research 159 (1), 183-213, 2008
92008
Theoretical expectation versus practical performance of Jackson’s heuristic
N Vakhania, D Pérez, L Carballo
Mathematical Problems in Engineering 2015, 2015
82015
Scheduling unrelated machines with two types of jobs
N Vakhania, JA Hernandez, F Werner
International Journal of Production Research 52 (13), 3793-3801, 2014
72014
Little-preemptive scheduling on unrelated processors
E Shchepin, N Vakhania
Journal of Mathematical Modelling and Algorithms 1 (1), 43-56, 2002
72002
Scheduling equal-length jobs with delivery times on identical processors
N Vakhania
International journal of computer mathematics 79 (6), 715-728, 2002
72002
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20