Heuristic Algorithm for Uncertain Permutation Flow-shop Problem

Jerzy Józefczyk, Michał Ćwik

2016

Abstract

A complex population-based solution algorithm for an uncertain decision making problem is presented. The uncertain version of a permutation flow-shop problem with interval execution times is considered. The worst-case regret based on the makespan is used for the evaluation of permutations of tasks. The resulting complex minmax combinatorial optimization problem is solved. The heuristic algorithm is proposed which is based on the decomposition of the problem into three sequential sub-problems and employs a paradigm of evolutionary computing. The proposed algorithm solves the sub-problems sequentially. It is compared with the fast middle point heuristic algorithm via computer simulation experiments. The results show the usefulness of this heuristic algorithm for instances up to five machines.

Paper Citation

in Harvard Style

Józefczyk J. and Ćwik M. (2016). Heuristic Algorithm for Uncertain Permutation Flow-shop Problem . In Proceedings of the 1st International Conference on Complex Information Systems - Volume 1: COMPLEXIS, ISBN 978-989-758-181-6, pages 119-127. DOI: 10.5220/0005874401190127

in Bibtex Style

@conference{complexis16,
author={Jerzy Józefczyk and Michał Ćwik},
title={Heuristic Algorithm for Uncertain Permutation Flow-shop Problem},
booktitle={Proceedings of the 1st International Conference on Complex Information Systems - Volume 1: COMPLEXIS,},
year={2016},
pages={119-127},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005874401190127},
isbn={978-989-758-181-6},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 1st International Conference on Complex Information Systems - Volume 1: COMPLEXIS,
TI - Heuristic Algorithm for Uncertain Permutation Flow-shop Problem
SN - 978-989-758-181-6
AU - Józefczyk J.
AU - Ćwik M.
PY - 2016
SP - 119
EP - 127
DO - 10.5220/0005874401190127