Pages that link to "Item:Q2464434"
From MaRDI portal
The following pages link to The on-line multiprocessor scheduling problem with known sum of the tasks (Q2464434):
Displaying 16 items.
- Semi-online scheduling problems on a small number of machines (Q398877) (← links)
- Semi-online scheduling revisited (Q442235) (← links)
- Online bin stretching with bunch techniques (Q497684) (← links)
- Online scheduling with a buffer on related machines (Q711400) (← links)
- Semi on-line scheduling on three processors with known sum of the tasks (Q835557) (← links)
- Semi-online scheduling problems on two identical machines with inexact partial information (Q884466) (← links)
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time (Q906558) (← links)
- Two semi-online scheduling problems on two uniform machines (Q1006050) (← links)
- 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)
- An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time (Q2043022) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- An efficient algorithm for bin stretching (Q2450663) (← links)
- Semi-online scheduling with ``end of sequence'' information (Q2460107) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)
