Pages that link to "Item:Q4139680"

The following pages link to Preemptive Scheduling of Uniform Processor Systems (Q4139680):

Displaying 31 items.

• A survey of scheduling with controllable processing times (Q2381529) (← links)
• Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← links)
• Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (Q2398640) (← links)
• Schedules with a single preemption on uniform parallel machines (Q2414478) (← links)
• The benefit of preemption with respect to the \(\ell_p\) norm (Q2417189) (← links)
• Heuristics and augmented neural networks for task scheduling with non-identical machines (Q2432852) (← links)
• Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037) (← links)
• Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph (Q2508774) (← links)
• Optimal preemptive scheduling for general target functions (Q2581760) (← links)
• Preemptive machine covering on parallel machines (Q2583174) (← links)
• Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines (Q2957687) (← links)
• Job Tardiness in Unequal Parallel Processor Systems (Q3035127) (← links)
• The Open Shop Scheduling Problem (Q3304098) (← links)
• Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness (Q3340134) (← links)
• Scheduling on semi-identical processors (Q3343751) (← links)
• OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES (Q3379505) (← links)
• Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
• Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (Q3541133) (← links)
• On the Complexity of Scheduling to Optimize Average Response Time (Q4272552) (← links)
• (Q4737209) (← links)
• (Q4918391) (← links)
• Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms (Q5031662) (← links)
• APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS (Q5187850) (← links)
• Preemptive Scheduling on Selfish Machines (Q5458506) (← links)
• A Truthful Mechanism for Offline Ad Slot Scheduling (Q5459983) (← links)
• Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function (Q5471126) (← links)
• From non-preemptive to preemptive scheduling using synchronization synthesis (Q5892421) (← links)
• New applications of the Muntz and Coffman algorithm (Q5946720) (← links)
• Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924) (← links)
• Preemptive multiprocessor scheduling with rejection (Q5958131) (← links)
• On the complexity of scheduling unrelated parallel machines with limited preemptions (Q6161912) (← links)