A Priority-Rule Based Method for Batch Production Scheduling in the Process Industries
We present a priority-rule based method for batch production scheduling in the process industries. The problem consists in scheduling a given set of operations on a batch plant such that the makespan is minimized. Each operation consumes given amounts of input materials at its start and produces given amounts of output materials at its completion. An initial, a maximum, and a minimum stock level are specified for each material. Some materials are perishable and thus cannot be stored. The operations may be executed on alternative processing units. Processing units require cleaning between certain operations and before any idle time. Due to the constraints on material availability and storage capacity, classical schedule-generation schemes cannot be applied to this problem. That is why we propose a new two-phase approach dealing with the two types of constraints separately.
Unable to display preview. Download preview PDF.
- 3.Burkard, R.E., Kocher, M., Rudolf, R. (1998): Rounding strategies for mixed integer programs arising from chemical production planning. Yugoslav Journal of Operations Research 8, 9–23Google Scholar
- 8.Westenberger, H., Kallrath, J. (1995): Formulation of a job shop problem in process industry. Bayer AG, Leverkusen and BASF AG, LudwigshafenGoogle Scholar