Pages that link to "Item:Q1408829"
From MaRDI portal
The following pages link to On the approximability of average completion time scheduling under precedence constraints. (Q1408829):
Displaying 22 items.
- Minimizing completion time for a class of scheduling problems (Q794156) (← links)
- Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
- A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time (Q1414243) (← links)
- Preemptive scheduling with availability constraints to minimize total weighted completion times (Q1772973) (← links)
- LAD models, trees, and an analog of the fundamental theorem of arithmetic (Q1949097) (← links)
- Precedence-constrained covering problems with multiplicity constraints (Q2085754) (← links)
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective (Q2154452) (← links)
- Preemptive and non-preemptive generalized min sum set cover (Q2248757) (← links)
- An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
- Primal-dual algorithms for precedence constrained covering problems (Q2408089) (← links)
- On the approximability of single-machine scheduling with precedence constraints (Q2884295) (← links)
- Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling (Q3169127) (← links)
- Approximating Weighted Completion Time for Order Scheduling with Setup Times (Q3297757) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
- Primal-Dual Algorithms for Precedence Constrained Covering Problems (Q3453300) (← links)
- Min-Sum Scheduling Under Precedence Constraints (Q4606348) (← links)
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)
- Precedence-constrained covering problems with multiplicity constraints (Q6039535) (← links)
- Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations (Q6106537) (← links)
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023 (Q6544493) (← links)
- Vertex ordering with precedence constraints (Q6546603) (← links)
- On min sum vertex cover and generalized min sum set cover (Q6663094) (← links)
