In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies ...

This paper proposes a novel general variable neighborhood search (GVNS) algorithm to solve the no-idle flowshop scheduling problem with the makespan criterion. The initial solution of the GVNS is generated using the FRB5 ...

Most of the problems defined in the scheduling literature do not yet take into account the energy consumption of manufacturing processes, as in most of the variants with tardiness objectives. This study handles scheduling ...

Permutation flow shop scheduling problem (PFSP) is a well-known problem in the scheduling literature. Even though many multi-objective PFSPs are presented in the literature with the objectives related to production efficiency ...

Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling ...

A supply chain network consists of facilities located in dispersed geographical locations. This network structure can be optimized to minimize total cost or total inventory by deciding the order quantities and distribution ...

This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size ...

The aim of this paper is to apply the variable block insertion heuristic (VBIH) algorithm recently proposed in the literature for solving the quadratic assignment problem (QAP). The VBIH algorithm is concerned with making ...

In this paper, we present a variable block insertion heuristic (VBIH) algorithm to solve the blocking flowshop scheduling problem with the total flowtime criterion. In the VBIH algorithm, we define a minimum and a maximum ...

This study addresses flexible job shop scheduling problem (FJSP) with two constraints, namely fuzzy processing time and new job insertion. The uncertainty of processing time and new job insertion are two scheduling related ...