This research was intended to produce an order (job) scheduling model at Carton Packaging Industries (CPI) that is useful for giving information about the time delivery to customers. The proposed model is quite complicated because of the characteristic of Make to Order (MTO) varies production process greatly between each order. The job’s schedule for CPI is prepared for production process that consists of 5 stages where in each stage uses different type of machinery. Not all jobs can be processed by all machines at a given production stage. Every job flow through 5 stage in the same order, but not all stages have to visited by all jobs. Stages may be skipped for a particular job. This condition makes CPI is classified as Hybrid and flexible flowshop for machine eligibility (HFFME). HFFME is complicated and is difficult to calculate by using conventional heuristic model. This research used genetic algorithm for solving the complex problem of HFFME and the resulting model called the Genetic Algorithm for hybrid and flexible flowshop with machine eligibility (GA-HFFME). This model is developed to minimized makespan, the objective of scheduling. The experiment was conducted towards 11 orders and it was found that the GA-HFFME is effective to solve that problem.
CITATION STYLE
Azmi, N., Jamaran, I., Arkeman, Y., & Mangunwidjaja, D. (2012). PENJADWALAN PESANAN MENGGUNAKAN ALGORITMA GENETIKA UNTUK TIPE PRODUKSI HYBRID AND FLEXIBLE FLOWSHOP PADA INDUSTRI KEMASAN KARTON. JURNAL TEKNIK INDUSTRI, 2(2), 176–188. https://doi.org/10.25105/jti.v2i2.7028
Mendeley helps you to discover research relevant for your work.