Narrow search
Showing 1 - 4 of 4
Cover Image
Algorithms better than LPT for semi-online scheduling with decreasing processing times
Cheng, T. C. E.; Kellerer, Hans; Kotov, Vladimir N. - In: Operations research letters 40 (2012) 5, pp. 349-352
Persistent link: https://www.econbiz.de/10009613811
Cover Image
Preemptive scheduling on two identical parallel machines with a single transporter
Kellerer, Hans; Soper, Alan J.; Strusevich, Vitaly A. - In: Journal of combinatorial optimization 25 (2013) 2, pp. 279-307
Persistent link: https://www.econbiz.de/10009728579
Cover Image
Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
Kellerer, Hans; Kubzin, Mikhail A.; Strusevich, Vitaly A. - In: European journal of operational research : EJOR 199 (2009) 1, pp. 111-116
Persistent link: https://www.econbiz.de/10003863408
Cover Image
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
Kellerer, Hans; Kotov, Vladimir N.; Gabay, Michaël - In: Journal of scheduling 18 (2015) 6, pp. 623-630
Persistent link: https://www.econbiz.de/10011391844