Total Weighted Tardiness in the Permutation Flow Shop under Uncertainty

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 equivalen...

Full description

Saved in:
Bibliographic Details
Published in:IFAC-PapersOnLine 2021, Vol.54 (1), p.1174-1180
Main Authors: Ouchiekh, R., Fri, M., Touil, A., Echchatbi, A.
Format: Article
Language:English
Subjects:
Computer programming
Egale strategy
Egale Strategy (ES)
Flow shop problems
Machine shop practice
Permutation flow shop problem
Permutation Flow Shop Problem (PFSP)
Permutation flowshops
Sine-cosine algorithm
Sine-Cosine Algorithm (SCA)
Total weighted tardiness
Total Weighted Tardiness (TWT)
Uncertainty theory
Uncertainty Theory (UT)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2405-8963
2405-8963
DOI:10.1016/j.ifacol.2021.08.138