Pages that link to "Item:Q557814"
From MaRDI portal
The following pages link to Semi-on-line multiprocessor scheduling with given total processing time (Q557814):
Displayed 24 items.
- Online bin packing with advice (Q261387) (← links)
- Semi-online scheduling problems on a small number of machines (Q398877) (← links)
- Semi-online scheduling revisited (Q442235) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Online bin stretching with bunch techniques (Q497684) (← links)
- Best semi-online algorithms for unbounded parallel batch scheduling (Q534351) (← links)
- Online makespan minimization with budgeted uncertainty (Q832833) (← links)
- Semi-online machine covering on two uniform machines with known total size (Q858190) (← links)
- Optimal semi-online algorithms for machine covering (Q870840) (← links)
- Semi-online scheduling problems on two identical machines with inexact partial information (Q884466) (← links)
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time (Q906558) (← links)
- Machine covering with combined partial information (Q972842) (← links)
- Two semi-online scheduling problems on two uniform machines (Q1006050) (← 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)
- Scheduling In the random-order model (Q1979454) (← 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)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- Optimal algorithms for semi-online machine covering on two hierarchical machines (Q2441779) (← links)
- An efficient algorithm for bin stretching (Q2450663) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)