Pages that link to "Item:Q1946412"

The following pages link to A special case of the single-machine total tardiness problem is NP-hard (Q1946412):

Displaying 8 items.

• Single machine scheduling problems with financial resource constraints: some complexity results and properties (Q554491) (← links)
• Algorithms for some maximization scheduling problems on a single machine (Q612210) (← links)
• Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem (Q732689) (← links)
• A note on a single machine scheduling problem with generalized total tardiness objective function (Q763495) (← links)
• A hybrid algorithm for the single-machine total tardiness problem (Q954025) (← 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)
• Metric approach for finding approximate solutions of scheduling problems (Q2048806) (← links)