Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
From MaRDI portal
Publication:2294353
DOI10.1016/j.orl.2019.08.002zbMath1476.90112OpenAlexW2969140035WikidataQ127371655 ScholiaQ127371655MaRDI QIDQ2294353
Myoung-Ju Park, Byung-Cheon Choi, Yunhong Min
Publication date: 10 February 2020
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2019.08.002
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
A single machine scheduling with generalized and periodic due dates to minimize total deviation ⋮ 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 ⋮ Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty ⋮ Scheduling with generalized and periodic due dates under single- and two-machine environments
Cites Work
- Unnamed Item
- On the complexity of generalized due date scheduling problems
- Single machine scheduling with assignable due dates
- Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
- Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates
- Scheduling with Fixed Delivery Dates
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals
This page was built for publication: Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
