Pages that link to "Item:Q596446"
From MaRDI portal
The following pages link to Maximization problems in single machine scheduling (Q596446):
Displayed 4 items.
- Single machine total tardiness maximization problems: complexity and algorithms (Q367638) (← links)
- A generic approach to proving NP-hardness of partition type problems (Q608273) (← links)
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case (Q1046704) (← links)
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) (← links)