Pages that link to "Item:Q4785695"

The following pages link to Scheduling Unrelated Machines by Randomized Rounding (Q4785695):

Displaying 31 items.

• A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
• Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
• Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
• On-line scheduling to minimize average completion time revisited. (Q703266) (← links)
• Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
• LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
• Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
• Scheduling maintenance jobs in networks (Q1628599) (← links)
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
• Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times (Q2168720) (← links)
• A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
• An \(R||C_{\max}\) quantum scheduling algorithm (Q2384180) (← links)
• The benefit of preemption with respect to the \(\ell_p\) norm (Q2417189) (← links)
• Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
• Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines (Q2664447) (← links)
• An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
• Truthfulness for the Sum of Weighted Completion Times (Q2817845) (← links)
• Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines (Q2957687) (← links)
• Almost sure asymptotic optimality for online routing and machine scheduling problems (Q3057128) (← links)
• Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
• Serving in the Dark should be done Non-Uniformly (Q3448776) (← links)
• Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time (Q4689382) (← links)
• Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
• Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (Q5060512) (← links)
• (Q5092350) (← links)
• Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
• Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
• Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Q5131543) (← links)
• A Tight 2-Approximation for Preemptive Stochastic Scheduling (Q5247621) (← links)
• Stochastic Online Scheduling Revisited (Q5505682) (← links)