Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
From MaRDI portal
Publication:2288971
Recommendations
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Minimizing total weighted flow time of a set of jobs with interval processing times
- A robust identical parallel machine scheduling model based on min-max regret criterion
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
Cites work
- scientific article; zbMATH DE number 3092982 (Why is no real title available?)
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- A survey of the state-of-the-art of common due date assignment and scheduling research
- An overview of bilevel optimization
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minimizing total weighted flow time of a set of jobs with interval processing times
- Minmax scheduling problems with a common due-window
- On scheduling around large restrictive common due windows
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Pinpointing the complexity of the interval min-max regret knapsack problem
- Project scheduling under uncertainty: survey and research potentials
- Reducibility among combinatorial problems
- Robust discrete optimization and its applications
- Robust optimization
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- Scheduling algorithms
- Stochastic Scheduling with Release Dates and Due Dates
Cited in
(8)- Robust scheduling for minimizing maximum lateness on a serial-batch processing machine
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- Minimizing total weighted flow time of a set of jobs with interval processing times
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
- A robust identical parallel machine scheduling model based on min-max regret criterion
- Complexity results for common due date scheduling problems with interval data and minmax regret criterion
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
This page was built for publication: Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288971)
