Nodari Vakhania - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2024

Exact and heuristic algorithms for the domination problemErnesto Parra Inza, Nodari Vakhania, José María Sigarreta Almira, Frank Angel Hernández Mira. eor, 313(3):926-936, March 2024. [doi]

2023

On the complexity of scheduling unrelated parallel machines with limited preemptionsJan Karel Lenstra, Nodari Vakhania. orl, 51(2):187-189, March 2023. [doi]

2022

A polynomial-time approximation to a minimum dominating set in a graphFrank Angel Hernández Mira, Ernesto Parra Inza, José M. Sigarreta Almira, Nodari Vakhania. TCS, 930:142-156, 2022. [doi]

A Multi-Phase Method for Euclidean Traveling Salesman ProblemsVíctor Hugo Pacheco-Valencia, Nodari Vakhania, Frank Angel Hernández Mira, José Alberto Hernández Aguilar. axioms, 11(9):439, 2022. [doi]

2021

Theoretical and practical issues in single-machine scheduling with two job release and delivery timesAlejandro Reynoso, Nodari Vakhania. scheduling, 24(6):615-647, 2021. [doi]

2020

Simple Constructive, Insertion, and Improvement Heuristics Based on the Girding Polygon for the Euclidean Traveling Salesman ProblemVíctor Pacheco-Valencia, José Alberto Hernández, José María Sigarreta, Nodari Vakhania. algorithms, 13(1):5, 2020. [doi]

2019

Fast solution of single-machine scheduling problem with embedded jobsNodari Vakhania. TCS, 782:91-106, 2019. [doi]

2018

Scheduling a Single Machine with Primary and Secondary ObjectivesNodari Vakhania. algorithms, 11(6):80, 2018. [doi]

2013

A study of single-machine scheduling problem to maximize throughputNodari Vakhania. scheduling, 16(4):395-403, 2013. [doi]

Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial timeNodari Vakhania, Frank Werner. TCS, 501:72-81, 2013. [doi]

2012

Branch less, cut more and minimize the number of late equal-length jobs on identical machinesNodari Vakhania. TCS, 465:49-60, 2012. [doi]

2011

A note on the proof of the complexity of the little-preemptive open-shop problemEvgeny V. Shchepin, Nodari Vakhania. anor, 191(1):251-253, 2011. [doi]

2009

Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobsNodari Vakhania. orl, 37(6):405-410, 2009. [doi]

2008

On the geometry, preemptions and complexity of multiprocessor and shop schedulingEvgeny V. Shchepin, Nodari Vakhania. anor, 159(1):183-213, 2008. [doi]

2007

Global Estimations for Multiprocessor Job-ShopNodari Vakhania. cisched 2007: 65-71 [doi]

2005

An optimal rounding gives a better approximation for scheduling unrelated machinesEvgeny V. Shchepin, Nodari Vakhania. orl, 33(2):127-133, 2005. [doi]

2004

Preemptive scheduling of equal-length jobs to maximize weighted throughputPhilippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania. orl, 32(3):258-264, 2004. [doi]

Single-Machine Scheduling with Release Times and TailsNodari Vakhania. anor, 129(1-4):253-271, 2004. [doi]

2003

Preemptive scheduling in overloaded systemsMarek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania. jcss, 67(1):183-197, 2003. [doi]

A better algorithm for sequencing with release and delivery times on identical machinesNodari Vakhania. jal, 48(2):273-293, 2003. [doi]

2002

Preemptive Scheduling in Overloaded SystemsMarek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania. icalp 2002: 800-811 [doi]

Little-Preemptive Scheduling on Unrelated ProcessorsEvgeny V. Shchepin, Nodari Vakhania. jmma, 1(1):43-56, 2002.

Scheduling Equal-Length Jobs with Delivery times on Identical ProcessorsNodari Vakhania. ijcm, 79(6):715-728, 2002. [doi]

2001

Tight Performance Bounds of CP-Scheduling on Out-TreesNodari Vakhania. jco, 5(4):445-464, 2001.

2000

Task Distributions on Multiprocessor SystemsEvgeny V. Shchepin, Nodari Vakhania. ifipTCS 2000: 112-125 [doi]

Global and Local Search for Scheduling Job Shop with Parallel MachinesNodari Vakhania. sbia 2000: 63-75 [doi]

Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single MachineMarjan van den Akker, Han Hoogeveen, Nodari Vakhania. esa 2000: 427-436

1997

Sequencing jobs with readiness times and tails on parallel machinesNodari Vakhania. SAC 1997: 438-446 [doi]

Sign in or sign up to see more results.

runs on WebDSL