Hans Kellerer

According to our database1, Hans Kellerer authored at least 86 papers between 1987 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Preface: New trends on combinatorial optimization for network and logistical applications.
Ann. Oper. Res., 2021

Restricted assignment scheduling with resource constraints.
Theor. Comput. Sci., 2019

Using weight decision for decreasing the price of anarchy in selfish bin packing games.
Eur. J. Oper. Res., 2019

Complexity results for common due date scheduling problems with interval data and minmax regret criterion.
Discret. Appl. Math., 2019

Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints.
Eur. J. Oper. Res., 2018

Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints.
Algorithmica, 2018

Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval.
Proceedings of the Computational Logistics - 9th International Conference, 2018

Approximability issues for unconstrained and constrained maximization of half-product related functions.
Theor. Comput. Sci., 2017

Encyclopedia of Algorithms, 2016

Semi-online scheduling on a single machine with unexpected breakdown.
Theor. Comput. Sci., 2016

Foreword - Advanced Optimization Approaches and Modern OR-Applications.
RAIRO Oper. Res., 2016

Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval.
J. Comb. Optim., 2016

Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications.
Ann. Oper. Res., 2016

Offline black and white bin packing.
Theor. Comput. Sci., 2015

An efficient algorithm for semi-online multiprocessor scheduling with given total processing time.
J. Sched., 2015

Online Results for Black and White Bin Packing.
Theory Comput. Syst., 2015

Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals.
J. Comb. Optim., 2015

Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times.
Discret. Appl. Math., 2014

Between laboratory and simulator: a cognitive approach to evaluating cockpit interfaces by manipulating informatory context.
Cogn. Technol. Work., 2014

Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance.
J. Sched., 2013

An efficient algorithm for bin stretching.
Oper. Res. Lett., 2013

Preemptive scheduling on two identical parallel machines with a single transporter.
J. Comb. Optim., 2013

Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product.
Eur. J. Oper. Res., 2013

Algorithms better than LPT for semi-online scheduling with decreasing processing times.
Oper. Res. Lett., 2012

Parallel dedicated machines scheduling with chain precedence constraints.
Eur. J. Oper. Res., 2012

The symmetric quadratic knapsack problem: approximation and scheduling applications.
4OR, 2012

Black and White Bin Packing.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Scheduling Two Chains on Parallel Dedicated Machines.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

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., 2011

A 3/2-approximation algorithm for 3/2-partitioning.
Oper. Res. Lett., 2011

Batch machine production with perishability time windows and limited batch size.
Eur. J. Oper. Res., 2011

Foreword: Combinatorial optimization for industrial engineering.
Comput. Ind. Eng., 2011

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., 2010

Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications.
Algorithmica, 2010

Transporting Jobs through a Processing Center with Two Parallel Machines.
Proceedings of the Combinatorial Optimization and Applications, 2010

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., 2009

Operator non-availability periods.
4OR, 2009

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

An approximation algorithm for identical parallel machine scheduling with resource dependent processing times.
Oper. Res. Lett., 2008

A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date.
Theor. Comput. Sci., 2006

Semi-on-line multiprocessor scheduling with given total processing time.
Theor. Comput. Sci., 2005

Minimizing the Maximum Lateness.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem.
J. Comb. Optim., 2004

Algorithms for on-line bin-packing problems with cardinality constraints.
Discret. Appl. Math., 2004

Knapsack problems.
Springer, ISBN: 978-3-540-40286-2, 2004

Optimization of cardinality constrained portfolios with a hybrid local search algorithm.
OR Spectr., 2003

An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing.
Oper. Res. Lett., 2003

Design of tariff zones in public transportation networks: theoretical results and heuristics.
Math. Methods Oper. Res., 2003

An efficient fully polynomial approximation scheme for the Subset-Sum Problem.
J. Comput. Syst. Sci., 2003

A 3/4-Approximation Algorithm for Multiple Subset Sum.
J. Heuristics, 2003

Scheduling parallel dedicated machines under a single non-shared resource.
Eur. J. Oper. Res., 2003

Scheduling problems for parallel dedicated machines under multiple resource constraints.
Discret. Appl. Math., 2003

Lower Bounds and Semi On-line Multiprocessor Scheduling.
Comput. Sci. J. Moldova, 2003

Approximating Multiobjective Knapsack Problems.
Manag. Sci., 2002

Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem.
J. Heuristics, 2001

Approximating Multi-objective Knapsack Problems.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Approximation Schemes for Ordered Vector Packing Problems.
Proceedings of the Approximation, 2001

On-Line Algorithms for Cardinality Constrained Bin Packing Problems.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

The Multiple Subset Sum Problem.
SIAM J. Optim., 2000

A 5/4 Linear Time Bin Packing Algorithm.
J. Comput. Syst. Sci., 2000

A PTAS for the Multiple Subset Sum Problem with different knapsack capacities.
Inf. Process. Lett., 2000

Two linear approximation algorithms for the subset-sum problem.
Eur. J. Oper. Res., 2000

Approximation algorithms for knapsack problems with cardinality constraints.
Eur. J. Oper. Res., 2000

Selecting Portfolios with Fixed Costs and Minimum Transaction Lots.
Ann. Oper. Res., 2000

Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine.
SIAM J. Comput., 1999

A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem.
J. Comb. Optim., 1999

Cardinality constrained bin‐packing problems.
Ann. Oper. Res., 1999

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem.
Proceedings of the Randomization, 1999

The<i>k</i>-partitioning problem.
Math. Methods Oper. Res., 1998

A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins.
Inf. Process. Lett., 1998

The Stock Size Problem.
Oper. Res., 1998

A Linear Compound Algorithm for Uniform Machine Scheduling.
Computing, 1998

A New Fully Polynomial Approximation Scheme for the Knapsack Problem.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

Semi on-line algorithms for the partition problem.
Oper. Res. Lett., 1997

An Efficient Approximation Scheme for the Subset-Sum Problem.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

A Tight Bound for 3-Partitioning.
Discret. Appl. Math., 1993

On the Euclidean two Paths Problem.
Discret. Appl. Math., 1993

A Greedy-heuristic for 3-partitioning with similar elements.
Computing, 1993

A Lower Bound for On-Line Vector-Packing Algorithms.
Acta Cybern., 1993

Computing the optimum stock size.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

The exact LPT-bound for maximizing the minimum completion time.
Oper. Res. Lett., 1992

UET-scheduling with constrained processor allocations.
Comput. Oper. Res., 1992

Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-Algorithm.
Computing, 1991

Prime covers and periodic patterns.
Discret. Math., 1990

Eine Verschärfung der Quadratwurzel-Schranke für Quadratische-Rest-Codes einer Länge n = -1 mod 4.
J. Inf. Process. Cybern., 1987