On the robust single machine scheduling problem
From MaRDI portal
Publication:702347
DOI10.1023/A:1013333232691zbMath1058.90029OpenAlexW1569805180MaRDI QIDQ702347
Publication date: 17 January 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013333232691
Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Stochastic scheduling theory in operations research (90B36)
Related Items (40)
Optimality region for job permutation in single-machine scheduling with uncertain processing times ⋮ Single machine scheduling problems with uncertain parameters and the OWA criterion ⋮ Investigating the recoverable robust single machine scheduling problem under interval uncertainty ⋮ Distributionally robust single machine scheduling with the total tardiness criterion ⋮ Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty ⋮ The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective ⋮ Measures of problem uncertainty for scheduling with interval processing times ⋮ Minimizing total weighted completion time with uncertain data: a stability approach ⋮ Robust scheduling with budgeted uncertainty ⋮ A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Parameterized multi-scenario single-machine scheduling problems ⋮ Min-max relative regret for scheduling to minimize maximum lateness ⋮ Algorithms and complexity analysis for robust single-machine scheduling problems ⋮ Approximating a two-machine flow shop scheduling under discrete scenario uncertainty ⋮ A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines ⋮ Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times ⋮ Uncertainty measure for the Bellman-Johnson problem with interval processing times ⋮ Robust single machine scheduling with a flexible maintenance activity ⋮ Complexity of single machine scheduling problems under scenario-based uncertainty ⋮ Minimizing the weighted sum of completion times under processing time uncertainty ⋮ Minimizing value-at-risk in single-machine scheduling ⋮ Distributionally robust scheduling on parallel machines under moment uncertainty ⋮ Distributionally robust single machine scheduling with risk aversion ⋮ Predictive-reactive scheduling on a single resource with uncertain future jobs ⋮ Minimizing total weighted flow time under uncertainty using dominance and a stability box ⋮ Robust scheduling on a single machine to minimize total flow time ⋮ Minimizing total weighted flow time of a set of jobs with interval processing times ⋮ A family of inequalities valid for the robust single machine scheduling polyhedron ⋮ Comparing deterministic, robust and online scheduling using entropy ⋮ An approximation scheme for the bi-scenario sum of completion times trade-off problem ⋮ Single machine scheduling problem with interval processing times and total completion time objective ⋮ Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty ⋮ Stochastic single machine scheduling problem as a multi-stage dynamic random decision process ⋮ Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability ⋮ Scheduling in multi-scenario environment with an agreeable condition on job processing times ⋮ JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY ⋮ Target-based distributionally robust optimization for single machine scheduling ⋮ A robust two-machine flow-shop scheduling model with scenario-dependent processing times
This page was built for publication: On the robust single machine scheduling problem
