According to our database1, Hans Kellerer authored at least 86 papers between 1987 and 2021.
Legend:Book In proceedings Article PhD thesis Other
Preface: New trends on combinatorial optimization for network and logistical applications.
Ann. Oper. Res., 2021
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.
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
Theor. Comput. Sci., 2016
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
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time.
J. Sched., 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
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
Eur. J. Oper. Res., 2012
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
Eur. J. Oper. Res., 2011
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.
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
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
Theor. Comput. Sci., 2005
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004
J. Comb. Optim., 2004
Discret. Appl. Math., 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
J. Comput. Syst. Sci., 2003
Eur. J. Oper. Res., 2003
Scheduling problems for parallel dedicated machines under multiple resource constraints.
Discret. Appl. Math., 2003
Comput. Sci. J. Moldova, 2003
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001
Proceedings of the Approximation, 2001
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
Inf. Process. Lett., 2000
Eur. J. Oper. Res., 2000
Eur. J. Oper. Res., 2000
Ann. Oper. Res., 2000
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine.
SIAM J. Comput., 1999
J. Comb. Optim., 1999
Proceedings of the Randomization, 1999
Inf. Process. Lett., 1998
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997
Computing the optimum stock size.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993
Oper. Res. Lett., 1992
Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-Algorithm.
Eine Verschärfung der Quadratwurzel-Schranke für Quadratische-Rest-Codes einer Länge n = -1 mod 4.
J. Inf. Process. Cybern., 1987