We address the no-wait k-stage flexible flowshop scheduling problem where there are m identical machines at each stage. The objectives are to schedule the available n jobs so that makespan and mean tardiness of n jobs are minimized. Sequence-dependent setup times are treated in this problem as one of the prominent practical assumptions. This problem is NP-hard, and therefore we present a new mu...

This paper presents a novel method on the optimization of bi-objective Flexible Job-shop Scheduling Problem (FJSP) under stochastic processing times. The robust counterpart model and the Non-dominated Sorting Genetic Algorithm II (NSGA-II) are used to solve the bi-objective FJSP with consideration of the completion time and the total energy consumption under stochastic processing times. The cas...

Coordination of operations with spatially and temporally shared resources, such as route segments, fixes, and runways, improves the efficiency of terminal airspace management. Problems in this category are, in general, computationally difficult compared to conventional scheduling problems. This paper presents a fast time algorithm formulation using a non-dominated sorting genetic algorithm (NSG...

The nondominated sorting genetic algorithm with elitism (NSGA-II) is widely used due to its good performance on solving multiobjective optimization problems. In each iteration of NSGA-II, truncation selection is performed based on the rank and crowding distance of each solution. There are, however, drawbacks in this process. These drawbacks to some extent cause overlapping solutions in the popu...

This paper discusses the application of evolutionary multi-objective optimization algorithms namely Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and Modified NSGA-II (MNSGA-II) for solving the Combined Economic Emission Dispatch (CEED) problem with valvepoint loading. The valve-point loading introduce ripples in the input-output characteristics of generating units and make the CEED prob...

To solve single and multi-objective optimization problems, evolutionary algorithms have been created. We use the non-dominated sorting genetic algorithm (NSGA-II) to find Pareto front in a two-objective portfolio query, its extended variant NSGA-III three-objective problem, this article. Furthermore, both we quantify Karush-Kuhn-Tucker Proximity Measure (KKTPM) for each generation determine how...

We are interested in this paper in solving a multiobjective hybrid flowshop scheduling problem (HFS). The problem has different parameters and constraints such as release dates, due dates and sequence dependent setup times. Two different objectives should be optimized at once: the makespan and the total tardiness to be minimized. To solve the problem, we have developed two versions of a new dec...

The geometry of engineering systems affects their performances. For this reason, the shape of engineering systems needs to be optimized in the initial design stage. However, engineering system design problems consist of multi-objective optimization and the performance analysis using commercial code or numerical analysis is generally time-consuming. To solve these problems, many engineers perfor...

Low specific speed centrifugal pumps (LSSCP) are widely utilized in district energy systems to promote the integration of renewable energy. However, performance LSSCP becomes inefficient due harsh operating conditions resulting substantial increase consumption. Many-objective optimization is significant improving and promoting sustainability systems. Among existing methods, global methods limit...

nowadays, the subject of vision metrology network design is local enhancement of the existing network. in the other words, it has changed from first to third order design concept. to improve the network, locally, some new camera stations should be added to the network in drawback areas. the accuracy of weak points is enhanced by the new images, if the related vision constraints are satisfied si...