Cyclic scheduling line with uncertain data

9Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, a cyclic permutation flow shop problem for a certain production line with uncertain data is considered. The goal is to minimize the cycle time. The uncertain elements in the system are identified and modeled as fuzzy numbers. A metaheuristic fuzzy-aware algorithm is developed and tested against 3 deterministic algorithms. The fuzzy algorithm significantly outperforms deterministic algorithms 70% of the time with similar computation time. The fuzzy algorithm is also more reliable, providing solutions with smaller standard deviation.

Cite

CITATION STYLE

APA

Rudy, J. (2016). Cyclic scheduling line with uncertain data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9692, pp. 311–320). Springer Verlag. https://doi.org/10.1007/978-3-319-39378-0_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free