Effective decomposition algorithm for multistage batch plant scheduling

Castro, Pedro; Harjunkoski, Iiro; Grossmann, Ignacio E.

http://hdl.handle.net/10400.9/1105

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
ESCAPE20-2 (2).pdf		186.96 KB	Adobe PDF	Download

Send Feedback

Authors

Castro, Pedro

Harjunkoski, Iiro

Grossmann, Ignacio E.

Abstract(s)

This paper presents a new algorithm for the scheduling of batch plants with a large number of orders and sequence-dependent changeovers. Such problems are either intractable or yield poor solutions with full-space approaches. We use decomposition on the entire set of orders and derive the complete schedule in several iterations. The key idea is to allow for partial rescheduling without altering the main decisions in terms of unit assignments and sequencing, so that the complexity is kept at a manageable level. It has been implemented with a unit-specific continuous-time model and tested for different decomposition settings. The results show that a real-life 50-order, 17-unit, 6-stage problem can effectively be solved in roughly 6 minutes of computational time.

Keywords

Optimization Continuous-time Sequence-dependent changeovers

URI

http://hdl.handle.net/10400.9/1105

Citation

Castro, P.; Harjunkoski, I.; Grossmann, E. Effective decomposition algorithm for multistage batch plant scheduling. In: Computer Aided Chemical Engineering, vol. 28, - ESCAPE-20th European Symposium on Computer Aided Process, Ischia, Italy, Hunho 6-9, 2010

Collections

ISE - Comunicações em actas de encontros científicos internacionais

Full item page