Narrow search
Showing 1 - 10 of 193
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.; Strusevič, Vitalij … - In: European journal of operational research : EJOR 199 (2009) 1, pp. 111-116
Persistent link: https://www.econbiz.de/10003863408
Cover Image
Preemptive scheduling on two identical parallel machines with a single transporter
Kellerer, Hans; Soper, Alan J.; Strusevič, Vitalij … - In: Journal of combinatorial optimization 25 (2013) 2, pp. 279-307
Persistent link: https://www.econbiz.de/10009728579
Cover Image
Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product
Kellerer, Hans; Strusevič, Vitalij Aleksandrovič - In: European journal of operational research : EJOR 228 (2013) 1, pp. 24-32
Persistent link: https://www.econbiz.de/10009734172
Cover Image
Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
Kellerer, Hans; Rustogi, Kabir; Strusevič, Vitalij … - In: Journal of scheduling 16 (2013) 6, pp. 675-683
Persistent link: https://www.econbiz.de/10010228901
Cover Image
The symmetric quadratic knapsack problem : approximation and scheduling applications
Kellerer, Hans; Strusevič, Vitalij Aleksandrovič - In: 4OR : a quarterly journal of operations research 10 (2012) 2, pp. 111-161
Persistent link: https://www.econbiz.de/10010218798
Cover Image
A fast FPTAS for single machine scheduling problem of minimizing total weighted earliness and tardiness about a large common due date
Kellerer, Hans; Rustogi, Kabir; Strusevič, Vitalij … - In: Omega : the international journal of management science 90 (2020), pp. 1-5
Persistent link: https://www.econbiz.de/10012120790
Cover Image
Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints
Halman, Nir; Kellerer, Hans; Strusevič, Vitalij … - In: European journal of operational research : EJOR 270 (2018) 2, pp. 435-447
Persistent link: https://www.econbiz.de/10011869039
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/10008248368
Cover Image
Scheduling parallel dedicated machines with the speeding-up resource
Kellerer, Hans; Strusevich, Vitaly A. - In: Naval research logistics : an international journal 55 (2008) 5, pp. 377-389
Persistent link: https://www.econbiz.de/10008080864
Cover Image
The two-flight low risk helicopter transportation problem under the split pickup scenario
Kellerer, Hans; Strusevič, Vitalij Aleksandrovič - In: EURO journal on transportation and logistics 12 (2023), pp. 1-17
The paper considers a special class of routing problems with the objective of minimizing the passengers risk. A major area of application of the low risk models is helicopter transportation widely used in the petroleum industry. In general, the total risk is considered to be proportional to the...
Persistent link: https://www.econbiz.de/10014518062