Storage planning and utilization are among the most important considerations of practical batch process scheduling. Modeling the available storage options appropriately can be crucial in order to find practically applicable solutions with the best objective value. In general, there are two main limitations on storage: capacity and time. This paper focuses on the latter and investigates different techniques to tackle limited storage time within the S-graph framework. The S-graph framework is a collection of combinatorial algorithms and a directed graph based model that has been introduced three decades ago and has been under development ever since. In this work, several options for addressing storage time limitations within the framework were implemented and tested for efficiency. The empirical results over a huge number of tests have unequivocally favored one of the approaches, which will be applied in later developments.

存储计划和利用率是实际批处理计划中最重要的考虑因素之一。为了找到具有最佳目标价值的实际适用解决方案，适当地建模可用的存储选项可能至关重要。通常，存储有两个主要限制：容量和时间。本文重点讨论后者，并研究了在S-graph框架内解决有限存储时间的不同技术。S-graph框架是组合算法和基于有向图的模型的集合，该模型已在三十年前推出，并一直在开发中。在这项工作中，解决了框架内存储时间限制的几个选项已实现并进行了效率测试。