Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...

This paper presents a bi-objective MIP model for the flexible flow shop scheduling  problem (FFSP) in which the total weighted tardiness and the energy consumption are minimized simultaneously. In addition to considering unrelated machines at each stage, the set-up times are supposed to be sequence- and machine-dependent, and it is assumed that jobs have different release tim...

In this article, we explore the homogeneous and isotropic flat Friedmann-Robertson-Walker (FRW) model in Chameleon cosmology. By considering a non-minimal coupling between scalar field matter, present non-singular bouncing cosmological scenario of universe. The universe initially exhibits ekpyrotic phase during contracting era, undergoes bounce, then expanding it smoothly transits to decelerati...

A novel approach to solve multi-objective optimization problems of complex mechanical systems is proposed based on evolutionary algorithm. Discrete mechanics derives structure preserving constraint equations and objective functions. Standard non-linear optimization techniques used to obtain optimal solution to these equations fails to find global optimum solution and also requires system satisf...

8 Abstract 9 The goal of this paper is to explore solution concepts for set-valued TU-games. Several stability conditions can be 10 defined since one can have various interpretations of an improvement within the multicriteria framework. We present 11 two different core solution concepts and explore the relationships among them. These concepts generalize the classic 12 core solution for scalar g...

RAO, SUNIL, MURALI. Tchebycheff Method-based Evolutionary Algorithm for Multiobjective Optimization (Under the direction of Dr. Ranji Ranjithan) In the operations research literature, the Tchebycheff method has been demonstrated to be a useful approach for exploring the non-dominated solutions for multiobjective optimization problems. While this method has been investigated with mathematical pr...

Research Online is the open access institutional repository for the University of Wollongong. For further information contact the UOW (2013). On the weighting of the mean-absolute-deviation cost minimization model. Abstract The mean-absolute-deviation cost minimization model, which aims to minimize sum of the mean value and the absolute deviation (AD) of the total cost multiplied by a given non...

This paper presents a solution for the Class Responsibility Assignment Case of the 2016 Transformation Tool Contest. The task is to assign features (methods and attributes with dependencies to each other) to classes and optimize a software metric called CRA-Index. The solution utilizes the rule-based design space exploration framework Viatra-DSE with the Non-dominated Sorting Genetic Algorithm ...

The iterative elimination of strongly dominated strategies (IESDS) and mixed-equilibrium solution concepts are studied in an iterated two-person investment game with discrete strategy spaces, non-recoverable investments, and either equal or unequal investment capital. In this game, the player investing the largest amount wins the competition and receives a fixed reward; ties are counted as loss...

The problem of solving multi-objective linear-programming problems, by assuming that the decision maker has fuzzy goals for each of the objective functions, is addressed. Several methods have been proposed in the literature in order to obtain fuzzyefficient solutions to fuzzy multi-objective programming problems. In this paper we show that, in the case that one of our goals is fully achieved, a...