Pages that link to "Item:Q1702659"
From MaRDI portal
The following pages link to Online bin stretching with three bins (Q1702659):
Displayed 8 items.
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847) (← links)
- A two-phase algorithm for bin stretching with stretching factor 1.5 (Q1680492) (← links)
- An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time (Q2043022) (← links)
- Discovering and certifying lower bounds for the online bin stretching problem (Q2089680) (← links)
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)
- Online early work maximization on three hierarchical machines with a common due date (Q6166875) (← links)