A novel network-based continuous-time representation for process scheduling: Part II. General framework

Diego M. Giménez, Gabriela P. Henning, Christos T. Maravelias

Research output: Contribution to journalArticlepeer-review

20 Scopus citations

Abstract

In the first part of this series of papers we presented a new network-based continuous-time representation for the short-term scheduling of batch processes, which overcomes numerous shortcomings of existing approaches. In this second part, we discuss how this representation can be extended to address aspects such as: (i) preventive maintenance activities on unary resources (e.g., processing and storage units) that were planned ahead of time; (ii) resource-constrained changeover activities on processing and shared storage units; (iii) non-instantaneous resource-constrained material transfer activities; (iv) intermediate deliveries of raw materials and shipments of finished products at predefined times; and (v) scenarios where part of the schedule is fixed because it has been programmed in the previous scheduling horizon. The proposed integrated framework can be used to address a wide variety of process scheduling problems, many of which are intractable with existing tools.

Original languageEnglish (US)
Pages (from-to)1644-1660
Number of pages17
JournalComputers and Chemical Engineering
Volume33
Issue number10
DOIs
StatePublished - Oct 14 2009
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Chemical Engineering(all)
  • Computer Science Applications

Keywords

  • Mixed-integer linear programming
  • Network-based continuous-time representation
  • Process scheduling

Fingerprint Dive into the research topics of 'A novel network-based continuous-time representation for process scheduling: Part II. General framework'. Together they form a unique fingerprint.

Cite this