Two-Stage Memory Allocation using AHP & Knapsack at PT Berca Hardayaperkasa

Authors

  • Khanis Satya International Business Engineering Program, Universitas Kristen Petra, Surabaya, Indonesia
  • Indriati N Bisono International Business Engineering Program, Universitas Kristen Petra, Surabaya, Indonesia
  • Hanijanto Soewandi MicroStrategy, Tysons Corner, VA, USA

DOI:

https://doi.org/10.31098/bmss.v2i1.539

Abstract

We propose to manage a (MicroStrategy) Business Intelligence Server in term of RAM allocation for its Intelligent Cubes as a two-stage resource allocation problem in which the first stage is formulated as an multi criteria problem that can be solved using Analytic Hierarchy Process (AHP) and the second stage is multiple (several) 0-1 classic Knapsack problems with the constraints that are obtained using the result from the first stage. This Approach happens to have advantage in term of computational complexity as well, it reduces from O(nM) to O(max{nj}max{Mj}) when calculated in parallel. We illustrate our proposal with a numerical example based on our experience.

Downloads

Published

2022-04-21

How to Cite

Satya, K., Bisono, I. N., & Soewandi, H. (2022). Two-Stage Memory Allocation using AHP & Knapsack at PT Berca Hardayaperkasa. RSF Conference Series: Business, Management and Social Sciences, 2(1), 231–241. https://doi.org/10.31098/bmss.v2i1.539

Issue

Vol. 2 No. 1 (2022): International Conference on Industrial and Systems Engineering, Technology, Innovation, and Management (ICISETIM)

Section

Articles