Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
