Pages that link to "Item:Q596446"

The following pages link to Maximization problems in single machine scheduling (Q596446):

Displaying 7 items.

• Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization (Q256707) (← links)
• 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)
• Mirror scheduling problems with early work and late work criteria (Q2066692) (← links)
• Two-dedicated-machine scheduling problem with precedence relations to minimize makespan (Q2448211) (← links)