loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Jerzy Józefczyk and Michał Ćwik

Affiliation: Wroclaw University of Technology, Poland

Keyword(s): Decision Making, Optimization, Uncertainty, Interval Data, Minmax Regret, Heuristic Algorithms.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Computational Intelligence ; Evolutionary Computing ; Soft Computing

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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 44.201.199.251

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 - COMPLEXIS; ISBN 978-989-758-181-6; ISSN 2184-5034, SciTePress, pages 119-127. DOI: 10.5220/0005874401190127

@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 - COMPLEXIS},
year={2016},
pages={119-127},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005874401190127},
isbn={978-989-758-181-6},
issn={2184-5034},
}

TY - CONF

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