Hans Kellerer

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