Storage problems in batch scheduling
Abstract
This paper is concerned with the modelling of storage configurations for intermediate products in process industries. Those models form the basis of algorithms for scheduling chemical production plants. Different storage capacity settings (unlimited, finite, and no intermediate storage), storage homogeneity settings (dedicated and shared storage), and storage time settings (unlimited, finite, and no wait) are considered. We discuss a classification of storage constraints in batch scheduling and show how those constraints can be integrated into a general production scheduling model that is based on the concept of cumulative resources.
Date Issued
2002
Publication Type
Conference Item
Subject(s)
Language(s)
en
Author(s)
Schwindt, Christoph |
Editor(s)
Chamoni, P. | |
Leisten, R. | |
Martin, A. | |
Minnemann, J. | |
Stadtler, H. |
Additional Credits
Publisher
Springer
ISBN
978-3-642-50282-8
Title of Event
Access(Rights)
metadata.only