The following pages link to Semi-online scheduling revisited (Q442235):
Displaying 19 items.
- Online bin packing with advice (Q261387) (← links)
- Semi-online scheduling problems on a small number of machines (Q398877) (← links)
- Online bin stretching with bunch techniques (Q497684) (← links)
- Scheduling with testing on multiple identical parallel machines (Q832831) (← 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)
- 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)
- Dynamic programming optimization in line of sight networks (Q2288208) (← links)
- Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
- An efficient algorithm for bin stretching (Q2450663) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- (Q5090428) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
- Dynamic scheduling of patients in emergency departments (Q6113312) (← links)
- Semi-online scheduling on two identical parallel machines with initial-lookahead information (Q6561561) (← links)
