In this paper we consider a job shop scheduling problem with blocking (zero buffer) constraints. Blocking constraints model the absence of buffers, whereas in the traditional job shop scheduling model buffers have infinite capacity. There are two known variants of this problem, namely the blocking job shop scheduling (BJSS) with swap allowed and the BJSS with no-swap. A swap is needed when ther...

Efficient allocation or assignment of tasks has been a constant problem for research in the domain of Combinatorial Optimization. With Task Assignment being an NP-Hard Problem for more than 3 processors, considerable effort has gone into developing heuristic algorithms that provide an efficient and approximate solutions that match the expected values. Currently trending algorithms utilize Graph...

This paper proposes an Iterated Local Search (ILS) procedure and an Iterated Greedy (IG) algorithm, which are both combined with a variable neighbourhood search (VNS), for dealing with the flow shop problem with blocking, in order to minimize the total tardiness of jobs. The structure of both algorithms is very similar, but they differ in the way that the search is diversified in the space of s...

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

The obnoxious p-median problem is a facility location where we maximise the sum of distances between each client point and its nearest facility. Since it nondeterministic polynomial-time (NP)-hard, most algorithms designed for follow metaheuristic strategies to find high-quality solutions in affordable time but with no optimality guarantee. In this paper, variant iterated greedy algorithm devel...

This paper studies the hybrid flow shop scheduling problem with blocking constraints (BHFSP). To better understand BHFSP, we will construct its mixed integer linear programming (MILP) model and use Gurobi solver to demonstrate correctness. Since BHFSP exists parallel machines in some processing stages, different decoding strategies can obtain makespan values for a given job sequence multiple as...

This paper deals with the problem of scheduling jobs in a parallel flow shop configuration under blocking constraint, which setup time machines depends not only on job to be processed but also previously one, i.e., there are sequence-dependent times. The performance analysis several iterated greedy algorithms different initial solution procedures and local searches lets us define an efficient a...

This work deals with the so-called weighted independent domination problem, which is an NP-hard combinatorial optimization problem in graphs. In contrast to previous work, this paper considers the problem from a non-theoretical perspective. The first contribution consists in the development of three integer linear programming models. Second, two greedy heuristics are proposed. Finally, the last...

Although many papers deal with the permutation flowshop scheduling problem with or without setups, according to our knowledge, little has been published tackling multi-objective optimization in presence of sequence dependent setup times. Hence, in this work we cope with this problem considering two pairs of well known independent objectives, the Cmax−TWT (Makespan-Total Weighted Tardiness ) and...