Pages that link to "Item:Q1885287"

The following pages link to Semi-online algorithms for parallel machine scheduling problems (Q1885287):

Displaying 18 items.

• Semi-online scheduling for jobs with release times (Q385494) (← links)
• Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
• Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling (Q491212) (← links)
• Several semi-online scheduling problems on two identical machines with combined information (Q714838) (← links)
• Optimal semi-online algorithms for machine covering (Q870840) (← links)
• Semi-online scheduling problems on two identical machines with inexact partial information (Q884466) (← links)
• List scheduling for jobs with arbitrary release times and similar lengths (Q954249) (← links)
• Machine covering with combined partial information (Q972842) (← links)
• Extension of algorithm list scheduling for a semi-online scheduling problem (Q1011847) (← links)
• A survey on makespan minimization in semi-online environments (Q1617278) (← links)
• Preemptive online algorithms for scheduling with machine cost (Q1777224) (← links)
• Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines (Q1944914) (← links)
• A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model (Q2079980) (← links)
• Semi-online scheduling with ``end of sequence'' information (Q2460107) (← links)
• Semi-online scheduling on two uniform processors (Q2481966) (← links)
• Semi-online scheduling: a survey (Q2669808) (← links)
• Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines (Q5169463) (← links)
• Bin stretching with migration on two hierarchical machines (Q6093406) (← links)