Combining the advantages of discrete- and continuous-time scheduling models: Part 2. systematic methods for determining model parameters

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

The Discrete-Continuous Algorithm (DCA) is a novel framework that harnesses the strengths of discrete- and continuous-time scheduling formulations (Lee and Maraveloas,2018). Its flexibility in the selection of two user-defined parameters, namely discretization step length (δ) and horizon relaxation (η), can lead to significantly improved computational performance and solution quality. In this paper, we propose systematic methods to determine these parameters. Specifically, we evaluate the parameters based on error evaluation functions and cumulative error functions that consider various aspects of the scheduling instances. Through an extensive computational study, we show that the proposed methods bring up to × 104 speedups, while leading to identical or better solutions in the majority of the instances compared to traditional methods.

Original languageEnglish (US)
Pages (from-to)557-573
Number of pages17
JournalComputers and Chemical Engineering
Volume128
DOIs
StatePublished - Sep 2 2019
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Chemical Engineering(all)
  • Computer Science Applications

Keywords

  • Chemical production scheduling
  • Continuous-time representation
  • Discrete-time representation

Fingerprint Dive into the research topics of 'Combining the advantages of discrete- and continuous-time scheduling models: Part 2. systematic methods for determining model parameters'. Together they form a unique fingerprint.

Cite this