Pages that link to "Item:Q2784456"

The following pages link to Approximating the Throughput of Multiple Machines in Real-Time Scheduling (Q2784456):

Displaying 41 items.

• Resource loading with time windows (Q319369) (← links)
• Coordinated scheduling of production and delivery with production window and delivery capacity constraints (Q417989) (← links)
• Bandwidth allocation in cellular networks with multiple interferences (Q494422) (← links)
• Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics (Q553339) (← links)
• Fair and efficient cake division with connected pieces (Q776236) (← links)
• On the Price of Anarchy of cost-sharing in real-time scheduling systems (Q777962) (← links)
• Graph colouring approaches for a satellite range scheduling problem (Q835607) (← links)
• Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
• A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry (Q878576) (← links)
• Bicriteria scheduling for contiguous and non contiguous parallel tasks (Q940878) (← links)
• Integrated production and delivery scheduling with disjoint windows (Q972326) (← links)
• Randomized priority algorithms (Q974749) (← links)
• Bandwidth-constrained allocation in grid computing (Q1018048) (← links)
• Priority algorithms for the subset-sum problem (Q1029701) (← links)
• Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
• High-performance technique for satellite range scheduling (Q1652343) (← links)
• A truthful mechanism for value-based scheduling in cloud computing (Q1678764) (← links)
• Online C-benevolent job scheduling on multiple machines (Q1744621) (← links)
• Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
• Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs (Q2140265) (← links)
• Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
• The quality of equilibria for set packing and throughput scheduling games (Q2178650) (← links)
• Scheduling split intervals with non-uniform demands (Q2218651) (← links)
• Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143) (← links)
• Minimizing the number of tardy jobs in two-machine settings with common due date (Q2410033) (← links)
• AFSCN scheduling: how the problem and solution have evolved (Q2473179) (← links)
• Grasp and delivery for moving objects on broken lines (Q2481562) (← links)
• On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
• Primal-dual approximation algorithms for a packing-covering pair of problems (Q3148377) (← links)
• On Lagrangian Relaxation and Subset Selection Problems (Q3602837) (← links)
• Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics (Q3652225) (← links)
• Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization (Q5130573) (← links)
• Throughput scheduling with equal additive laxity (Q5918523) (← links)
• Cost-sharing games in real-time scheduling systems (Q5918882) (← links)
• Cost-sharing games in real-time scheduling systems (Q5925633) (← links)
• Throughput scheduling with equal additive laxity (Q5925675) (← links)
• (Q6065401) (← links)
• Maximizing Throughput in Flow Shop Real-Time Scheduling (Q6084409) (← links)
• Approximations for Throughput Maximization (Q6492088) (← links)
• Scheduling-location problem with drones (Q6495369) (← links)