Single machine scheduling problems with uncertain parameters and the OWA criterion
From MaRDI portal
(Redirected from Publication:282249)
Abstract: In this paper a class of single machine scheduling problems is discussed. It is assumed that job parameters, such as processing times, due dates, or weights are uncertain and their values are specified in the form of a discrete scenario set. The Ordered Weighted Averaging (OWA) aggregation operator is used to choose an optimal schedule. The OWA operator generalizes traditional criteria in decision making under uncertainty, such as the maximum, average, median or Hurwicz criterion. It also allows us to extend the robust approach to scheduling by taking into account various attitudes of decision makers towards the risk. In this paper a general framework for solving single machine scheduling problems with the OWA criterion is proposed and some positive and negative computational results for two basic single machine scheduling problems are provided.
Recommendations
- Complexity of single machine scheduling problems under scenario-based uncertainty
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
- An uncertain programming model for single machine scheduling problem with batch delivery
- scientific article; zbMATH DE number 1539056
- Single machine scheduling to minimize the number of late jobs under uncertainty.
- Single machine robust scheduling with budgeted uncertainty
- Uncertain single-machine scheduling with deterioration and learning effect
- Single machine scheduling under market uncertainty
- Optimality region for job permutation in single-machine scheduling with uncertain processing times
- Complexity of single machine, multi-criteria scheduling problems
Cites work
- scientific article; zbMATH DE number 3137856 (Why is no real title available?)
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 1979522 (Why is no real title available?)
- scientific article; zbMATH DE number 876684 (Why is no real title available?)
- A family of inequalities valid for the robust single machine scheduling polyhedron
- An algorithm for the single machine sequencing problem with precedence constraints
- Approximating the min-max (regret) selecting items problem
- Complexity of Scheduling under Precedence Constraints
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Computing improved optimal solutions to max-min flexible constraint satisfaction problems
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- Improved polynomial algorithms for robust bottleneck problems with interval data
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- Minimizing the number of late jobs on a single machine under due date uncertainty
- On approximation algorithms for the minimum satisfiability problem
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- On solving linear programs with the ordered weighted averaging objective.
- On the complexity of a class of combinatorial optimization problems with uncertainty
- On the robust single machine scheduling problem
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Robust discrete optimization and its applications
- Scheduling algorithms
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
- Single machine scheduling with scenarios
- The Minimum Satisfiability Problem
Cited in
(14)- A state-of-the-art survey on multi-scenario scheduling
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times
- Risk-averse single machine scheduling: complexity and approximation
- An approximation scheme for the bi-scenario sum of completion times trade-off problem
- Total completion time scheduling under scenarios
- Robust single machine scheduling problem with weighted number of late jobs criterion
- Bin packing problem with scenarios
- Parallel machine scheduling under uncertainty
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
- Parameterized multi-scenario single-machine scheduling problems
- Application of the interpolation approach for approximating single-machine scheduling problem with an unknown objective function
- Risk averse scheduling with scenarios
- Minimizing worst-case and average-case makespan over scenarios
This page was built for publication: Single machine scheduling problems with uncertain parameters and the OWA criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q282249)
