Pages that link to "Item:Q2294353"

The following pages link to Strong NP-hardness of minimizing total deviation with generalized and periodic due dates (Q2294353):

Displaying 8 items.

• Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty (Q2045022) (← links)
• On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates (Q2093185) (← links)
• Scheduling with generalized and periodic due dates under single- and two-machine environments (Q2115317) (← links)
• A single machine scheduling with generalized and periodic due dates to minimize total deviation (Q2127609) (← links)
• Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates (Q2352264) (← links)
• Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard (Q2450667) (← links)
• Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty (Q6094564) (← links)
• Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity (Q6109346) (← links)