Preprocessing and tightening methods for time-indexed mixed-integer programming chemical production scheduling models

Andres F. Merchan, Christos T. Maravelias

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Over the last three decades, several research efforts have been made in order to incorporate different features that appear in scheduling problems. To this end, many Mixed-Integer Programming (MIP) models have been proposed to account for storage, utilities, limited resources, changeovers, maintenance, rescheduling, among other features, in addition to the basic assignment, sizing and timing of products in processing units. However, the main drawback of most of these models is that they can only handle small- to mid-scale instances. The challenge of solving large-scale industrial instances using MIP models has remained for the most part intractable.

Original languageEnglish (US)
Title of host publicationComputing and Systems Technology Division 2015 - Core Programming Area at the 2015 AIChE Annual Meeting
PublisherAIChE
Pages905-906
Number of pages2
ISBN (Electronic)9781510818569
StatePublished - 2015
EventComputing and Systems Technology Division 2015 - Core Programming Area at the 2015 AIChE Annual Meeting - Salt Lake City, United States
Duration: Nov 8 2015Nov 13 2015

Publication series

NameComputing and Systems Technology Division 2015 - Core Programming Area at the 2015 AIChE Annual Meeting
Volume2

Conference

ConferenceComputing and Systems Technology Division 2015 - Core Programming Area at the 2015 AIChE Annual Meeting
Country/TerritoryUnited States
CitySalt Lake City
Period11/8/1511/13/15

All Science Journal Classification (ASJC) codes

  • General Chemical Engineering
  • General Engineering
  • General Computer Science

Fingerprint

Dive into the research topics of 'Preprocessing and tightening methods for time-indexed mixed-integer programming chemical production scheduling models'. Together they form a unique fingerprint.

Cite this