Mixed-time representation for state-task network models

Research output: Contribution to journalArticlepeer-review

46 Scopus citations

Abstract

A new mixed-time representation for STN-based scheduling models is proposed: the time grid is fixed, but processing times are allowed to be variable and span an unknown number of time periods. The proposed representation handles batch and continuous processes, and it accounts linearly for holding, backlog, and utility costs. It handles release and due dates at no additional computational cost, and it accounts for variable processing times. Computational improvements for the solution of the proposed mixed-integer programming formulation are also developed.

Original languageEnglish (US)
Pages (from-to)9129-9145
Number of pages17
JournalIndustrial and Engineering Chemistry Research
Volume44
Issue number24
DOIs
StatePublished - Nov 23 2005
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Chemistry(all)
  • Chemical Engineering(all)
  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'Mixed-time representation for state-task network models'. Together they form a unique fingerprint.

Cite this