Pages that link to "Item:Q826114"
From MaRDI portal
The following pages link to Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria (Q826114):
Displaying 7 items.
- A survey on offline scheduling with rejection (Q398830) (← links)
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541) (← links)
- A 1. 47-approximation for a preemptive single-machine scheduling problem (Q1577468) (← links)
- Scheduling fully parallel jobs (Q2317138) (← links)
- Online scheduling to minimize the total weighted completion time plus the rejection cost (Q2410099) (← links)
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
- Scheduling projects with labor constraints (Q5946815) (← links)
