in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...

in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.

In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...

We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...

this paper explores the flexile flow lines where setup times are sequence- dependent. the optimization criterion is the minimization of total weighted completion time. we propose an iterated greedy algorithm (iga) to tackle the problem. an experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of iga are compared against those of some other exist...

Confidential algorithm for the approximate graph vertex covering problem is presented in this article. It can preserve privacy of data at every stage computation, which very important context cloud computing. Security of~our solution based on fully homomorphic encryption scheme. The time complexity and security aspects considered are described.

The goal of this paper is to study the performance Thresholding Greedy Algorithm (TGA) when we increase size greedy sums by a constant factor λ⩾1. We introduce so-called λ-almost and λ-partially bases. case λ=1 gives us classical definitions almost (strong) partially show that basis if only it for all (some) However, each λ>1, there exists an unconditional but not 1-partially greedy. Furthermor...