This paper focuses on the flow shop sequence dependent group scheduling (FSDGS) problem with minimisation of total completion time as the criterion (Fm|f<SUB align="right"><SMALL>mls</SMALL></SUB>, prmu, S<SUB align="right"><SMALL>plk</SMALL></SUB>|ΣC<SUB align="right"><SMALL>J</SMALL></SUB>). The research problem is formulated in form of two different mixed integer linear programming (MILP) models. Comparing...</small></sub></small></sub></small></sub>

This paper presents branch-and-bound algorithms developed for an m-machine permutation flowshop to minimise the maximum weighted flowtime/maximum weighted tardiness/maximum sum of weighted flowtime and weighted tardiness/maximum sum of weighted flowtime, weighted tardiness and weighted earliness...

A novel Discrete Differential Evolution (DDE) algorithm is proposed in this paper for solving no-idle permutation flow-shop scheduling problems with maximum completion time (makespan) criterion. Firstly, individuals of the DDE algorithm are represented as discrete job permutations, and new...

A novel Discrete Differential Evolution (DDE) algorithm is proposed in this paper for solving no-idle permutation flow-shop scheduling problems with maximum completion time (makespan) criterion. Firstly, individuals of the DDE algorithm are represented as discrete job permutations, and new...