The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nodari Vakhania: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marjan van den Akker, Han Hoogeveen, Nodari Vakhania
    Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:427-436 [Conf]
  2. Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
    Preemptive Scheduling in Overloaded Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:800-811 [Conf]
  3. Evgeny V. Shchepin, Nodari Vakhania
    Task Distributions on Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:112-125 [Conf]
  4. Nodari Vakhania
    Sequencing jobs with readiness times and tails on parallel machines. [Citation Graph (0, 0)][DBLP]
    SAC, 1997, pp:438-446 [Conf]
  5. Nodari Vakhania
    Global and Local Search for Scheduling Job Shop with Parallel Machines. [Citation Graph (0, 0)][DBLP]
    IBERAMIA-SBIA, 2000, pp:63-75 [Conf]
  6. Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania
    Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  7. Nodari Vakhania
    Scheduling Equal-Length Jobs with Delivery times on Identical Processors. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2002, v:79, n:6, pp:715-728 [Journal]
  8. Nodari Vakhania
    A better algorithm for sequencing with release and delivery times on identical machines. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:2, pp:273-293 [Journal]
  9. Nodari Vakhania
    Tight Performance Bounds of CP-Scheduling on Out-Trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:4, pp:445-464 [Journal]
  10. Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
    Preemptive scheduling in overloaded systems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:1, pp:183-197 [Journal]
  11. Evgeny V. Shchepin, Nodari Vakhania
    Little-Preemptive Scheduling on Unrelated Processors. [Citation Graph (0, 0)][DBLP]
    J. Math. Model. Algorithms, 2002, v:1, n:1, pp:43-56 [Journal]
  12. Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania
    Preemptive scheduling of equal-length jobs to maximize weighted throughput. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:3, pp:258-264 [Journal]
  13. Evgeny V. Shchepin, Nodari Vakhania
    An optimal rounding gives a better approximation for scheduling unrelated machines. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:127-133 [Journal]

Search in 0.025secs, Finished in 0.026secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002