Narrow search
Showing 21 - 30 of 71
Cover Image
Scheduling unrelated machines with two types of jobs
Vakhania, Nodari; Hernandez, Jose Alberto; Werner, Frank - In: International journal of production research 52 (2014) 13, pp. 3793-3801
Persistent link: https://www.econbiz.de/10010382878
Cover Image
Theoretical and practical issues in single-machine scheduling with two job release and delivery times
Reynoso, Alejandro; Vakhania, Nodari - In: Journal of scheduling : JOS 24 (2021) 6, pp. 615-647
Persistent link: https://www.econbiz.de/10012792421
Cover Image
An absolute approximation algorithm for scheduling unrelated machines
Shchepin, Evgeny; Vakhania, Nodari - In: Naval research logistics : an international journal 53 (2006) 6, pp. 502-507
Persistent link: https://www.econbiz.de/10007288840
Cover Image
An optimal rounding gives a better approximation for scheduling unrelated machines
Shchepin, Evgeny V.; Vakhania, Nodari - In: Operations research letters 33 (2005) 2, pp. 127-133
Persistent link: https://www.econbiz.de/10006810095
Cover Image
Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
Vakhania, Nodari - In: Operations research letters 37 (2009) 6, pp. 405-410
Persistent link: https://www.econbiz.de/10008323311
Cover Image
Single-Machine Scheduling with Release Times and Tails
Vakhania, Nodari - 2004
Persistent link: https://www.econbiz.de/10008214681
Cover Image
On the geometry, preemptions and complexity of multiprocessor and shop scheduling
Shchepin, Evgeny V.; Vakhania, Nodari - 2008
Persistent link: https://www.econbiz.de/10008221329
Cover Image
A study of single-machine scheduling problem to maximize throughput
Vakhania, Nodari - In: Journal of scheduling 16 (2013) 4, pp. 395-403
Persistent link: https://www.econbiz.de/10010140351
Cover Image
Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
Vakhania, Nodari - In: Operations research letters 37 (2009) 6, pp. 405-411
Persistent link: https://www.econbiz.de/10008894843
Cover Image
A note on the proof of the complexity of the little-preemptive open-shop problem
Shchepin, Evgeny V.; Vakhania, Nodari - 2011
Persistent link: https://www.econbiz.de/10009803197