Show simple item record

dc.contributor.advisorTran, Duc Vi
dc.contributor.advisorPham, Quynh Tram
dc.contributor.authorLe, Gia Bao
dc.contributor.authorPham, Que Phuong
dc.date.accessioned2025-02-11T07:31:09Z
dc.date.available2025-02-11T07:31:09Z
dc.date.issued2024-02
dc.identifier.urihttp://keep.hcmiu.edu.vn:8080/handle/123456789/6308
dc.description.abstractThe Flexible Job Shop Scheduling Problem (FJSSP) requires managing two distinct entities simultaneously. This research evaluates priority decision rules for scheduling tasks efficiently in the dynamin environment within the FJSSP framework and compares their performance with real-world scenarios. Drawing from existing literature, diverse priority rules including Composite Dispatching Rules (CDRs) and Multi-Criteria Decision Making (MCDM) methodologies like WASPAS, COPRAS, WAM, PSI, and PIV are selected and refined using fuzzy SWARA. The study finds the dynamic approach consistently outperforms other versions, showcasing its adaptability to evolving conditions. Both MCDM-fixed and MCDM-dynamic approaches significantly impact tardiness compared to CDRs, highlighting their efficacy in addressing critical scheduling objectives. This analysis offers insights for optimizing scheduling strategies in complex manufacturing environments, enhancing operational efficiencyen_US
dc.language.isoenen_US
dc.subjectFlexible Job Shop Scheduling Problem (JSSP)en_US
dc.subjectDiscrete Event Simulation (DES)en_US
dc.subjectPriority Dispatching Rule (PDR)en_US
dc.subjectMulti-Criteria Decision Making (MCDM)en_US
dc.subjectComposite Dispatching Rule (CDR)en_US
dc.titleFlexible Job Shop Scheduling In Semiconductor Back-End Manufacturing. A Simulation Studyen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record