Pages that link to "Item:Q398877"
From MaRDI portal
The following pages link to Semi-online scheduling problems on a small number of machines (Q398877):
Displaying 19 items.
- Semi-online scheduling revisited (Q442235) (← links)
- Best semi-online algorithms for unbounded parallel batch scheduling (Q534351) (← links)
- Semi-on-line multiprocessor scheduling with given total processing time (Q557814) (← links)
- Semi-online scheduling on two identical machines with a common due date to maximize total early work (Q827603) (← links)
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time (Q906558) (← links)
- Extension of algorithm list scheduling for a semi-online scheduling problem (Q1011847) (← links)
- Semi on-line scheduling on two identical machines (Q1300219) (← links)
- Semi-online scheduling with machine cost. (Q1433957) (← 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)
- Semi-online algorithms for parallel machine scheduling problems (Q1885287) (← links)
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
- Semi-online scheduling with ``end of sequence'' information (Q2460107) (← links)
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (Q5248073) (← links)
- Semi-online scheduling with combined information on two identical machines in parallel (Q5963644) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)