Worst‐case allocation algorithms in a complex of operations with interval parameters
From MaRDI portal
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Production models (90B30) Deterministic scheduling theory in operations research (90B35) Management decision making, including multiple objectives (90B50) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Recommendations
- Worst-case relative regret algorithm for task allocation in complex operation system
- On allocation problems for a complex of parallel operations described by uncertain variables
- Resource allocation under uncertainty
- Application of C-uncertain variables and systemic approach to resource distribution in a class of operation systems
- Minmax regret linear resource allocation problems.
Cites work
- A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
- scientific article; zbMATH DE number 3595067 (Why is no real title available?)
- Minmax regret solutions for minimax optimization problems with uncertainty
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Scheduling tasks on moving executors to minimise the maximum lateness
- Stochastic programming approaches to stochastic scheduling
- Stochastic scheduling problems II-set strategies-
- Toward a generalized theory of uncertainty (GTU) -- an outline
- Worst-case relative regret algorithm for task allocation in complex operation system
Cited in
(6)- Scenario-based stochastic resource allocation with uncertain probability parameters
- On allocation problems for a complex of parallel operations described by uncertain variables
- Application of C-uncertain variables and systemic approach to resource distribution in a class of operation systems
- Decision making under uncertainty for a class of production systems with serial and parallel operations
- QoS rate allocation in computer networks under uncertainty
- Worst-case relative regret algorithm for task allocation in complex operation system
This page was built for publication: Worst‐case allocation algorithms in a complex of operations with interval parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3639401)