Abstract
A computer program for solving the general production planning problem in the case of multi-purpose batch chemical plants is presented. The procedure starts with an evolutionary enumeration of alternative production strategies. First, alternative ways of producing one batch of each of the various products are sought. Then, alternative production lines are constructed for each product by assembling types of batches of this product sequentially on the time axis. Finally, production lines of the same, or different products are set in parallel to form alternative campaign candidates. After the alternative production strategies (campaign candidates) have been generated, they are screened by identifying and rejecting non-dominant (i.e. inefficient) strategies. The screenign procedure is based on some principles of linear algebra and uses a duality between points and hyperplanes in a multi-dimensional space. Finally an optimal production plan is obtained by solving an optimization problem in which production time is allocated to the various production strategies.
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.
