Worst‐case allocation algorithms in a complex of operations with interval parameters

DOI10.1108/03684920810873281zbMath1274.90175OpenAlexW2076234827MaRDI QIDQ3639401

Jerzy Józefczyk

Publication date: 30 October 2009

Published in: Kybernetes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/03684920810873281

zbMATH Keywords

decision makingoptimized production scheduling

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Unnamed Item
• Unnamed Item
• Minmax regret solutions for minimax optimization problems with uncertainty
• Stochastic programming approaches to stochastic scheduling
• Toward a generalized theory of uncertainty (GTU) -- an outline
• Stochastic scheduling problems II-set strategies-
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• Scheduling tasks on moving executors to minimise the maximum lateness

This page was built for publication: Worst‐case allocation algorithms in a complex of operations with interval parameters