Total Weighted Tardiness in the Permutation Flow Shop under Uncertainty

Abstract This paper addresses the total weighted tardiness permutation flow shop with uncertain processing time and a distinct due date. It proposes an uncertain chance-constrained programming model. Moreover, we employs some properties of uncertainty theory to build the corresponding deterministic equivalent model which is solved by an eagle strategy combined with sine-cosine algorithm. Finally, numerical results are reported to demonstrate the efficiency and applicability of the proposed model.