This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...

in this study, a two-objective mixed-integer linear programming model (milp) for multi-product re-entrant flow shop scheduling problem has been designed. as a result, two objectives are considered. one of them is maximization of the production rate and the other is the minimization of processing time. the system has m stations and can process several products in a moment. the re-entrant flow sho...

....... The fast and elitist non-dominated sorting genetic algorithm (NSGA-II) contains a mechanism to sort individuals in a multi-objective optimization problem into non-dominated fronts, based on their performance in each optimization variable. When dealing with a bi-objective problem it is possible to carry-out the non-dominated sorting more efficiently, using the new sorting method presente...

The crossover operator has always been regarded as the primary search operator in genetic algorithm (GA) because it exploits the available information from the population about the search space. Moreover, it is one of the components to consider for improving the behavior of the GA. To improve performance of GA multi parent crossover operators have been used. Multi parent crossover operators inv...

this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem. Random gravitational emulation search algorithm (RGES (is presented for solving traveling salesman problem. The algorithm based on random search concepts, and uses two parameters, speed and force of gravity in physics. The proposed algorithm is ...

in this paper, a non-dominated sorting genetic algorithm-ii (nsga-ii) based approach is presented for distribution system reconfiguration. in contrast to the conventional ga based methods, the proposed approach does not require weighting factors for conversion of multi-objective function into an equivalent single objective function. in order to illustrate the performance of the proposed method,...

In industries machine maintenance is used in order to avoid untimely machine fails as well as to improve production effectiveness. This research regards a permutation flow shop scheduling problem with aging and learning effects considering maintenance process. In this study, it is assumed that each machine may be subject to at most one maintenance activity during the planning horizon. The objec...

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...