Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
From MaRDI portal
Publication:4849349
DOI10.1287/mnsc.41.2.363zbMath0832.90050OpenAlexW1965367276MaRDI QIDQ4849349
Panagiotis Kouvelis, Richard L. Daniels
Publication date: 25 September 1995
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.41.2.363
Related Items (80)
Optimality region for job permutation in single-machine scheduling with uncertain processing times ⋮ Investigating the recoverable robust single machine scheduling problem under interval uncertainty ⋮ Distributionally robust single machine scheduling with the total tardiness criterion ⋮ Scheduling for stability in single-machine production systems ⋮ Executing production schedules in the face of uncertainties: a review and some future directions ⋮ Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty ⋮ Scheduling under linear constraints ⋮ A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data ⋮ Setting optimal due dates in a basic safe-scheduling model ⋮ A robustness approach to international sourcing ⋮ Schedule execution for two-machine flow-shop with interval processing times ⋮ 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 ⋮ Robust single machine makespan scheduling with release date uncertainty ⋮ Robust optimization models for project scheduling with resource availability cost ⋮ Minimizing total weighted completion time with uncertain data: a stability approach ⋮ Robust scheduling with budgeted uncertainty ⋮ Minimizing conditional-value-at-risk for stochastic scheduling problems ⋮ Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times ⋮ Stability polyhedra of optimal permutation of jobs servicing ⋮ Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty ⋮ Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ Single machine scheduling with release dates: a distributionally robust approach ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Parameterized multi-scenario single-machine scheduling problems ⋮ Single machine robust scheduling with budgeted uncertainty ⋮ Robust multi-market newsvendor models with interval demand data ⋮ Algorithms and complexity analysis for robust single-machine scheduling problems ⋮ A fuzzy robust scheduling approach for product development projects. ⋮ Complexity of minimizing the total flow time with interval data and minmax regret criterion ⋮ Approximating a two-machine flow shop scheduling under discrete scenario uncertainty ⋮ On a constant factor approximation for minmax regret problems using a symmetry point scenario ⋮ An online approach to dynamic rescheduling for production planning applications ⋮ 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 ⋮ A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion ⋮ Meta-heuristics for stable scheduling on a single machine ⋮ A methodology to create robust job rotation schedules ⋮ Minimizing value-at-risk in single-machine scheduling ⋮ Distributionally robust scheduling on parallel machines under moment uncertainty ⋮ A single-machine scheduling problem with uncertainty in processing times and outsourcing costs ⋮ Distributionally robust single machine scheduling with risk aversion ⋮ Scheduling with uncertainties on new computing platforms ⋮ 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 ⋮ The complexity of machine scheduling for stability with a single disrupted job ⋮ Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion ⋮ Reexamination of processing time uncertainty ⋮ Project scheduling under uncertainty: survey and research potentials ⋮ A survey of dynamic scheduling in manufacturing systems ⋮ A family of inequalities valid for the robust single machine scheduling polyhedron ⋮ Self-imposed time windows in vehicle routing problems ⋮ Comparing deterministic, robust and online scheduling using entropy ⋮ Risk Averse Scheduling with Scenarios ⋮ A 2-approximation for minmax regret problems via a mid-point scenario optimal solution ⋮ Single machine scheduling problem with interval processing times and total completion time objective ⋮ Risk-averse single machine scheduling: complexity and approximation ⋮ Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty ⋮ Related machine scheduling with machine speeds satisfying linear constraints ⋮ Approximation results for makespan minimization with budgeted uncertainty ⋮ Stochastic single machine scheduling problem as a multi-stage dynamic random decision process ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey ⋮ Computing and minimizing the relative regret in combinatorial optimization with interval data ⋮ Modeling and Managing Uncertainty in Process Planning and Scheduling ⋮ Worst‐case allocation algorithms in a complex of operations with interval parameters ⋮ Optimally rescheduling jobs with a last-in-first-out buffer ⋮ 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 ⋮ A heuristic to minimax absolute regret for linear programs with interval objective function coefficients ⋮ The minmax regret permutation flow-shop problem with two jobs ⋮ An adaptive robust optimization model for parallel machine scheduling ⋮ Using real time information for effective dynamic scheduling
This page was built for publication: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
