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):
Displayed 9 items.
- Scheduling with testing on multiple identical parallel machines (Q832831) (← 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)
- 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)
- A Semi-Online Algorithm for Single Machine Scheduling with Rejection (Q5024475) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)