We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
EVOLUTIONARY ALGORITHM FOR MINMAX REGRET FLOW-SHOP PROBLEM.
- Authors
Ćwik, Michał; Józefczyk, Jerzy
- 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.
- Subjects
FLOW shops; MAXIMA &; minima; MATHEMATICAL optimization; EVOLUTIONARY algorithms; HEURISTIC algorithms
- Publication
Management & Production Engineering Review (MPER), 2015, Vol 6, Issue 3, p3
- ISSN
2080-8208
- Publication type
Article
- DOI
10.1515/mper-2015-0021