Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
From MaRDI portal
Publication:6094564
DOI10.1080/0305215x.2021.2014477zbMath1523.90151OpenAlexW4224988205MaRDI QIDQ6094564
Kyung Min Kim, Byung-Cheon Choi, Myoung-Ju Park
Publication date: 10 October 2023
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2021.2014477
Minimax problems in mathematical programming (90C47) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of single machine scheduling problems under scenario-based uncertainty
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- On the complexity of generalized due date scheduling problems
- A fuzzy robust scheduling approach for product development projects.
- A contribution to the stochastic flow shop scheduling problem.
- 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
- Risk-averse single machine scheduling: complexity and approximation
- Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
- Scheduling with Fixed Delivery Dates
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Scheduling with a position-weighted learning effect and job release dates
- A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops
This page was built for publication: Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
