The three assembly permutation flowshop scheduling problem

Autores UPV
Año
CONGRESO The three assembly permutation flowshop scheduling problem

Abstract

The assembly flowshop scheduling problem has been studied recently due to its applicability in real life scheduling problems. It arises when various fabrication operations are performed concurrently in one stage. In this paper we considered the three-stage assembly flowshop problem with sequences dependent setup time (SDST) on first and third stages with the objective of minimizing total completion time. Two mathematical models are presented and evaluated.