An investigation of buffer sizing techniques in critical chain scheduling

Oya I. Tukel, Walter O. Rom, Sandra Duni Eksioglu

Research output: Contribution to journalArticlepeer-review

185 Scopus citations

Abstract

In this paper, we introduce two methods for determining feeding buffer sizes in critical chain project scheduling. Both methods integrate project characteristics into the formulation. Specifically, one of them incorporates resource tightness while the other uses network complexity. Both methods are tested and compared to two commonly suggested methods in the literature, the cut and paste method and the root square error method, as well as using no buffer as a benchmark. The comparison is done by means of a simulation study using the Patterson data set. The test results indicate that both of the suggested methods generate smaller buffer sizes while providing sufficient protection against delays in project completion time.

Original languageEnglish (US)
Pages (from-to)401-416
Number of pages16
JournalEuropean Journal of Operational Research
Volume172
Issue number2
DOIs
StatePublished - Jul 16 2006
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Keywords

  • Buffer sizing methods
  • Critical chain
  • Feeding buffers
  • Project scheduling

Fingerprint

Dive into the research topics of 'An investigation of buffer sizing techniques in critical chain scheduling'. Together they form a unique fingerprint.

Cite this