Pages that link to "Item:Q3757393"

The following pages link to Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem (Q3757393):

Displaying 47 items.

• Minimizing the total weighted completion time of fully parallel jobs with integer parallel units (Q393040) (← links)
• Coordination mechanisms with hybrid local policies (Q408369) (← links)
• Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
• An alternative proof of the Kawaguchi-Kyan bound for the largest-ratio-first rule (Q433121) (← links)
• Cost-sharing mechanisms for scheduling under general demand settings (Q439369) (← links)
• A note on minimizing the sum of quadratic completion times on two identical parallel machines (Q456107) (← links)
• Scheduling to minimize the maximum total completion time per machine (Q726222) (← links)
• Approximation results in parallel machines stochastic scheduling (Q922283) (← links)
• A new dynamic programming algorithm for the parallel machines total weighted completion time problem (Q1197881) (← links)
• Minimizing average completion time in the presence of release dates (Q1290642) (← links)
• Scheduling identical parallel machines to minimize total weighted completion time (Q1317043) (← links)
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
• A PTAS for the average weighted completion time problem on unrelated machines. (Q1592754) (← links)
• Shapley value for parallel machine sequencing situation without initial order (Q1665679) (← links)
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
• An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time (Q1716959) (← links)
• On the minimization of total weighted flow time with identical and uniform parallel machines (Q1806644) (← links)
• Coordination mechanisms for parallel machine scheduling (Q1926738) (← links)
• Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires (Q1959184) (← links)
• Frameworks for adaptable scheduling algorithms (Q1976517) (← links)
• Weighted completion time minimization for capacitated parallel machines (Q2085744) (← links)
• Decorous combinatorial lower bounds for row layout problems (Q2189888) (← links)
• Scheduling fully parallel jobs (Q2317138) (← links)
• A system-centric metric for the evaluation of online job schedules (Q2434258) (← links)
• The list scheduling algorithm for scheduling unreliable jobs on two parallel machines (Q2448904) (← links)
• Analysis of Smith's rule in stochastic machine scheduling (Q2450731) (← links)
• Quality of move-optimal schedules for minimizing total weighted completion time (Q2480059) (← links)
• Preemptive multiprocessor order scheduling to minimize total weighted flowtime (Q2482817) (← links)
• Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines (Q2661490) (← links)
• Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines (Q2664447) (← links)
• Unrelated parallel machine scheduling with new criteria: complexity and models (Q2668730) (← links)
• Truthfulness for the Sum of Weighted Completion Times (Q2817845) (← links)
• Scheduling Fully Parallel Jobs with Integer Parallel Units (Q2988818) (← links)
• (Q3304142) (← links)
• Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem (Q3611971) (← links)
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
• Scheduling batch processing machines with incompatible job families (Q4399080) (← links)
• Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (Q4645931) (← links)
• On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems (Q4649211) (← links)
• Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families (Q4671312) (← links)
• Scheduling jobs that arrive over time (Q5057424) (← links)
• Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems (Q5459996) (← links)
• A note on weighted completion time minimization in a flexible flow shop (Q5949902) (← links)
• Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines (Q6126818) (← links)
• A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines (Q6588490) (← links)