On the robust single machine scheduling problem
From MaRDI portal
Recommendations
- Algorithms and complexity analysis for robust single-machine scheduling problems
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Robust scheduling with budgeted uncertainty
- A robust approach for the single machine scheduling problem
- Single machine scheduling with scenarios
Cited in
(55)- Approximating Single Machine Scheduling with Scenarios
- Robust scheduling for minimizing maximum lateness on a serial-batch processing machine
- Recoverable robust single machine scheduling with polyhedral uncertainty
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty
- Minimizing value-at-risk in single-machine scheduling
- Distributionally robust scheduling on parallel machines under moment uncertainty
- Exact algorithms for distributionally \(\beta \)-robust machine scheduling with uncertain processing times
- Target-oriented robust satisficing models for the single machine scheduling problems with release time
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- Total completion time scheduling under scenarios
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Robust single machine makespan scheduling with release date uncertainty
- Minimizing the weighted sum of completion times under processing time uncertainty
- Distributionally robust single machine scheduling with the total tardiness criterion
- Distributionally robust single machine scheduling with risk aversion
- Optimality region for job permutation in single-machine scheduling with uncertain processing times
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
- Single machine scheduling problem with interval processing times and total completion time objective
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times
- Measures of problem uncertainty for scheduling with interval processing times
- Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- Single machine scheduling with scenarios
- A state-of-the-art survey on multi-scenario scheduling
- Comparing deterministic, robust and online scheduling using entropy
- Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
- Robust scheduling on a single machine to minimize total flow time
- Minimizing total weighted completion time with uncertain data: a stability approach
- An approximation scheme for the bi-scenario sum of completion times trade-off problem
- Algorithms and complexity analysis for robust single-machine scheduling problems
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- A family of inequalities valid for the robust single machine scheduling polyhedron
- Study on the scheduling of robustness with interval perturbation
- Total completion time scheduling under scenarios
- Just-in-time scheduling under scenario-based uncertainty
- Min-max relative regret for scheduling to minimize maximum lateness
- Robust scheduling with budgeted uncertainty
- Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems
- Minimizing total weighted flow time of a set of jobs with interval processing times
- Robust single machine scheduling with a flexible maintenance activity
- Fifty years of research in scheduling -- theory and applications
- A robust approach for the single machine scheduling problem
- Min-max relative regret for scheduling to minimize maximum lateness
- Scheduling in multi-scenario environment with an agreeable condition on job processing times
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
- A robustness measure of the configuration of multi-purpose machines
- Parameterized multi-scenario single-machine scheduling problems
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry
- Target-based distributionally robust optimization for single machine scheduling
- Predictive-reactive scheduling on a single resource with uncertain future jobs
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- Uncertainty measure for the Bellman-Johnson problem with interval processing times
This page was built for publication: On the robust single machine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702347)
