Abstract
AbstractStorage 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.
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Control and Optimization,Mechanical Engineering,Aerospace Engineering,Civil and Structural Engineering,Software
Reference39 articles.
1. Adonyi R, Biros G, Holczinger T, Friedler F (2008) Effective scheduling of a large-scale paint production system. J Clean Prod 16(2):225–232. https://doi.org/10.1016/j.jclepro.2006.08.021
2. Adonyi R, Holczinger T, Friedler F (2007) Novel branching procedure for S-graphs based scheduling of batch processes. In: Jezowski J (ed) Proceedings of 19th Polish conference of chemical and process engineering. Oficyna Wydawnicza Politechniki Wroclawskiej, p 9
3. Allahverdi A (2016) A survey of scheduling problems with no-wait in process. Eur J Oper Res 255(3):665–686. https://doi.org/10.1016/j.ejor.2016.05.036
4. Allahverdi A, Pesch E, Pinedo M, Werner F (2018) Scheduling in manufacturing systems: new trends and perspectives. Int J Prod Res 56(19):6333–6335. https://doi.org/10.1080/00207543.2018.1504252
5. An YJ, Kim YD, Choi SW (2016) Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times. Comput Oper Res 71:127–136. https://doi.org/10.1016/j.cor.2016.01.017
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献