Pages that link to "Item:Q1010275"

The following pages link to On-line scheduling of parallel machines to minimize total completion times (Q1010275):

Displaying 27 items.

• A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
• Online optimization of busy time on parallel machines (Q477193) (← links)
• Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
• Scheduling to minimize the maximum total completion time per machine (Q726222) (← links)
• Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
• Online scheduling of two uniform machines to minimize total completion times (Q1013450) (← links)
• Online scheduling to minimize modified total tardiness with an availability constraint (Q1034623) (← links)
• On-line scheduling on a single machine: Minimizing the total completion time (Q1306569) (← links)
• The optimal on-line parallel machine scheduling (Q1568731) (← links)
• Ordinal on-line scheduling for maximizing the minimum machine completion time (Q1598882) (← links)
• Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
• An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959) (← links)
• A class of on-line scheduling algorithms to minimize total completion time (Q1811633) (← links)
• Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
• Randomized selection algorithm for online stochastic unrelated machines scheduling (Q2082193) (← links)
• Online scheduling of time-critical tasks to minimize the number of calibrations (Q2124226) (← 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)
• 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)
• The on-line preemptive scheduling on parallel machines which have nonsimultaneous machine available times (Q2910573) (← links)
• (Q2948897) (← links)
• (Q4411418) (← links)
• (Q4828982) (← links)
• Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms (Q5139609) (← links)
• (Q5319420) (← links)
• A competitive online algorithm for minimizing total weighted completion time on uniform machines (Q6534502) (← links)