Pages that link to "Item:Q612210"

The following pages link to Algorithms for some maximization scheduling problems on a single machine (Q612210):

Displaying 12 items.

• Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization (Q256707) (← links)
• Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
• Single machine total tardiness maximization problems: complexity and algorithms (Q367638) (← links)
• Maximization problems in single machine scheduling (Q596446) (← links)
• Approximability results for the resource-constrained project scheduling problem with a single type of resources (Q744638) (← links)
• Improved algorithms for two single machine scheduling problems (Q860871) (← links)
• Approximation algorithms for inventory constrained scheduling on a single machine (Q906561) (← links)
• The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
• Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) (← links)
• A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine (Q2294390) (← links)
• (Q3607606) (← links)
• (Q4528340) (← links)