Discrete-Time MIP Methods for Production Scheduling in Multistage Facilities

Andres F. Merchan, Hojae Lee, Christos T. Maravelias

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Scopus citations

Abstract

We propose four different discrete-time, mixed-integer programming (MIP) models for production scheduling problems in multistage facilities. Specifically, we discuss two models based on network representations and develop two models inspired by the Resource-Constrained Project Scheduling Problem. Furthermore, we propose different solution methods: tightening constraints, a reformulation, and priority-based branching. Through a comprehensive computational study, we show that up to four orders of magnitude improvements in computational time can be achieved compared to existing approaches.

Original languageEnglish (US)
Title of host publication26 European Symposium on Computer Aided Process Engineering, 2016
EditorsZdravko Kravanja, Milos Bogataj
PublisherElsevier B.V.
Pages362-367
Number of pages6
ISBN (Print)9780444634283
DOIs
StatePublished - 2016
Externally publishedYes

Publication series

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

All Science Journal Classification (ASJC) codes

  • Chemical Engineering(all)
  • Computer Science Applications

Keywords

  • reformulations
  • Sequential production environments
  • tightening constraints

Fingerprint Dive into the research topics of 'Discrete-Time MIP Methods for Production Scheduling in Multistage Facilities'. Together they form a unique fingerprint.

Cite this