The flow shop scheduling problem is finding a sequence given n jobs with same order at m
machines according to certain performance measure (s). The job can be processed on at …

This paper contains a complete and updated review of the literature for multiobjective
flowshop problems, which are among the most studied environments in the scheduling …

Multiple traveling salesman problem (MTSP) is a generalization of the classic traveling
salesman problem (TSP). Compared to TSP, MTSP is more common in real-life applications …

Abstract The Asymmetric Traveling Salesman Problem (ATSP), as a branch of the traveling
salesman problem, aims to find a group of circuits when a salesman travels all cities at the …

This paper proposes an effective hybrid algorithm based on differential evolution (DE),
namely HDE, to solve multi-objective permutation flow shop scheduling problem (MPFSSP) …

The real life scheduling problems often have several conflicting objectives. The solutions of
these problems can provide deeper insights to the decision maker than those of single …

In many real-world manufacturing applications, a number of parallel flowshops are often
used to process the jobs. The scheduling problem in this parallel flowshop system has …

This paper investigates a novel multi-objective model for a no-wait flow shop scheduling
problem that minimizes both the weighted mean completion time (C¯ w) and weighted mean …

The permutation flow-shop scheduling problem (PFSSP) is a typical combinational
optimization problem, which is of wide engineering background and has been proved to be …

Since multi-objective flow shop scheduling problem (MFSP) plays a key role in practical
scheduling, there has been an increasing interest in MFSP according to the literature …