Pages that link to "Item:Q1290642"

The following pages link to Minimizing average completion time in the presence of release dates (Q1290642):

Displaying 44 items.

• Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← links)
• An improved analysis of SRPT scheduling algorithm on the basis of functional optimization (Q456176) (← 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)
• A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time'' (Q763490) (← links)
• Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
• Scheduling problems in master-slave model (Q940888) (← 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)
• Interval-indexed formulation based heuristics for single machine total weighted tardiness problem (Q1001009) (← links)
• LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
• A 1. 47-approximation for a preemptive single-machine scheduling problem (Q1577468) (← links)
• Randomized algorithms for on-line scheduling problems: How low can't you go? (Q1612009) (← 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)
• A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846) (← links)
• A class of on-line scheduling algorithms to minimize total completion time (Q1811633) (← links)
• Common due date assignment and scheduling with ready times (Q1867095) (← 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)
• Online scheduling to minimize the total weighted completion time plus the rejection cost (Q2410099) (← links)
• Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints (Q2450684) (← links)
• Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
• The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates (Q2490322) (← links)
• On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← 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)
• A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting (Q2798120) (← links)
• Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time (Q4561187) (← links)
• Online Single Machine Scheduling to Minimize the Maximum Starting Time (Q4595323) (← links)
• Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
• (Q5009585) (← links)
• A Semi-Online Algorithm for Single Machine Scheduling with Rejection (Q5024475) (← links)
• Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining (Q5060783) (← links)
• Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
• Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems (Q5459996) (← 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)
• Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines (Q6126818) (← links)
• A competitive online algorithm for minimizing total weighted completion time on uniform machines (Q6534502) (← links)
• Approximating weighted completion time via stronger negative correlation (Q6620463) (← links)