The following pages link to Nodari Vakhania (Q221901):
Displayed 32 items.
- Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time (Q391321) (← links)
- A study of single-machine scheduling problem to maximize throughput (Q398860) (← links)
- Single-machine scheduling with release times and tails (Q596466) (← links)
- A note on the proof of the complexity of the little-preemptive open-shop problem (Q763116) (← links)
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887) (← links)
- Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs (Q1043248) (← links)
- Preemptive scheduling in overloaded systems. (Q1401985) (← links)
- Preemptive scheduling of equal-length jobs to maximize weighted throughput. (Q1426730) (← links)
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine (Q1592755) (← links)
- Concurrent operations can be parallelized in scheduling multiprocessor job shop (Q1607976) (← links)
- Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
- Little-preemptive scheduling on unrelated processors (Q1868263) (← links)
- Branch less, cut more and minimize the number of late equal-length jobs on identical machines (Q1929241) (← links)
- Theoretical and practical issues in single-machine scheduling with two job release and delivery times (Q2066683) (← links)
- A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
- Scheduling a single machine with primary and secondary objectives (Q2331605) (← links)
- Probabilistic quality estimations for combinatorial optimization problems (Q2413265) (← links)
- Fast solution of single-machine scheduling problem with embedded jobs (Q2420645) (← links)
- An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212) (← links)
- (Q2718206) (← links)
- (Q2753958) (← links)
- An absolute approximation algorithm for scheduling unrelated machines (Q3423277) (← links)
- (Q3632076) (← links)
- (Q4339498) (← links)
- A better algorithm for sequencing with release and delivery times on identical machines (Q4458881) (← links)
- (Q4471842) (← links)
- (Q4536419) (← links)
- Scheduling Equal-Length Jobs with Delivery times on Identical Processors (Q4551464) (← links)
- (Q4737209) (← links)
- (Q5004802) (← links)
- Tight performance bounds of CP-scheduling on out-trees (Q5952053) (← links)
- On the complexity of scheduling unrelated parallel machines with limited preemptions (Q6161912) (← links)