Pages that link to "Item:Q4645930"
From MaRDI portal
The following pages link to A supermodular relaxation for scheduling with release dates (Q4645930):
Displaying 10 items.
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- A 1. 47-approximation for a preemptive single-machine scheduling problem (Q1577468) (← links)
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846) (← links)
- A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q2417184) (← links)
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
- An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (Q4645931) (← links)
- Approximately Supermodular Scheduling Subject to Matroid Constraints (Q5090799) (← links)
- Randomized mechanism design for decentralized network scheduling (Q5135252) (← links)
- Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds (Q5232862) (← links)
