hans-kellerer documents

Note: Open-shop scheduling with release dates to minimize maximum lateness
Documents Note: Open-shop scheduling with release dates to minimize maximum lateness
Multiple subset sum with inclusive assignment set restrictions
Documents Multiple subset sum with inclusive assignment set restrictions
On the Euclidean two paths problem
Documents On the Euclidean two paths problem
UET-scheduling with constrained processor allocations
Documents UET-scheduling with constrained processor allocations
An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
Documents An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
Documents A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
An efficient fully polynomial approximation scheme for the Subset-Sum Problem
Documents An efficient fully polynomial approximation scheme for the Subset-Sum Problem
Semi on-line algorithms for the partition problem
Documents Semi on-line algorithms for the partition problem
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
Documents An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
Two linear approximation algorithms for the subset-sum problem
Documents Two linear approximation algorithms for the subset-sum problem
Ausgewählte Probleme der Wirtschafts- und soziologischen Statistik
Documents Ausgewählte Probleme der Wirtschafts- und soziologischen Statistik
Schriftenverzeichnis
Documents Schriftenverzeichnis
Algorithms for multiprocessor scheduling with machine release times
Documents Algorithms for multiprocessor scheduling with machine release times
A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem
Documents A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem
A 3/2-approximation algorithm for -partitioning
Documents A 3/2-approximation algorithm for -partitioning