Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
From MaRDI portal
Publication:1642853
DOI10.1007/s10100-017-0485-8zbMath1390.90308OpenAlexW2740701740WikidataQ47555795 ScholiaQ47555795MaRDI QIDQ1642853
Publication date: 15 June 2018
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc5767222
Minimax problems in mathematical programming (90C47) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem ⋮ Exact solutions for the two-machine robust flow shop with budgeted uncertainty ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry
Cites Work
- Unnamed Item
- Unnamed Item
- MILP models for the optimization of real production lines
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Exact and heuristic algorithms for the interval data robust assignment problem
- Complexity of the min-max and min-max regret assignment problems
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robustness in operational research and decision aiding: a multi-faceted issue
- Algorithms for robust single and multiple period layout planning for manufacturing systems
- Benchmarks for shop scheduling problems
- Robust discrete optimization and its applications
- Optimal makespan scheduling with given bounds of processing times
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
- Analysis and decision making in uncertain systems.
- Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria
- Benchmarks for basic scheduling problems
- Schedule execution for two-machine flow-shop with interval processing times
- Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
- The minmax regret permutation flow-shop problem with two jobs
- Uncertainty and Information
- TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- The Complexity of Flowshop and Jobshop Scheduling
- Robust Optimization of Large-Scale Systems
- Algorithms – ESA 2005
- Uncertainty Modeling and Analysis in Engineering and the Sciences
- Handbook on Scheduling
- The Theory of Statistical Decision
- Scheduling
This page was built for publication: Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
