Combining the Advantages of Discrete- and Continuous-time MIP Scheduling Models

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

A solution algorithm that harnesses the strengths of discrete- and continuous-time scheduling models is proposed. It is a three stage algorithm consisting of (i) a discrete-time MIP scheduling model, (ii) a mapping algorithm, and (iii) a continuous-time LP model. It enables fast and accurate solution of scheduling problems, by quickly obtaining approximate solutions and improving their accuracy, while maintaining feasibility. Through a computational study, it is shown that the proposed method is capable of finding high quality solutions up to 4 orders of magnitude faster, compared to stand-alone discrete-and continuous-time models.

Original languageEnglish (US)
Title of host publicationComputer Aided Chemical Engineering
PublisherElsevier B.V.
Pages1171-1176
Number of pages6
DOIs
StatePublished - 2019
Externally publishedYes

Publication series

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

All Science Journal Classification (ASJC) codes

  • Chemical Engineering(all)
  • Computer Science Applications

Keywords

  • chemical production scheduling
  • continuous-time model
  • discrete-time model
  • solution algorithm

Fingerprint Dive into the research topics of 'Combining the Advantages of Discrete- and Continuous-time MIP Scheduling Models'. Together they form a unique fingerprint.

Cite this