Scheduling with generalized and periodic due dates under single- and two-machine environments

DOI10.1007/S11590-021-01739-8zbMath1489.90023OpenAlexW3153589277MaRDI QIDQ2115317

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

Publication date: 15 March 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01739-8

zbMATH Keywords

computational complexityschedulingcommon due dategeneralized due datesperiodic due dates

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of generalized due date scheduling problems
• Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
• Scheduling shops 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
• Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
• Optimal two- and three-stage production schedules with setup times included
• 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
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals
• Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems

This page was built for publication: Scheduling with generalized and periodic due dates under single- and two-machine environments