Pages that link to "Item:Q4645938"

The following pages link to Optimal on-line algorithms for single-machine scheduling (Q4645938):

Displaying 23 items.

• Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
• Online integrated production-distribution scheduling problems without preemption (Q281801) (← links)
• Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← links)
• Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
• On-line scheduling of parallel machines to minimize total completion times (Q1010275) (← links)
• Online scheduling problems with flexible release dates: applications to infrastructure restoration (Q1651574) (← links)
• A class of on-line scheduling algorithms to minimize total completion time (Q1811633) (← links)
• Robust algorithms for total completion time (Q2010916) (← links)
• Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← 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 best possible algorithm for an online scheduling problem with position-based learning effect (Q2171076) (← links)
• On-line booking policies and competitive analysis of medical examination in hospital (Q2336398) (← links)
• Optimal on-line flow time with resource augmentation (Q2489955) (← 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)
• An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
• An Optimal Online Algorithm for Scheduling with Learning Consideration (Q5024474) (← links)
• Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms (Q5139609) (← links)
• Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates (Q5952071) (← links)
• On competitive analysis for polling systems (Q6072151) (← links)
• Joint replenishment meets scheduling (Q6102849) (← links)
• A best possible online algorithm for minimizing the total completion time and the total soft penalty cost (Q6181379) (← links)