Pages that link to "Item:Q1013970"

The following pages link to LP-based online scheduling: From single to parallel machines (Q1013970):

Displaying 20 items.

• A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
• Competitive analysis of preemptive single-machine scheduling (Q614049) (← links)
• Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines (Q763104) (← links)
• Online scheduling problems with flexible release dates: applications to infrastructure restoration (Q1651574) (← links)
• An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959) (← links)
• An optimal online algorithm for single-processor scheduling problem with learning effect (Q2079858) (← links)
• Randomized selection algorithm for online stochastic unrelated machines scheduling (Q2082193) (← links)
• A \(2.28\)-competitive algorithm for online scheduling on identical machines (Q2514649) (← links)
• A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection (Q2662527) (← links)
• Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines (Q2664447) (← links)
• An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
• Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
• Online Appointment Scheduling in the Random Order Model (Q3452831) (← links)
• Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time (Q4689382) (← links)
• Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
• Randomized mechanism design for decentralized network scheduling (Q5135252) (← links)
• A Tight 2-Approximation for Preemptive Stochastic Scheduling (Q5247621) (← links)
• Online scheduling with deterioration and unexpected processor breakdown (Q6047192) (← links)
• A competitive online algorithm for minimizing total weighted completion time on uniform machines (Q6534502) (← links)
• Online single-processor scheduling with an unexpected breakdown (Q6561564) (← links)