Pages that link to "Item:Q2565855"

The following pages link to Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855):

Displaying 9 items.

• Semi-online scheduling with bounded job sizes on two uniform machines (Q338376) (← links)
• An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times (Q968014) (← links)
• An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time (Q991796) (← 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)
• A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection (Q2662527) (← links)
• Semi-online scheduling: a survey (Q2669808) (← links)
• Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes (Q3455876) (← links)
• A Semi-Online Algorithm for Single Machine Scheduling with Rejection (Q5024475) (← links)