Follow
Nodari Vakhania
Title
Cited by
Cited by
Year
An optimal rounding gives a better approximation for scheduling unrelated machines
EV Shchepin, N Vakhania
Operations Research Letters 33 (2), 127-133, 2005
1612005
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
442000
Single-machine scheduling with release times and tails
N Vakhania
Annals of Operations Research 129 (1), 253-271, 2004
412004
A better algorithm for sequencing with release and delivery times on identical machines
N Vakhania
Journal of Algorithms 48 (2), 273-293, 2003
382003
Preemptive scheduling in overloaded systems
M Chrobak, L Epstein, J Noga, J Sgall, R van Stee, T Tichı, N Vakhania
Automata, Languages and Programming: 29th International Colloquium, ICALP …, 2002
332002
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
27*2013
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
272004
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
272004
Task distributions on multiprocessor systems
EV Shchepin, NN Vakhania
Theoretical Computer Science: Exploring New Frontiers of Theoretical …, 2000
202000
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
162009
On the geometry, preemptions and complexity of multiprocessor and shop scheduling
EV Shchepin, N Vakhania
Annals of Operations Research 159 (1), 183-213, 2008
162008
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
152012
Concurrent operations can be parallelized in scheduling multiprocessor job shop
N Vakhania, E Shchepin
Journal of Scheduling 5 (3), 227-245, 2002
152002
Scheduling unrelated machines with two types of jobs
N Vakhania, JA Hernandez, F Werner
International Journal of Production Research 52 (13), 3793-3801, 2014
142014
Theoretical expectation versus practical performance of Jackson’s heuristic
N Vakhania, D Pérez, L Carballo
Mathematical Problems in Engineering 2015, 2015
132015
A study of single-machine scheduling problem to maximize throughput
N Vakhania
Journal of Scheduling 16 (4), 395-403, 2013
132013
Simple constructive, insertion, and improvement heuristics based on the girding polygon for the Euclidean traveling salesman problem
V Pacheco-Valencia, JA Hernández, JM Sigarreta, N Vakhania
Algorithms 13 (1), 5, 2019
112019
Dynamic restructuring framework for Scheduling with release times and due-dates
N Vakhania
Mathematics 7 (11), 1104, 2019
112019
Scheduling a single machine with primary and secondary objectives
N Vakhania
Algorithms 11 (6), 80, 2018
82018
The system can't perform the operation now. Try again later.
Articles 1–20