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

DOI10.1007/S11590-021-01739-8zbMATH Open1489.90023OpenAlexW3153589277MaRDI QIDQ2115317FDOQ2115317

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

Recommendations

• Two-machine ordered flow shop scheduling with generalized due dates
• scientific article
• 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

zbMATH Keywords

computational complexityschedulingcommon due dategeneralized due datesperiodic due dates

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Scheduling with Fixed Delivery Dates
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Optimal two- and three-stage production schedules with set-up time included
• The Complexity of Flowshop and Jobshop Scheduling
• Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
• On the complexity of generalized due date scheduling problems
• Title not available (Why is that?)
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Title not available (Why is that?)
• Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates
• Scheduling shops to minimize the weighted number of late jobs
• Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
• 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
• Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of generalized due date scheduling problems
• Two due date assignment problems in scheduling a single machine
• Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
• A note on the SPT heuristic for solving scheduling problems with generalized due dates

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)