Pages that link to "Item:Q2029304"

The following pages link to Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304):

Displaying 11 items.

• An optimal online algorithm for single-processor scheduling problem with learning effect (Q2079858) (← links)
• Single machine scheduling with rejection and generalized parameters (Q2149874) (← links)
• Single machine scheduling with rejection to minimize the weighted makespan (Q2151365) (← links)
• A best possible algorithm for an online scheduling problem with position-based learning effect (Q2171076) (← links)
• An Optimal Online Algorithm for Scheduling with Learning Consideration (Q5024474) (← links)
• A Semi-Online Algorithm for Single Machine Scheduling with Rejection (Q5024475) (← links)
• Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost (Q6053958) (← links)
• Order acceptance and scheduling with delivery under generalized parameters (Q6179281) (← links)
• A best possible online algorithm for minimizing the total completion time and the total soft penalty cost (Q6181379) (← links)
• Online single-processor scheduling with an unexpected breakdown (Q6561564) (← links)
• Online early work scheduling on parallel machines (Q6586214) (← links)