Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
type: Item
instance of: scholarly article
title: Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
zbMATH Open document ID: 1390.90308
author: Michał Ćwik
author: Jerzy Józefczyk
published in: CEJOR. Central European Journal of Operations Research
publication date: 2018-06-15T00:00:00Z
full work available at URL: pmc5767222
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 6890258
zbMATH Keywords: flow-shop
zbMATH Keywords: interval processing times
zbMATH Keywords: minmax regret
zbMATH Keywords: heuristic algorithms
zbMATH Keywords: computational experiments
MaRDI profile type: Publication
OpenAlex ID: W2740701740
Wikidata QID: Q47555795
cites work: Uncertainty Modeling and Analysis in Engineering and the Sciences
cites work: Complexity of the min-max and min-max regret assignment problems
cites work: Algorithms – ESA 2005
cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey
cites work: Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
cites work: The minmax regret permutation flow-shop problem with two jobs
cites work: Exact and heuristic algorithms for the interval data robust assignment problem
cites work: Handbook on Scheduling
cites work: Analysis and decision making in uncertain systems.
cites work: A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
cites work: Benchmarks for shop scheduling problems
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: MILP models for the optimization of real production lines
cites work: Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
cites work: Q5501010
cites work: Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria
cites work: Discrete optimization with interval data. Minmax regret and fuzzy approach
cites work: Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
cites work: A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
cites work: Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
cites work: Algorithms for robust single and multiple period layout planning for manufacturing systems
cites work: Robust discrete optimization and its applications
cites work: Uncertainty and information: foundations of generalized information theory.
cites work: Optimal makespan scheduling with given bounds of processing times
cites work: Robust Optimization of Large-Scale Systems
cites work: Schedule execution for two-machine flow-shop with interval processing times
cites work: TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES
cites work: Scheduling
cites work: Q3964013
cites work: Robustness in operational research and decision aiding: a multi-faceted issue
cites work: The Theory of Statistical Decision
cites work: Benchmarks for basic scheduling problems
cites work: On ordered weighted averaging aggregation operators in multicriteria decisionmaking
DBLP publication ID: journals/cejor/CwikJ18
DOI: 10.1007/S10100-017-0485-8
description: scientific article; zbMATH DE number 6890258