A single machine scheduling with generalized and periodic due dates to minimize total deviation

DOI10.1016/J.DAM.2022.03.002MaRDI QIDQ2127609zbMATH OpenOpenAlexFDO

Authors Byung-Cheon Choi, Kyung Min Kim, Yunhong Min, Myoung-Ju Park

Publication date 20 April 2022

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2022.03.002

zbMATH Keywords

computational complexityschedulinggeneralized due dates

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty
• Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
• Scheduling with generalized and periodic due dates under single- and two-machine environments
• Just-in-time scheduling with generalized due dates and identical due date intervals
• Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates

Cites work

• scientific article; zbMATH DE number 4172724 (Why is no real title available?)
• scientific article; zbMATH DE number 2139462 (Why is no real title available?)
• A note on the SPT heuristic for solving scheduling problems with generalized due 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
• Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine
• On the complexity of generalized due date scheduling problems
• Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs
• 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
• Unary NP-hardness of minimizing total weighted tardiness with generalized due dates

Cited in

(7)

• Minimizing total completion time and total deviation of job completion times from a restrictive due-date
• Just-in-time scheduling with generalized due dates and identical due date intervals
• 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
• Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates
• Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
• Scheduling a single machine with multiple due dates per job

This page was built for publication: A single machine scheduling with generalized and periodic due dates to minimize total deviation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127609)