2017
DOI: 10.1007/s10100-017-0485-8
|View full text |Cite
|
Sign up to set email alerts
|

Heuristic algorithms for the minmax regret flow-shop problem with interval processing times

Abstract: An uncertain version of the permutation flow-shop with unlimited buffers and the makespan as a criterion is considered. The investigated parametric uncertainty is represented by given interval-valued processing times. The maximum regret is used for the evaluation of uncertainty. Consequently, the minmax regret discrete optimization problem is solved. Due to its high complexity, two relaxations are applied to simplify the optimization procedure. First of all, a greedy procedure is used for calculating the crite… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 42 publications
0
5
0
Order By: Relevance
“…Before discussing our research, we will focus on dataset creation. Practical methods for generating hard instances refer mainly to interval processing times [24], [25], [26]. Only [19] describes how to create a dataset for the robust problem with interval release dates.…”
Section: Computational Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Before discussing our research, we will focus on dataset creation. Practical methods for generating hard instances refer mainly to interval processing times [24], [25], [26]. Only [19] describes how to create a dataset for the robust problem with interval release dates.…”
Section: Computational Resultsmentioning
confidence: 99%
“…Each interval is constrained such that 5), where the term r − j + avg j * of f set j prevents from unreasonable long intervals. To avoid (23) and (24), we divide the timeline into w consecutive and disjoint time segments and generate at least ⌊n/w⌋ release date intervals within each segment. Clearly, a value of w defines the intervals density.…”
Section: Computational Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…In the same year, Ćwik & Józefczyk (2015) proposed an evolutionary algorithm for the minimax regret makespan robust flow shop with three machines, assuming processing times belonged to known intervals. Later, the same authors proposed another solution approach for an arbitrary number of machines ( Ćwik & Józefczyk, 2018), where a constructive algorithm based on the Nawaz-Enscore-Ham (NEH) heuristic (Nawaz et al, 1983) has been introduced and experimentally evaluated against two other heuristic algorithms: the authors' evolutionary algorithm and a Middle Interval heuristic.…”
Section: Robust Optimizationmentioning
confidence: 99%
“…In this work, the objective interval is converted into a deterministic real value through dynamically weighting [21]. Ćwik and Józefczyk [41] adopted interval-valued processing times to represent the uncertain parameters used the lower bound instead of solving the internal deterministic flow-shop, and employed the maximum regret to evaluate the uncertainty. For the single machine scheduling problems with uncertain processing time, Allahverdi et al [42] addressed some heuristics based on the polynomial time using the values of the upper and lower bounds of processing time.…”
Section: Literature Review a Flow Shop And Job Shop Scheduling Pmentioning
confidence: 99%