Pages that link to "Item:Q1785477"
From MaRDI portal
The following pages link to Unary NP-hardness of minimizing total weighted tardiness with generalized due dates (Q1785477):
Displaying 15 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)
- Single machine scheduling with rejection and generalized parameters (Q2149874) (← links)
- Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines (Q2286436) (← links)
- Strong NP-hardness of minimizing total deviation with generalized and periodic due dates (Q2294353) (← links)
- Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates (Q2352264) (← links)
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines (Q2398650) (← links)
- Minimizing Total Tardiness on One Machine is NP-Hard (Q3200872) (← links)
- Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals (Q4561184) (← links)
- Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates (Q5216799) (← 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)
- Order acceptance and scheduling with delivery under generalized parameters (Q6179281) (← links)
