We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Electrical Engineering/Applying bee colony optimization heuristic for production scheduling in make-pack manufacturing
PeriodicalsElectrical Engineering

Applying bee colony optimization heuristic for production scheduling in make-pack manufacturing

Checking your access to this record.

Abstract & Overview

This paper presents the application of Bee Colony Optimization (BCO) for solving make-pack problem. Theobjective is to reduce the makespan while satisfying the restrictions on the number and capacity of productionresources, resource usage and production time for each production, product change over and the productiontransfer. BCO is applied to solve make-pack problem with four productions resources; premix tank, mix tank,storage tank and packing line. Small and realistic-sized case studies are conducted with BCO. Small case studycontains two bulk formulas and 10 final products. The results show that BCO can find the same minimum makespan(1,447.56 minutes) in every trial. The average run time is 5.91 seconds. For the realistic-sized case study with 59bulk formulas and 203 final products, the results show that the minimum makespan in every trial is slightly different.The mean deviation from the minimum solution (7,283 minutes) is only 0.5% with average run time of 1078.1seconds.

Cite this record

Wuthichai Wongthatsanekorn, Busaba Phruksaphanrat (2013). Applying bee colony optimization heuristic for production scheduling in make-pack manufacturing. KKU ENGINEERING JOURNAL, 40(1), 47–56. https://doi.org/10.5481/kkuenj.2013.40.1.6

Copy in another style

Wongthatsanekorn, W., & Phruksaphanrat, B. (2013). Applying bee colony optimization heuristic for production scheduling in make-pack manufacturing. KKU ENGINEERING JOURNAL, 40(1), 47–56. https://doi.org/10.5481/kkuenj.2013.40.1.6
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.