Narrow search
Showing 1 - 8 of 8
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/10003905572
Cover Image
Preemptive scheduling of equal-length jobs to maximize weighted throughput
Baptiste, Philippe; Chrobak, Marek; Dürr, Christoph; … - In: Operations research letters 32 (2004) 3, pp. 258-264
Persistent link: https://www.econbiz.de/10006818993
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
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
On the complexity of scheduling unrelated parallel machines with limited preemptions
Lenstra, Jan K.; Vakhania, Nodari - In: Operations research letters 51 (2023) 2, pp. 187-189
Persistent link: https://www.econbiz.de/10014311852
Cover Image
Scheduling unit time open shops to minimize the weighted number of late jobs
Brucker, P.; Jurisch, B.; Tautenhahn, T.; Werner, F. - In: Operations research letters 14 (1993) 5, pp. 245-250
Persistent link: https://www.econbiz.de/10006870310
Cover Image
A polynomial approximation scheme for problem F2-rj-Cmax
Kovalyov, M.Y.; Werner, F. - In: Operations research letters 20 (1996) 2, pp. 75-80
Persistent link: https://www.econbiz.de/10006856499