Journal ArticleOPEN ACCESS

The 1-D bin packing problem optimisation using bees algorithm

  • Hartono N
  • Ismail A
  • Zeybek S
  • et al.
Journal Industrial Servicess (2022) 7(2) 323
DOI: 10.36055/jiss.v7i2.14387
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

The bin packing problem is a classic combinatorial optimisation problem that is widely used in various applications such as assembly line balancing, scheduling, and time-tabling. …

Cite

CITATION STYLE

APA

Hartono, N., Ismail, A. H., Zeybek, S., Caterino, M., Jiang, K., Sahin, M., & Natalia, C. (2022). The 1-D bin packing problem optimisation using bees algorithm. Journal Industrial Servicess, 7(2), 323. https://doi.org/10.36055/jiss.v7i2.14387

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free