Pages that link to "Item:Q1568731"
From MaRDI portal
The following pages link to The optimal on-line parallel machine scheduling (Q1568731):
Displayed 12 items.
- Semi-online scheduling with bounded job sizes on two uniform machines (Q338376) (← links)
- An on-line scheduling problem of parallel machines with common maintenance time (Q394448) (← links)
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832) (← links)
- Optimal semi-online algorithms for machine covering (Q870840) (← links)
- Extension of algorithm list scheduling for a semi-online scheduling problem (Q1011847) (← links)
- Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times (Q1609082) (← links)
- Semi-on-line problems on two identical machines with combined partial information (Q1870021) (← links)
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) (← links)
- Preemptive machine covering on parallel machines (Q2583174) (← links)
- A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS (Q4650621) (← links)
- SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES (Q5315986) (← links)