In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the
permutation flowshop sequencing problem (PFSP) with the objectives of minimizing …

This paper presents a particle swarm optimization algorithm (PSO) to solve the permutation
flowshop sequencing problem (PFSP) with makespan criterion. Simple but very efficient …

In this work we propose an estimation of distribution algorithm (EDA) as a new tool aiming at
minimizing the total flowtime in permutation flowshop scheduling problems. A variable …

The problem of scheduling in flowshops with the objective of minimizing total flowtime is
studied. For solving the problem two ant-colony algorithms are proposed and analyzed. The …

Traditionally, the permutation flowshop scheduling problem (PFSP) was with the criterion of
minimizing makespan. The permutation flowshop scheduling problem to minimize the total …

The problem of scheduling in permutation flowshops is considered with the objective of
minimizing the makespan, followed by the consideration of minimization of total flowtime of …

The flow-shop scheduling problem (FSSP) is a branch of production scheduling, which is
among the hardest combinatorial optimization problems. It is well known that this problem …

An ILS algorithm is proposed to solve the permutation flowshop sequencing problem with
total flowtime criterion. The effects of different initial permutations and different perturbation …

In recent years, a large number of heuristics have been proposed for the minimization of the
total or mean flowtime/completion time of the well-known permutation flowshop scheduling …

In this paper a discrete particle swarm optimization (DPSO) algorithm is proposed to solve
permutation flowshop scheduling problems with the objective of minimizing the makespan. A …