Pages that link to "Item:Q1806342"

The following pages link to Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342):

Displaying 2 items.

• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• The \(C^{\max}\) problem of scheduling multiple groups of jobs on multiple processors at different speeds (Q1953222) (← links)