A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...

NSGA methodology discussed in Section 3.1 suffers from three weaknesses: computational complexity, non-elitist approach and the need to specify a sharing parameter. An improved version of NSGA known as NSGA-II, which resolved the above problems and uses elitism to create a diverse Pareto-optimal front, has been subsequently presented (Deb et al 2002). The main features of NSGA-II are low comput...

Abstract This paper presents a hybrid approach based Binary Artificial Bee Colony (BABC) and Pareto Dominance strategy for scheduling workflow applications considering different Quality of Services (QoS) requirements in cloud computing. The main purpose is to schedule given application onto the available machines environment with minimum makespan (i.e. length) processing cost while maximizing r...

Sorting algorithms plays an important role in the computer science field. Many applications use sorting algorithm. There are several proposed by experts, namely bubble sort, exchange short, insertion heap quick merge standard selection sort. One well-known algorithm of is In this journal, discussion about sort given with thorough analysis. very data structure concepts that has memory management...