Evolutionary Algorithm for Minmax Regret Flow-Shop Problem

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 heuris...

Full description

Saved in:
Bibliographic Details
Published in:Management and Production Engineering Review 2015-09, Vol.6 (3), p.3-9
Main Authors: Cwik, Michal, Józefczyk, Jerzy
Format: Article
Language:English
Subjects:
evolutionary algorithms
flow-shop
heuristic algorithms
interval uncertainty
manufacturing
minmax regret
simulation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2082-1344
2080-8208
2082-1344
DOI:10.1515/mper-2015-0021