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

DOI10.1007/S11590-021-01739-8MaRDI QIDQ2115317zbMATHOpenAlexFDO

Authors Byung-Cheon Choi, Kyung Min Kim, Yunhong Min, 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)

Recommendations

• Two-machine ordered flow shop scheduling with generalized due dates
• scientific article; zbMATH DE number 4172724
• A single machine scheduling with generalized and periodic due dates to minimize total deviation
• On the complexity of generalized due date scheduling problems
• Just-in-time scheduling with generalized due dates and identical due date intervals

Cites work

• scientific article; zbMATH DE number 4172724 (Why is no real title available?)
• scientific article; zbMATH DE number 167292 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• 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
• On the complexity of generalized due date scheduling problems
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling shops to minimize the weighted number of late jobs
• Scheduling with Fixed Delivery Dates
• Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
• Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
• The Complexity of Flowshop and Jobshop Scheduling
• Two-machine ordered flow shop scheduling with generalized 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

(11)

• Just-in-time scheduling with generalized due dates and identical due date intervals
• scientific article; zbMATH DE number 4172724 (Why is no real title available?)
• Scheduling a single machine with multiple due dates per job
• A note on the SPT heuristic for solving scheduling problems with generalized due dates
• Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
• Scheduling with sub-jobs' due dates
• Two-machine ordered flow shop scheduling with generalized due dates
• Two due date assignment problems in scheduling a single machine
• A single machine scheduling with generalized and periodic due dates to minimize total deviation
• scientific article; zbMATH DE number 3914067 (Why is no real title available?)
• On the complexity of generalized due date scheduling problems

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

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