Pages that link to "Item:Q1626771"

The following pages link to A \(O(n\log ^2 n)\) checker and \(O(n^2\log n)\) filtering algorithm for the energetic reasoning (Q1626771):

Displaying 7 items.

• Two deadline reduction algorithms for scheduling dependent tasks on parallel processors (Q2117220) (← links)
• A MinCumulative resource constraint (Q2170208) (← links)
• An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem (Q2184136) (← links)
• Horizontally elastic edge-finder algorithm for cumulative resource constraint revisited (Q2677344) (← links)
• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008) (← links)
• Algorithms to compute the energetic lower bounds of the cumulative scheduling problem (Q6581391) (← links)
• Measuring the slack between lower bounds for scheduling on parallel machines (Q6588485) (← links)