Premium
Combinatorial framework for effective scheduling of multipurpose batch plants
Author(s) -
Sanmartí E.,
Puigjaner L.,
Holczinger T.,
Friedler F.
Publication year - 2002
Publication title -
aiche journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.958
H-Index - 167
eISSN - 1547-5905
pISSN - 0001-1541
DOI - 10.1002/aic.690481115
Subject(s) - scheduling (production processes) , computer science , representation (politics) , graph , mathematical optimization , job shop scheduling , distributed computing , theoretical computer science , mathematics , schedule , politics , political science , law , operating system
The production scheduling of multipurpose batch plants is considered. A novel graph representation that looks at the specific characteristics of production scheduling in chemical processes is proposed. In these graphs, the nodes represent the production tasks, the arcs of the precedence relationships among them. The representation is flexible enough to consider a wide variety of production structures, including complex recipes. Both nonintermediate storage (NIS) and unlimited intermediate storage (UIS) transfer policies can be considered simply by choosing the appropriate precedence relationships. This representation provides the opportunity of incorporating highly efficient graph algorithms together with an appropriate branch‐and‐bound algorithm for solving multipurpose scheduling problems. The efficiency of the proposed method is established by solving examples and a complex case study.