Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Open access · Published 10 January 2019

Optimal Components Assignment Problem for Stochastic-Flow Networks

Abdellah Aissou1, Abdelhamid Daamouche2 & Moatamad Refaat Hassan3

Journal of Computer Science, Volume 15, Issue 1, pp. 108–117 · doi.org/10.3844/jcssp.2019.108.117

7,538 accesses4,020 downloads2 citations (Crossref)Metrics
Cite Check for updates

Abstract

Components assignment problem to maximize the network reliability in the case of each component has both an assignment cost and lead-time is never discussed. Therefore, this paper focuses on solving this problem under the above mentioned constraints. The presented problem is called an Optimal Components Assignment Problem (OCAP) and it is formulated based on three constraints namely total assignment cost, total lead-time and system reliability. Also, an approach based on a Random Weighted Genetic Algorithm (RWGA) is presented to solve the OCAP. The results revealed that an optimal components assignment leads to the maximum reliability, minimum assignment cost and minimum total lead-time using the proposed approach.

Licence and reuse

Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Aissou, A., Daamouche, A. & Hassan, M. R. (2019). Optimal Components Assignment Problem for Stochastic-Flow Networks. Journal of Computer Science, 15(1), 108–117. https://doi.org/10.3844/jcssp.2019.108.117

Licence
CC BY 3.0
Issue
Volume 15, Issue 1
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Optimal Components Assignment Problem for Stochastic-Flow NetworksJournal of Computer Science · Volume 15, Issue 1 · pp. 108–117 · CC BY 3.0Download