The following pages link to Hans Kellerer (Q257208):
Displaying 50 items.
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← links)
- A 13/12 approximation algorithm for bin packing with extendable bins (Q293250) (← links)
- Semi-online scheduling on a single machine with unexpected breakdown (Q306274) (← links)
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
- A 3/2-approximation algorithm for \(k_i\)-partitioning (Q408403) (← links)
- Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times (Q496647) (← links)
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals (Q498410) (← links)
- Semi-on-line multiprocessor scheduling with given total processing time (Q557814) (← links)
- Batch machine production with perishability time windows and limited batch size (Q631099) (← links)
- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates (Q640300) (← links)
- A greedy heuristic for 3-partitioning with similar elements (Q685863) (← links)
- Approximability issues for unconstrained and constrained maximization of half-product related functions (Q730001) (← links)
- (Q806666) (redirect page) (← links)
- Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm (Q806667) (← links)
- Prime covers and periodic patterns (Q810037) (← links)
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (Q861263) (← links)
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time (Q906558) (← links)
- An approximation algorithm for identical parallel machine scheduling with resource dependent processing times (Q935202) (← links)
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
- Operator non-availability periods (Q1041405) (← links)
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval (Q1042105) (← links)
- Über die Quadratwurzel-Schranke für quadratische-Rest-Codes. (On the square root bound for quadratic-residue codes) (Q1102256) (← links)
- UET-scheduling with constrained processor allocations (Q1185984) (← links)
- The exact LPT-bound for maximizing the minimum completion time (Q1196214) (← links)
- A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling (Q1210221) (← links)
- A linear compound algorithm for uniform machine scheduling (Q1266304) (← links)
- Semi on-line algorithms for the partition problem (Q1267197) (← links)
- The \(k\)-partitioning problem (Q1298757) (← links)
- A new fully polynomial time approximation scheme for the Knapsack problem (Q1304384) (← links)
- A tight bound for 3-partitioning (Q1309812) (← links)
- On the Euclidean two paths problem (Q1315995) (← links)
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
- A 3/4-approximation algorithm for multiple subset sum (Q1402509) (← links)
- Optimization of cardinality constrained portfolios with a hybrid local search algorithm (Q1412165) (← links)
- Scheduling problems for parallel dedicated machines under multiple resource constraints. (Q1417559) (← links)
- Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
- A PTAS for the multiple subset sum problem with different knapsack capacities (Q1607031) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- Restricted assignment scheduling with resource constraints (Q1713408) (← links)
- Bin packing games with weight decision: how to get a small value for the price of anarchy (Q1757770) (← links)
- Algorithms better than LPT for semi-online scheduling with decreasing processing times (Q1758275) (← links)
- Improved dynamic programming in connection with an FPTAS for the knapsack problem (Q1768594) (← links)
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225) (← links)
- Bounds and tabu search for a cyclic max-min scheduling problem (Q1850964) (← links)
- Scheduling parallel dedicated machines under a single non-shared resource (Q1869718) (← links)
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing (Q1870001) (← links)
- Design of tariff zones in public transportation networks: theoretical results and heuristics (Q1880246) (← links)
- Lower bounds and semi on-line multiprocessor scheduling (Q1884352) (← links)
- Algorithms for on-line bin-packing problems with cardinality constraints (Q1887058) (← links)
- Parallel dedicated machines scheduling with chain precedence constraints (Q1926857) (← links)
