Pages that link to "Item:Q906558"
From MaRDI portal
The following pages link to An efficient algorithm for semi-online multiprocessor scheduling with given total processing time (Q906558):
Displaying 17 items.
- Semi-online scheduling revisited (Q442235) (← links)
- Semi-on-line multiprocessor scheduling with given total processing time (Q557814) (← links)
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Semi on-line scheduling on three processors with known sum of the tasks (Q835557) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- General parametric scheme for the online uniform machine scheduling problem with two different speeds (Q1707972) (← links)
- Algorithms better than LPT for semi-online scheduling with decreasing processing times (Q1758275) (← links)
- Lower bounds and semi on-line multiprocessor scheduling (Q1884352) (← links)
- An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time (Q2043022) (← links)
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence (Q2165267) (← links)
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- (Q3402928) (← links)
- A Semi-Online Algorithm for Single Machine Scheduling with Rejection (Q5024475) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
- Semi-online scheduling on two identical parallel machines with initial-lookahead information (Q6561561) (← links)