Journal of Scheduling

, Volume 12, Issue 5, pp 461–474

Bounded-space online bin cover

Article

DOI: 10.1007/s10951-009-0116-x

Cite this article as:
Asgeirsson, E.I. & Stein, C. J Sched (2009) 12: 461. doi:10.1007/s10951-009-0116-x

Abstract

In this paper, we look at the online bounded-space bin cover problem and show how we can use the language of Markov chains to model and analyze the problem. We will use the insights given by the Markov chains to design an algorithm for the online bounded-space bin cover problem. The algorithm is a heuristic that we create by simplifying the Markov chain. We also show how we can use simple methods to improve the efficiency of the algorithm. Finally, we will analyze our algorithm and compare it to a well known online bin cover algorithm.

Keywords

Bin cover Bounded-space Online Markov chains 

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Reykjavik UniversityReykjavikIceland
  2. 2.Department of IEORColumbia UniversityNew YorkUSA

Personalised recommendations