On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty

2020 ◽  
Vol 23 (6) ◽  
pp. 745-749
Author(s):  
Yakov Shafransky ◽  
Viktor Shinkarevich
Keyword(s):  
Flow Shop ◽  
Interval Uncertainty ◽  
Minmax Regret ◽  
Flow Shop Problem

scholarly journals Evolutionary Algorithm for Minmax Regret Flow-Shop Problem

2015 ◽  
Vol 6 (3) ◽  
pp. 3-9 ◽  
Author(s):  
Michał Ćwik ◽  
Jerzy Józefczyk
Keyword(s):  
Heuristic Algorithm ◽  
Optimization Problem ◽  
Flow Shop ◽  
A Priori ◽  
Solution Algorithm ◽  
Not Given ◽  
Heuristic Solution ◽  
Processing Times ◽  
Minmax Regret ◽  
Flow Shop Problem

Abstract The uncertain flow-shop is considered. It is assumed that processing times are not given a priori, but they belong to intervals of known bounds. The absolute regret (regret) is used to evaluate a solution (a schedule) which gives the minmax regret binary optimization problem. The evolutionary heuristic solution algorithm is experimentally compared with a simple middle interval heuristic algorithm for three machines instances. The conducted simulations confirmed the several percent advantage of the evolutionary approach.

A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty

2021 ◽  
Author(s):  
Iago A. Carvalho ◽  
Thiago F. Noronha ◽  
Christophe Duhamel ◽  
Luiz F. M. Vieira ◽  
Vinicius F. dos Santos
Keyword(s):  
Shortest Path ◽  
Interval Uncertainty ◽  
Minmax Regret

scholarly journals Batch Scheduling In A Two-Stage Flexible Flow Shop Problem

2014 ◽  
Vol 39 (1) ◽  
pp. 3-16 ◽  
Author(s):  
Enrique Gerstl ◽  
Gur Mosheiov ◽  
Assaf Sarig
Keyword(s):  
Flow Shop ◽  
Optimal Solution ◽  
Setup Time ◽  
Optimal Number ◽  
Two Stage ◽  
Second Stage ◽  
Flow Shop Problem ◽  
Batch Sizes ◽  
Batch Schedule ◽  
Identical Jobs

Abstract We study a special two-stage flexible flowshop, which consists of several parallel identical machines in the first stage and a single machine in the second stage. We assume identical jobs, and the option of batching, with a required setup time prior to the processing of a new batch. We also consider the option to use only a subset of the available machines. The objective is minimum makespan. A unique optimal solution is introduced, containing the optimal number of machines to be used, the sequence of batch sizes, and the batch schedule. The running time of our proposed solution algorithm is independent of the number of jobs, and linear in the number of machines

scholarly journals Approximations for the Two-Machine Cross-Docking Flow Shop Problem

2013 ◽  
Vol 161 (13-14) ◽  
pp. 2107-2119 ◽  
Author(s):  
D. Prot ◽  
C. Rapine
Keyword(s):  
Flow Shop ◽  
Cross Docking ◽  
Flow Shop Problem
Sign in / Sign up

Export Citation Format

Share Document