Process scheduling by synthesizing time constrained process-networks

Marton Frits, Botond Bertok

Research output: Chapter in Book/Report/Conference proceedingChapter

6 Citations (Scopus)

Abstract

Process-network synthesis was originally introduced for conceptual process design. However, recent developments extend the capabilities of the P-graph framework to consider such time constraints in process-network synthesis that mainly arise in process operation. The current paper shows how to formulate and solve process scheduling as time constraint process synthesis, i.e., how to synthesize the optimal process schedule. Multiple classes of classical scheduling problems are revisited and reformulated. Algorithm is proposed for generating superstructure involving each candidate schedule in a way that the operating units are regarded as resources and changeovers as potential steps of the process. Various storage policies are incorporated. The differences of the storage policies are graphically highlighted both in the superstructures and in the solutions. The mathematical model constructed and analyzed, integrates the variables and constraints related to process synthesis, as well as, a precedence based formulation of the time constraints.

Original languageEnglish
Title of host publicationComputer Aided Chemical Engineering
PublisherElsevier B.V.
Pages1345-1350
Number of pages6
DOIs
Publication statusPublished - 2014

Publication series

NameComputer Aided Chemical Engineering
Volume33
ISSN (Print)1570-7946

    Fingerprint

Keywords

  • P-graph
  • Process-network synthesis
  • Scheduling

ASJC Scopus subject areas

  • Chemical Engineering(all)
  • Computer Science Applications

Cite this

Frits, M., & Bertok, B. (2014). Process scheduling by synthesizing time constrained process-networks. In Computer Aided Chemical Engineering (pp. 1345-1350). (Computer Aided Chemical Engineering; Vol. 33). Elsevier B.V.. https://doi.org/10.1016/B978-0-444-63455-9.50059-3