Pages that link to "Item:Q3211098"
From MaRDI portal
The following pages link to Lower bounds for single-machine scheduling problems (Q3211098):
Displaying 10 items.
- Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
- A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) (← links)
- Range of lower bounds (Q648257) (← links)
- Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems (Q1278545) (← links)
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. (Q1413906) (← links)
- A tight lower bound for the best-\(\alpha\) algorithm (Q1606957) (← links)
- Multi-machine scheduling lower bounds using decision diagrams (Q2294251) (← links)
- Two very large-scale neighborhoods for single machine scheduling (Q2642308) (← links)
- Scheduling with target start times (Q5925938) (← links)
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates (Q6066663) (← links)
