Citation

Trautmann, N and Schwindt, C A cyclic approach to large-scale short-term planning in chemical batch production. Journal of Scheduling, 12 (6): 595-606, 2009.

Selected


Abstract

We deal with the scheduling of processes on a multi-product chemical batch production plant. Such a plant contains a number of multi-purpose processing units and storage facilities of limited capacity. Given primary requirements for the final products, the problem consists in dividing the net requirements for the final and the intermediate products into batches and scheduling the processing of these batches. Due to the computational intractability of the problem, the monolithic MILP models proposed in the literature can generally not be used for solving large-scale problem instances. The cyclic solution approach presented in this paper starts from the decomposition of the problem into a batching and a batch-scheduling problem. The complete production schedule is obtained by computing a cyclic subschedule, which is then repeated several times. In this way, good feasible schedules for large-scale problem instances are found within a short CPU time.


pdf

There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)


doi

The doi for this publication is 10.1007/s10951-009-0107-y You can link directly to the original paper, via the doi, from here

What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information



URL

This pubication does not have a URL associated with it.

The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.


Bibtex

@ARTICLE{2009-595-606-SI, author = {N. Trautmann and C. Schwindt},
title = {A cyclic approach to large-scale short-term planning in chemical batch production},
journal = {Journal of Scheduling},
year = {2009},
volume = {12},
pages = {595--606},
number = {6},
note = {Selected},
abstract = {We deal with the scheduling of processes on a multi-product chemical batch production plant. Such a plant contains a number of multi-purpose processing units and storage facilities of limited capacity. Given primary requirements for the final products, the problem consists in dividing the net requirements for the final and the intermediate products into batches and scheduling the processing of these batches. Due to the computational intractability of the problem, the monolithic MILP models proposed in the literature can generally not be used for solving large-scale problem instances. The cyclic solution approach presented in this paper starts from the decomposition of the problem into a batching and a batch-scheduling problem. The complete production schedule is obtained by computing a cyclic subschedule, which is then repeated several times. In this way, good feasible schedules for large-scale problem instances are found within a short CPU time.},
doi = {10.1007/s10951-009-0107-y},
owner = {user},
timestamp = {2012.05.25} }