Flowshop sequencing problems with limited buffer storage

Sequencing problems and especially flowshop sequencing problems have been broadly discussed in literature. But usually the effect of limited buffer storage is ignored, although in industrial production or computer architecture the amount of available buffer storage has an important influence on the performance of the system. This paper presents a systematic overview of how to formulate flowshop problems with limited buffer storage as well as several heuristics to compete with this class of problems. Numerical experiences are also described.