Abstract
This paper presents a graph-theoretic technique for scheduling of multipurpose batch processes with the objective of maximizing throughput over a fixed time horizon. The presented technique is based on the S-graph framework which embeds the necessary scheduling information pertaining to recipes of different batches and possible resource allocation. The distinct feature of this contribution is the irrelevance of time horizon discretization which has become traditional in most mathematical programming techniques. Consequently, no presupposition of time points is required, thereby rendering the technique truly continuous in time. A comparison with time point based techniques is conducted to demonstrate the performance.
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.
