Unary NP-hardness of minimizing total weighted tardiness with generalized due dates

DOI10.1016/j.orl.2015.12.006zbMath1408.90128OpenAlexW2191379429MaRDI QIDQ1785477

Jinjiang Yuan, Yuan Gao

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.12.006

zbMATH Keywords

single machine schedulingtotal weighted tardinessgeneralized due datesunary NP-hard

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items

A single machine scheduling with generalized and periodic due dates to minimize total deviation, Single machine scheduling with rejection and generalized parameters, Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals, Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty, Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity, Order acceptance and scheduling with delivery under generalized parameters, Strong NP-hardness of minimizing total deviation with generalized and periodic due dates, Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty, Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates, On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates, Scheduling with generalized and periodic due dates under single- and two-machine environments

Cites Work

• On the complexity of generalized due date scheduling problems
• Single machine scheduling with assignable due dates
• Minimizing Total Tardiness on One Machine is NP-Hard
• Unnamed Item
• Unnamed Item
• Unnamed Item