Pages that link to "Item:Q4645931"
From MaRDI portal
The following pages link to Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (Q4645931):
Displayed 19 items.
- Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
- Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors (Q1751173) (← links)
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846) (← links)
- Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates (Q2294224) (← links)
- A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q2417184) (← links)
- Approximating Single Machine Scheduling with Scenarios (Q3541793) (← links)
- A supermodular relaxation for scheduling with release dates (Q4645930) (← links)
- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (Q4645931) (← links)
- A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
- Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Q5131543) (← links)
- Randomized mechanism design for decentralized network scheduling (Q5135252) (← links)
- Decision diagrams for solving a job scheduling problem under precedence constraints (Q5140712) (← links)
- Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds (Q5232862) (← links)
- Order Scheduling Models: Hardness and Algorithms (Q5458825) (← links)
- A note on weighted completion time minimization in a flexible flow shop (Q5949902) (← links)