Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
From MaRDI portal
Publication:6094564
Recommendations
- Complexity of single machine scheduling problems under scenario-based uncertainty
- A single machine scheduling with generalized and periodic due dates to minimize total deviation
- Minimizing the number of late jobs on a single machine under due date uncertainty
- Single machine scheduling to minimize the number of late jobs under uncertainty.
- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
- Scheduling with generalized and periodic due dates under single- and two-machine environments
- Minimizing The Range Of Lateness On A Single Machine Under Generalized Due Dates
- Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval
- Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed
Cites work
- scientific article; zbMATH DE number 4172724 (Why is no real title available?)
- scientific article; zbMATH DE number 4099021 (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?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
- A contribution to the stochastic flow shop scheduling problem.
- A fuzzy robust scheduling approach for product development projects.
- A note on the SPT heuristic for solving scheduling problems with generalized due dates
- Complexity of single machine scheduling problems under scenario-based uncertainty
- On the complexity of generalized due date scheduling problems
- On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops
- Risk-averse single machine scheduling: complexity and approximation
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Scheduling with Fixed Delivery Dates
- Scheduling with a position-weighted learning effect and job release dates
- Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
- Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
Cited in
(4)- Scheduling problems on parallel machines with machine-dependent generalized due-dates
- Minimizing the number of late jobs on a single machine under due date uncertainty
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
- A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty
This page was built for publication: Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094564)
