Pages that link to "Item:Q1635503"

The following pages link to On the optimality of exact and approximation algorithms for scheduling problems (Q1635503):

Displaying 44 items.

• Reducing the solution space of optimal task scheduling (Q336912) (← links)
• On the computational complexity of (maximum) shift class scheduling (Q684343) (← links)
• Exact algorithms for allocation problems (Q777301) (← links)
• Necessary and sufficient conditions of optimality for some classical scheduling problems (Q852941) (← links)
• Scheduling and fixed-parameter tractability (Q896271) (← links)
• Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
• Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques (Q1283915) (← links)
• Special issue: Efficient scheduling algorithms. 6 papers from ESA 2000 and APPROX 2000, both in Saarbrücken, Germany, September 5--8, 2000 (Q1348734) (← links)
• Efficient algorithms for a scheduling problem and its applications to illicit drug market crackdowns (Q1383799) (← links)
• Optimal randomized scheduling by replacement (Q1383803) (← links)
• Exact and approximation algorithms for the operational fixed interval scheduling problem (Q1388883) (← links)
• Extending Graham's result on scheduling to other heuristics (Q1604040) (← links)
• Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system (Q1652207) (← links)
• An exact algorithm for the bi-objective timing problem (Q1653286) (← links)
• Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
• Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203) (← links)
• A probe-based algorithm for piecewise linear optimization in scheduling (Q1861934) (← links)
• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time (Q1885337) (← links)
• An algebraic geometry algorithm for scheduling in presence of setups and correlated demands (Q1906277) (← links)
• A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay (Q2069704) (← links)
• Scheduling lower bounds via AND subset sum (Q2121467) (← links)
• Optimal algorithms for scheduling under time-of-use tariffs (Q2241552) (← links)
• Improved approximation algorithms for the combination problem of parallel machine scheduling and path (Q2331579) (← links)
• A unified framework for designing EPTAS for load balancing on parallel machines (Q2415372) (← links)
• On the extension complexity of scheduling polytopes (Q2661503) (← links)
• A survey of methods for the solution of problems of scheduling theory (Q2718206) (← links)
• An experimental study of LP-based approximation algorithms for scheduling problems (Q2890462) (← links)
• (Q2932933) (← links)
• (Q3142061) (← links)
• Closing the Gap for Makespan Scheduling via Sparsification Techniques (Q3387928) (← links)
• Tighter Approximation Bounds for LPT Scheduling in Two Special Cases (Q3434556) (← links)
• (Q3685556) (← links)
• On Approximation Algorithms for Two-Stage Scheduling Problems (Q4632219) (← links)
• (Q4866348) (← links)
• The Complexity of Scheduling for p-Norms of Flow and Stretch (Q4910823) (← links)
• (Q5077804) (← links)
• Approximately Supermodular Scheduling Subject to Matroid Constraints (Q5090799) (← links)
• (Q5128459) (← links)
• Time optimal linear schedules for algorithms with uniform dependencies (Q5375403) (← links)
• An empirical analysis of algorithms for partially Clairvoyant scheduling (Q5421611) (← links)
• (Q5501328) (← links)
• Bounding the running time of algorithms for scheduling and packing problems (Q5890508) (← links)
• Approximation algorithms for scheduling with reservations (Q5961975) (← links)
• Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines (Q6065415) (← links)