Vakhania Nodari

Nodari Vakhania

Information about the author Nodari Vakhania will soon be added to the site.
Found 8 papers in total
A study of single‐machine scheduling problem to maximize throughput
A study of single‐machine scheduling problem to maximize throughput
2013
We study inherent structural properties of a strongly NP‐hard problem of...
On the geometry, preemptions and complexity of multiprocessor and shop scheduling
On the geometry, preemptions and complexity of multiprocessor and shop scheduling
2008
In this paper we study multiprocessor and open shop scheduling problems from several...
An absolute approximation algorithm for scheduling unrelated machines
An absolute approximation algorithm for scheduling unrelated machines
2006
Non-preemptive scheduling of n independent jobs on m unrelated machines so as to...
An optimal rounding gives a better approximation for scheduling unrelated machines
An optimal rounding gives a better approximation for scheduling unrelated machines
2005
A polynomial-time algorithm is suggested for non-preemptive scheduling of n...
Single-machine scheduling with release times and tails
Single-machine scheduling with release times and tails
2004
We study the problem of scheduling jobs with release times and tails on a single...
Preemptive scheduling of equal-length jobs to maximize weighted throughput
Preemptive scheduling of equal-length jobs to maximize weighted throughput
2004
We study the problem of computing a preemptive schedule of equal-length jobs with...
Concurrent operations can be parallelized in scheduling multiprocessor job shop
Concurrent operations can be parallelized in scheduling multiprocessor job shop
2002
We consider the multiprocessor job shop scheduling problem (JSP) with unrelated...
Restarts can help in the on-line minimization of the maximum delivery time on a single machine
Restarts can help in the on-line minimization of the maximum delivery time on a single machine
2000
We consider a single-machine on-line scheduling problem where jobs arrive over time. A...
Papers per page: