Pages that link to "Item:Q4578168"
From MaRDI portal
The following pages link to Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168):
Displaying 8 items.
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
- Capacitated two-parallel machines scheduling to minimize sum of job completion times (Q1208482) (← links)
- A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519) (← links)
- An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
- A comment on scheduling two parallel machines with capacity constraints (Q2581321) (← links)
- Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks (Q3541789) (← links)
- A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint (Q5059405) (← links)
- Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan (Q6594026) (← links)
