Obtaining an optimal solution for a permutation flowshop scheduling problem with the total flowtime criterion in a reasonable computational timeframe using traditional approaches and optimization tools has been a challenge. ...

Recently, multi-objective evolutionary algorithms (MOEAs) have been extensively used to solve multi-objective optimization problems (MOPs) since they have the ability to approximate a set of non-dominated solutions in ...

No-idle permutation flowshop scheduling problem (NIPFSP) is a well-known NP-hard problem, in which each machine must perform the jobs consecutively without any idle time. Even though various algorithms have been proposed ...

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

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

The distributed permutation flowshop scheduling problem with preventive maintenance operator (PM/DPFSP) is closely related to modem industry. This paper presents an improved discrete artificial bee colony (IDABC) algorithm ...

In this paper, we study a distributed blocking flowshop scheduling problem (DBFSP) that is an extension of the traditional blocking flowshop scheduling problem (BFSP), in which an additional decision of which factory to ...

The distributed blocking flowshop scheduling problem (DBFSP) that is an important generalization of the traditional blocking flowshop scheduling problem (BFSP), in which the blocking constraint has to be considered. The ...

Nowadays, the distributed assembly permutation flowshop problem (DAPFSP) has important applications in practice. In this paper, we propose a group iterated local search (gILS) algorithm to solve the problem with total ...

In this paper, we present a new heuristic to divide a batch of printed circuit boards (PCBs) into subgroups to save the setup time for loading and unloading components from the assembly machine. In the heuristic, we propose ...