Show simple item record

dc.contributor.authorPRATIWI, Yona Eka
dc.contributor.authorKUSBUDIONO, Kusbudiono
dc.contributor.authorRISKI, Abduh
dc.contributor.authorHADI, Alfian Futuhul
dc.date.accessioned2023-02-15T06:44:16Z
dc.date.available2023-02-15T06:44:16Z
dc.date.issued2020-02-29
dc.identifier.urihttps://repository.unej.ac.id/xmlui/handle/123456789/112172
dc.description.abstractThe development of an increasingly rapid industrial development resulted in increasingly intense competition between industries. Companies are required to maximize performance in various fields, especially by meeting customer demand with agreed timeliness. Scheduling is the allocation of resources to the time to produce a collection of jobs. PT. Bella Agung Citra Mandiri is a manufacturing company engaged in making spring beds. The work stations in the company consist of 5 stages consisting of ram per with three machines, clamps per 1 machine, firing mattresses with two machines, sewing mattresses three machines and packing with one machine. The model problem that was solved in this study was Hybrid Flowshop Scheduling. The optimization method for solving problems is to use the metaheuristic method Migrating Birds Optimization. To avoid problems faced by the company, scheduling is needed to minimize makespan by paying attention to the number of parallel machines. The results of this study are scheduling for 16 jobs and 46 jobs. Decreasing makespan value for 16 jobs minimizes the time for 26 minutes 39 seconds, while for 46 jobs can minimize the time for 3 hours 31 minutes 39 seconds.en_US
dc.language.isoenen_US
dc.publisherMathematics and Statisticsen_US
dc.subjectMBOen_US
dc.subjectHFSen_US
dc.subjectMetaheuristicen_US
dc.subjectDeviation Percentage Algorithmen_US
dc.subjectMakespanen_US
dc.titleHybrid Flow-Shop Scheduling (HFS) Problem Solving with Migrating Birds Optimization (MBO) Algorithmen_US
dc.typeArticleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record