Pages that link to "Item:Q328085"
From MaRDI portal
The following pages link to On-line scheduling on parallel machines to minimize the makespan (Q328085):
Displaying 16 items.
- A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan (Q337146) (← links)
- Online LPT algorithms for parallel machines scheduling with a single server (Q385479) (← links)
- Online optimization of busy time on parallel machines (Q477193) (← links)
- A new algorithm for online uniform-machine scheduling to minimize the makespan (Q845691) (← links)
- Online scheduling of parallel jobs on two machines is 2-competitive (Q924886) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- On-line scheduling of parallel jobs on two machines (Q954945) (← links)
- On-line scheduling of parallel machines to minimize total completion times (Q1010275) (← links)
- Scheduling on identical machines: How good is LPT in an on-line setting? (Q1382806) (← links)
- The optimal on-line parallel machine scheduling (Q1568731) (← links)
- Heuristics for online scheduling on identical parallel machines with two GoS levels (Q2320626) (← links)
- A modified LPT algorithm for the two uniform parallel machine makespan minimization problem (Q2378450) (← links)
- Randomized on-line scheduling similar jobs to minimize makespan on two identical processors (Q2508042) (← links)
- Online scheduling on two parallel identical machines under a grade of service provision (Q2683376) (← links)
- (Q3403188) (← links)
- Approximation and Online Algorithms (Q5896926) (← links)