Nodari Vakhania

Available identifiers

zbMath Open vakhania.nodari-nMaRDI QIDQ221901

List of research outcomes

Publication	Date of Publication	Type
On the complexity of scheduling unrelated parallel machines with limited preemptions	2023-06-28	Paper
A polynomial-time approximation to a minimum dominating set in a graph	2022-08-25	Paper
Theoretical and practical issues in single-machine scheduling with two job release and delivery times	2022-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q5004802	2021-08-03	Paper
Scheduling a single machine with primary and secondary objectives	2019-10-30	Paper
Fast solution of single-machine scheduling problem with embedded jobs	2019-06-06	Paper
Theoretical expectation versus practical performance of Jackson's heuristic	2018-08-27	Paper
Probabilistic quality estimations for combinatorial optimization problems	2018-04-10	Paper
A study of single-machine scheduling problem to maximize throughput	2014-08-18	Paper
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time	2014-01-10	Paper
Branch less, cut more and minimize the number of late equal-length jobs on identical machines	2013-01-07	Paper
A note on the proof of the complexity of the little-preemptive open-shop problem	2012-03-09	Paper
Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs	2009-12-07	Paper
https://portal.mardi4nfdi.de/entity/Q3632076	2009-06-23	Paper
On the geometry, preemptions and complexity of multiprocessor and shop scheduling	2008-09-03	Paper
An absolute approximation algorithm for scheduling unrelated machines	2007-02-20	Paper
An optimal rounding gives a better approximation for scheduling unrelated machines	2005-08-25	Paper
https://portal.mardi4nfdi.de/entity/Q4737209	2004-08-11	Paper
Single-machine scheduling with release times and tails	2004-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q4471842	2004-07-30	Paper
Preemptive scheduling of equal-length jobs to maximize weighted throughput.	2004-03-15	Paper
A better algorithm for sequencing with release and delivery times on identical machines	2004-03-14	Paper
Preemptive scheduling in overloaded systems.	2003-08-19	Paper
Little-preemptive scheduling on unrelated processors	2003-04-27	Paper
https://portal.mardi4nfdi.de/entity/Q4536419	2002-11-25	Paper
Scheduling Equal-Length Jobs with Delivery times on Identical Processors	2002-08-28	Paper
Tight performance bounds of CP-scheduling on out-trees	2002-08-14	Paper
Concurrent operations can be parallelized in scheduling multiprocessor job shop	2002-08-08	Paper
https://portal.mardi4nfdi.de/entity/Q2753958	2001-11-11	Paper
Restarts can help in the on-line minimization of the maximum delivery time on a single machine	2001-08-20	Paper
https://portal.mardi4nfdi.de/entity/Q2718206	2001-06-19	Paper
https://portal.mardi4nfdi.de/entity/Q4339498	1997-06-09	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Nodari Vakhania