The Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the job order on different machines. The flexibility that ...

This paper deals with the traditional permutation flow shop scheduling problem with the objective of minimizing mean flowtime, therefore reducing in-process inventory. A new heuristic method is proposed for the scheduling ...

This paper deals with the permutation flow shop scheduling problem with separated and sequence-independent machine setup times. A heuristic method with the objective of minimizing the total time to complete the schedule ...

The Flow Shop Scheduling Problem (FSSP) is notoriously NP-hard combinatorial optimization problem. The goal is to find a schedule that minimizes the makespan. This paper proposes an adaptation of a new approach called ...

Este artigo apresenta uma investigação sobre o problema de programação da produção em ambientes flow shop com múltiplas máquinas (híbridos) e tempos de preparação (setup) das máquinas assimétricos e dependentes da sequência, ...

The best performing approximate methods proposed for the permutational flow shop scheduling problem with makespan minimization are the well known NEH constructive heuristic and the iterated greedy algorithm. Both methods ...

This work proposes the development of a metaheuristics based computation tool, to solve the permutation flow shop scheduling problem (PFSSP) in the electronic manufacturing operating in High-mix, Low-volume enviroment. To ...

This work proposes the development of a metaheuristics based computation tool, to solve the permutation flow shop scheduling problem (PFSSP) in the electronic manufacturing operating in High-mix, Low-volume enviroment. To ...

Systems for Coordination of Orders (SCO) are information systems involved in all or some of the following Production Planning and Control (PPC) activities: to schedule or organise material requirements, and/or to control ...