Pages that link to "Item:Q2450663"
From MaRDI portal
The following pages link to An efficient algorithm for bin stretching (Q2450663):
Displayed 15 items.
- Online bin stretching with bunch techniques (Q497684) (← links)
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time (Q906558) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- A two-phase algorithm for bin stretching with stretching factor 1.5 (Q1680492) (← links)
- Online bin stretching with three bins (Q1702659) (← links)
- General parametric scheme for the online uniform machine scheduling problem with two different speeds (Q1707972) (← links)
- Scheduling In the random-order model (Q1979454) (← links)
- An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time (Q2043022) (← links)
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- Improved lower bounds for the online bin stretching problem (Q2399609) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Better Algorithms for Online Bin Stretching (Q3453280) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)