Pages that link to "Item:Q2489902"

The following pages link to Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902):

Displaying 31 items.

• A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling (Q283177) (← links)
• The corridor allocation problem (Q339697) (← links)
• A study of scheduling problems with preemptions on multi-core computers with GPU accelerators (Q499342) (← links)
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
• The feasibility of general task systems with precedence constraints on multiprocessor platforms (Q842732) (← links)
• Preemptive scheduling of interval orders is polynomial (Q913500) (← links)
• Preemptive scheduling and antichain polyhedra (Q1003473) (← links)
• Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling (Q1033671) (← links)
• A polynomial feasibility test for preemptive periodic scheduling of unrelated processors (Q1067785) (← links)
• A relation between multiprocessor scheduling and linear programming (Q1267552) (← links)
• Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay (Q1652451) (← links)
• Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
• The maximum common edge subgraph problem: A polyhedral investigation (Q1759826) (← links)
• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time (Q1885337) (← links)
• Optimal solutions for the double row layout problem (Q1940444) (← links)
• A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem (Q2239887) (← links)
• The maximum gain of increasing the number of preemptions in multiprocessor scheduling (Q2390934) (← links)
• Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut (Q2835686) (← links)
• Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra (Q2931828) (← links)
• Probabilistic analysis of scheduling precedence constrained parallel tasks on multicomputers with contiguous processor allocation (Q3417036) (← links)
• Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results (Q3598041) (← links)
• Single-Machine Scheduling Polyhedra with Precedence Constraints (Q3971735) (← links)
• (Q4473911) (← links)
• A new formulation for scheduling unrelated processor under precedence constraints (Q4511608) (← links)
• (Q4536380) (← links)
• Explicit Modelling of Multiple Intervals in a Constraint Generation Procedure for Multiprocessor Scheduling (Q4685812) (← links)
• Quasi-PTAS for scheduling with precedences using LP hierarchies (Q5002735) (← links)
• (Q5399877) (← links)
• Logic versus Approximation (Q5712371) (← links)
• Preemptive scheduling with dedicated processors: applications of fractional graph coloring (Q5920389) (← links)
• Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness (Q5961604) (← links)