Pages that link to "Item:Q4427320"

The following pages link to When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? (Q4427320):

Displaying 48 items.

• The proportionate flow shop total tardiness problem (Q2178064) (← links)
• Parallel-batch scheduling with deterioration and rejection on a single machine (Q2194699) (← links)
• Single-machine scheduling with operator non-availability to minimize total weighted completion time (Q2195317) (← links)
• Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
• Scheduling on a single machine and parallel machines with batch deliveries and potential disruption (Q2210272) (← links)
• Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← links)
• Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
• Scheduling for gathering multitype data with local computations (Q2239981) (← links)
• Approximation schemes for \(r\)-weighted minimization knapsack problems (Q2288864) (← links)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
• Two-agent scheduling problems with the general position-dependent processing time (Q2333788) (← links)
• Offline black and white bin packing (Q2355707) (← links)
• Approximation schemes for scheduling a maintenance and linear deteriorating jobs (Q2358862) (← links)
• Approximating multidimensional subset sum and Minkowski decomposition of polygons (Q2364904) (← links)
• Complexity and approximability of scheduling resumable proportionally deteriorating jobs (Q2379562) (← links)
• The finite horizon investor problem with a budget constraint (Q2379989) (← links)
• Approximation schemes for a class of subset selection problems (Q2381527) (← links)
• Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
• Single-machine scheduling with production and rejection costs to minimize the maximum earliness (Q2410087) (← links)
• Scheduling with rejection and non-identical job arrivals (Q2425836) (← links)
• Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (Q2428688) (← links)
• Scheduling of pipelined operator graphs (Q2434287) (← links)
• Bounded parallel-batching scheduling with two competing agents (Q2434316) (← links)
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) (← links)
• Bin covering with cardinality constraints (Q2446840) (← links)
• An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure (Q2492672) (← links)
• A comment on scheduling two parallel machines with capacity constraints (Q2581321) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Approximation Scheme for Scheduling Resumable Proportionally Deteriorating Jobs (Q3004654) (← links)
• A note on dual approximation algorithms for class constrained bin packing problems (Q3625691) (← links)
• POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION (Q3646206) (← links)
• Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
• TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION (Q4649879) (← links)
• Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
• Packing Under Convex Quadratic Constraints (Q5041751) (← links)
• Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs (Q5059255) (← links)
• An FPTAS of minimizing total weighted completion time on single machine with position constraint (Q5136235) (← links)
• Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs (Q5148187) (← links)
• Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs (Q5148198) (← links)
• The subset sum game revisited (Q5918370) (← links)
• An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
• Approximation algorithms for scheduling with reservations (Q5961975) (← links)
• Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← links)
• Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
• Two-agent single-machine scheduling with release dates to minimize the makespan (Q6081603) (← links)
• Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)
• Single machine scheduling with assignable due dates to minimize maximum and total late work (Q6167395) (← links)
• Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost (Q6542992) (← links)