Hans Kellerer

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 18

Top Topics

Maximum Lateness

Approximation Schemes

Top Venues

Theor. Comput. Sci.

Ann. Oper. Res.

J. Comb. Optim.

Eur. J. Oper. Res.

Publications

Stanislaw Gawiejnowicz, Nir Halman, Hans Kellerer
Knapsack problems with position-dependent item weights or profits. Ann. Oper. Res. 326 (1) (2023)
Hans Kellerer, Vitaly A. Strusevich
The two-flight low risk helicopter transportation problem under the split pickup scenario. EURO J. Transp. Logist. 12 (2023)
Imed Kacem, Hans Kellerer, Ali Ridha Mahjoub
Preface: New trends on combinatorial optimization for network and logistical applications. Ann. Oper. Res. 298 (1) (2021)
György Dósa, Hans Kellerer, Tomas Olaj, Zsolt Tuza
An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time. Theor. Comput. Sci. 880 (2021)
Martin Gutjahr, Hans Kellerer, Sophie N. Parragh
Heuristic approaches for scheduling jobs and vehicles in a cyclic flexible manufacturing system. ISM (2020)
Imed Kacem, Hans Kellerer
Complexity results for common due date scheduling problems with interval data and minmax regret criterion. Discret. Appl. Math. 264 (2019)
György Dósa, Hans Kellerer, Zsolt Tuza
Restricted assignment scheduling with resource constraints. Theor. Comput. Sci. 760 (2019)
György Dósa, Hans Kellerer, Zsolt Tuza
Using weight decision for decreasing the price of anarchy in selfish bin packing games. Eur. J. Oper. Res. 278 (1) (2019)
Nir Halman, Hans Kellerer, Vitaly A. Strusevich
Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints. Eur. J. Oper. Res. 270 (2) (2018)
Imed Kacem, Hans Kellerer
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints. Algorithmica 80 (12) (2018)
György Dósa, Hans Kellerer, Zsolt Tuza
Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy. WAOA (2018)
Imed Kacem, Hans Kellerer
Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. ICCL (2018)
Imed Kacem, Hans Kellerer
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times under Non-Availability or Deadline Constraints. CoRR (2017)
Hans Kellerer, Rebecca Sarto Basso, Vitaly A. Strusevich
Approximability issues for unconstrained and constrained maximization of half-product related functions. Theor. Comput. Sci. 659 (2017)
Imed Kacem, Hans Kellerer, Pierre Laroche
Foreword - Advanced Optimization Approaches and Modern OR-Applications. RAIRO Oper. Res. 50 (4-5) (2016)
Hans Kellerer, Vitaly A. Strusevich
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications. Ann. Oper. Res. 240 (1) (2016)
Imed Kacem, Hans Kellerer, Maryam Seifaddini
Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval. J. Comb. Optim. 32 (3) (2016)
Imed Kacem, Hans Kellerer
Semi-online scheduling on a single machine with unexpected breakdown. Theor. Comput. Sci. 646 (2016)
Hans Kellerer, Vladimir Kotov, Michaël Gabay
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time. J. Sched. 18 (6) (2015)
János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Zsolt Tuza
Online Results for Black and White Bin Packing. Theory Comput. Syst. 56 (1) (2015)
János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza
Offline black and white bin packing. Theor. Comput. Sci. 596 (2015)
Imed Kacem, Hans Kellerer, Yann Lanuel
Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals. J. Comb. Optim. 30 (3) (2015)
Imed Kacem, Hans Kellerer
Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. Discret. Appl. Math. 164 (2014)
Imed Kacem, Hans Kellerer, Maryam Seifaddini
Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. ISCO (2014)
Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich
Preemptive scheduling on two identical parallel machines with a single transporter. J. Comb. Optim. 25 (2) (2013)
Hans Kellerer, Vladimir Kotov
An efficient algorithm for bin stretching. Oper. Res. Lett. 41 (4) (2013)
Hans Kellerer, Vitaly A. Strusevich
Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product. Eur. J. Oper. Res. 228 (1) (2013)
Hans Kellerer, Kabir Rustogi, Vitaly A. Strusevich
Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance. J. Sched. 16 (6) (2013)
Hans Kellerer, Vitaly A. Strusevich
The symmetric quadratic knapsack problem: approximation and scheduling applications. 4OR 10 (2) (2012)
T. C. E. Cheng, Hans Kellerer, Vladimir Kotov
Algorithms better than LPT for semi-online scheduling with decreasing processing times. Oper. Res. Lett. 40 (5) (2012)
Alessandro Agnetis, Hans Kellerer, Gaia Nicosia, Andrea Pacifici
Parallel dedicated machines scheduling with chain precedence constraints. Eur. J. Oper. Res. 221 (2) (2012)
János Balogh, József Békési, György Dósa, Hans Kellerer, Zsolt Tuza
Black and White Bin Packing. WAOA (2012)
Alessandro Agnetis, Hans Kellerer, Gaia Nicosia, Andrea Pacifici
Scheduling Two Chains on Parallel Dedicated Machines. CTW (2012)
Imed Kacem, Hans Kellerer
Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. J. Sched. 14 (3) (2011)
Imed Kacem, Hans Kellerer
Foreword: Combinatorial optimization for industrial engineering. Comput. Ind. Eng. 61 (2) (2011)
Hans Kellerer, Vladimir Kotov
A 3/2-approximation algorithm for 3/2-partitioning. Oper. Res. Lett. 39 (5) (2011)
Konstantin Chakhlevitch, Celia A. Glass, Hans Kellerer
Batch machine production with perishability time windows and limited batch size. Eur. J. Oper. Res. 210 (1) (2011)
Hans Kellerer, Vitaly A. Strusevich
Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications. Algorithmica 57 (4) (2010)
Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich
Transporting Jobs through a Processing Center with Two Parallel Machines. COCOA (1) (2010)
Hans Kellerer, Vitaly A. Strusevich
Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack. Int. J. Found. Comput. Sci. 21 (3) (2010)
Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich
Operator non-availability periods. 4OR 7 (3) (2009)
Hans Kellerer, Mikhail A. Kubzin, Vitaly A. Strusevich
Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval. Eur. J. Oper. Res. 199 (1) (2009)
Hans Kellerer
An approximation algorithm for identical parallel machine scheduling with resource dependent processing times. Oper. Res. Lett. 36 (2) (2008)
Hans Kellerer, Vitaly A. Strusevich
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theor. Comput. Sci. 369 (1-3) (2006)
T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov
Semi-on-line multiprocessor scheduling with given total processing time. Theor. Comput. Sci. 337 (1-3) (2005)
Hans Kellerer, Ulrich Pferschy
Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. J. Comb. Optim. 8 (1) (2004)
Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
Algorithms for on-line bin-packing problems with cardinality constraints. Discret. Appl. Math. 143 (1-3) (2004)
Hans Kellerer, Vitaly A. Strusevich
Scheduling parallel dedicated machines under a single non-shared resource. Eur. J. Oper. Res. 147 (2) (2003)
Dietmar Maringer, Hans Kellerer
Optimization of cardinality constrained portfolios with a hybrid local search algorithm. OR Spectr. 25 (4) (2003)
T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov
Lower Bounds and Semi On-line Multiprocessor Scheduling. Comput. Sci. J. Moldova 11 (2) (2003)
Hans Kellerer, Vladimir Kotov
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing. Oper. Res. Lett. 31 (1) (2003)
Hans Kellerer, Vitaly A. Strusevich
Scheduling problems for parallel dedicated machines under multiple resource constraints. Discret. Appl. Math. 133 (1-3) (2003)
Hans Kellerer, Renata Mansini, Ulrich Pferschy, Maria Grazia Speranza
An efficient fully polynomial approximation scheme for the Subset-Sum Problem. J. Comput. Syst. Sci. 66 (2) (2003)
Alberto Caprara, Hans Kellerer, Ulrich Pferschy
A 3/4-Approximation Algorithm for Multiple Subset Sum. J. Heuristics 9 (2) (2003)
Luitpold Babel, Hans Kellerer
Design of tariff zones in public transportation networks: theoretical results and heuristics. Math. Methods Oper. Res. 58 (3) (2003)
Thomas Erlebach, Hans Kellerer, Ulrich Pferschy
Approximating Multiobjective Knapsack Problems. Manag. Sci. 48 (12) (2002)
Peter Greistorfer, Hans Kellerer
Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem. J. Heuristics 7 (4) (2001)
Alberto Caprara, Hans Kellerer, Ulrich Pferschy
Approximation Schemes for Ordered Vector Packing Problems. RANDOM-APPROX (2001)
Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
On-Line Algorithms for Cardinality Constrained Bin Packing Problems. ISAAC (2001)
Thomas Erlebach, Hans Kellerer, Ulrich Pferschy
Approximating Multi-objective Knapsack Problems. WADS (2001)
Hans Kellerer, Renata Mansini, Maria Grazia Speranza
Two linear approximation algorithms for the subset-sum problem. Eur. J. Oper. Res. 120 (2) (2000)
Hans Kellerer, Renata Mansini, Maria Grazia Speranza
Selecting Portfolios with Fixed Costs and Minimum Transaction Lots. Ann. Oper. Res. 99 (1-4) (2000)
Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger
Approximation algorithms for knapsack problems with cardinality constraints. Eur. J. Oper. Res. 123 (2) (2000)
Alberto Caprara, Hans Kellerer, Ulrich Pferschy
The Multiple Subset Sum Problem. SIAM J. Optim. 11 (2) (2000)
Alberto Caprara, Hans Kellerer, Ulrich Pferschy
A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. Inf. Process. Lett. 73 (3-4) (2000)
József Békési, Gábor Galambos, Hans Kellerer
A 5/4 Linear Time Bin Packing Algorithm. J. Comput. Syst. Sci. 60 (1) (2000)
Hans Kellerer
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. RANDOM-APPROX (1999)
Hans Kellerer, Ulrich Pferschy
Cardinality constrained bin‐packing problems. Ann. Oper. Res. 92 (1999)
Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. SIAM J. Comput. 28 (4) (1999)
Hans Kellerer, Ulrich Pferschy
A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem. J. Comb. Optim. 3 (1) (1999)
Hans Kellerer, Vladimir Kotov, Franz Rendl, Gerhard J. Woeginger
The Stock Size Problem. Oper. Res. 46 (3-Supplement-3) (1998)
Luitpold Babel, Hans Kellerer, Vladimir Kotov
-partitioning problem. Math. Methods Oper. Res. 47 (1) (1998)
Hans Kellerer, Ulrich Pferschy
A New Fully Polynomial Approximation Scheme for the Knapsack Problem. APPROX (1998)
Rainer E. Burkard, Y. He, Hans Kellerer
A Linear Compound Algorithm for Uniform Machine Scheduling. Computing 61 (1) (1998)
Paolo Dell'Olmo, Hans Kellerer, Maria Grazia Speranza, Zsolt Tuza
A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins. Inf. Process. Lett. 65 (5) (1998)
Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza
Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21 (5) (1997)
Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza
An Efficient Approximation Scheme for the Subset-Sum Problem. ISAAC (1997)
Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. STOC (1996)
Hans Kellerer, Gerhard J. Woeginger
On the Euclidean two Paths Problem. Discret. Appl. Math. 47 (2) (1993)
Hans Kellerer, Gerhard J. Woeginger
A Tight Bound for 3-Partitioning. Discret. Appl. Math. 45 (3) (1993)
Hans Kellerer, Gerhard J. Woeginger
A Greedy-heuristic for 3-partitioning with similar elements. Computing 50 (3) (1993)
Hans Kellerer, Franz Rendl, Gerhard J. Woeginger
Computing the optimum stock size. IPCO (1993)
Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger
A Lower Bound for On-Line Vector-Packing Algorithms. Acta Cybern. 11 (1-2) (1993)
Hans Kellerer, Gerhard J. Woeginger
UET-scheduling with constrained processor allocations. Comput. Oper. Res. 19 (1) (1992)
János Csirik, Hans Kellerer, Gerhard J. Woeginger
The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Lett. 11 (5) (1992)
Hans Kellerer
Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-Algorithm. Computing 46 (3) (1991)
Hans Kellerer, Günther Wirsching
Prime covers and periodic patterns. Discret. Math. 85 (2) (1990)
Werner Heise, Hans Kellerer
Eine Verschärfung der Quadratwurzel-Schranke für Quadratische-Rest-Codes einer Länge n = -1 mod 4. J. Inf. Process. Cybern. 23 (2/3) (1987)