Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty

DOI10.1007/s10878-021-00714-4zbMath1473.90067OpenAlexW3133745779MaRDI QIDQ2045022

Byung-Cheon Choi, Myoung-Ju Park

Publication date: 11 August 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00714-4

zbMATH Keywords

computational complexitysingle-machine schedulinggeneralized due dates

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• On the complexity of generalized due date scheduling problems
• A note on the SPT heuristic for solving scheduling problems with generalized due dates
• Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
• On the fixed interval due-date scheduling problem
• Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
• Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates
• Scheduling jobs on parallel machines to minimize a regular step total cost function
• Faster algorithms for the shortest path problem
• 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
• Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals
• Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty