Show simple item record

dc.contributor.advisorPhan, Nguyen Ky Phuc
dc.contributor.authorNguyen, The Bao
dc.date.accessioned2024-03-22T05:32:05Z
dc.date.available2024-03-22T05:32:05Z
dc.date.issued2023
dc.identifier.urihttp://keep.hcmiu.edu.vn:8080/handle/123456789/5213
dc.description.abstractProduction scheduling is a crucial component of industrial planning in today's cutthroat global market. Scheduling directly addresses the need to produce goods swiftly and at a reasonable cost. To reduce the amount of late orders, the company's major goal is to establish a mechanism that enables the sequencing and scheduling of a group of jobs so that they may be finished on time or earlier than the customer's due date. This study modifies the processing time and setup time to reduce the makespan on numerous machines in order to examine the flexible flow shop scheduling problem with a sequence dependent setup. Based on the specified mathematical model, this study uses a different methodology and applies a heuristic algorithm with huge data as the input.en_US
dc.language.isoenen_US
dc.subjectScheduling flexibleen_US
dc.titleScheduling Flexible Flow Shop In Cashew Companies To Minimize The Makespanen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record