Pages that link to "Item:Q4361782"

The following pages link to Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms (Q4361782):

Displaying 50 items.

• Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
• Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines (Q290334) (← links)
• Optimal restricted due date assignment in scheduling (Q322834) (← links)
• A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
• The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
• Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
• Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
• Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
• Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
• On-line scheduling to minimize average completion time revisited. (Q703266) (← links)
• Scheduling MapReduce jobs on identical and unrelated processors (Q778521) (← links)
• Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
• Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
• A 2-OPT procedure to reduce total inspection time in a serial inspection process (Q877228) (← links)
• Partially ordered knapsack and applications to scheduling (Q881568) (← links)
• Scheduling orders for multiple product types to minimize total weighted completion time (Q881573) (← links)
• Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time (Q940879) (← links)
• Scheduling problems in master-slave model (Q940888) (← links)
• A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541) (← links)
• Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints (Q955602) (← links)
• Maximizing business value by optimal assignment of jobs to resources in grid computing (Q958577) (← links)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
• An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time (Q991796) (← links)
• Scheduling hybrid flowshop with parallel batching machines and compatibilities (Q1000991) (← links)
• Interval-indexed formulation based heuristics for single machine total weighted tardiness problem (Q1001009) (← links)
• On-line scheduling of parallel machines to minimize total completion times (Q1010275) (← links)
• LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
• Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
• Combinatorial algorithms for data migration to minimize average completion time (Q1024212) (← links)
• Online scheduling to minimize modified total tardiness with an availability constraint (Q1034623) (← links)
• Approximation results for a bicriteria job scheduling problem on a single machine without preemption (Q1041716) (← links)
• Minimizing average completion time in the presence of release dates (Q1290642) (← links)
• News from the online traveling repairman. (Q1401247) (← links)
• On the approximability of average completion time scheduling under precedence constraints. (Q1408829) (← links)
• A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time (Q1414243) (← links)
• A 1. 47-approximation for a preemptive single-machine scheduling problem (Q1577468) (← links)
• A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines (Q1592284) (← links)
• A PTAS for the average weighted completion time problem on unrelated machines. (Q1592754) (← links)
• Restarts can help in the on-line minimization of the maximum delivery time on a single machine (Q1592755) (← links)
• Off-line admission control for general scheduling problems (Q1592760) (← links)
• The power of \(\alpha\)-points in preemptive single machine scheduling. (Q1600001) (← links)
• Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
• Online scheduling problems with flexible release dates: applications to infrastructure restoration (Q1651574) (← links)
• Online scheduling on bounded batch machines to minimize the maximum weighted completion time (Q1656199) (← links)
• Splitting versus setup trade-offs for scheduling to minimize weighted completion time (Q1694777) (← links)
• An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959) (← links)
• Resource cost aware scheduling (Q1750475) (← links)
• An integer programming approach to optimal basic block instruction scheduling for single-issue processors (Q1751173) (← links)
• Reference points and approximation algorithms in multicriteria discrete optimization (Q1753504) (← links)
• A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846) (← links)