Pages that link to "Item:Q5890508"

The following pages link to Bounding the running time of algorithms for scheduling and packing problems (Q5890508):

Displaying 10 items.

• On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303) (← links)
• Exact algorithms for allocation problems (Q777301) (← links)
• Tight approximations for resource constrained scheduling and bin packing (Q1372745) (← links)
• On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
• Complexity of Grundy coloring and its variants (Q1752449) (← links)
• Scheduling lower bounds via AND subset sum (Q2121467) (← links)
• On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (Q2161009) (← links)
• Non-preemptive scheduling in a smart grid model and its implications on machine minimization (Q2211351) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• (Q6068263) (← links)