Short course
Featured

 

Mixed-integer and Disjunctive Programming and Mixed-integer Models for Planning and Scheduling

 

​April 19, 2016


​8:30am ​Breakfast
​9:00am – 11:00am
  • ​Mixed-integer Linear Programming
  • Major Types Integer and Mixed-integer Constraints
  • Algorithms: Branch and Bound
  • Logic Based Optimization and Disjunctive Programming
  • Propositional Logic for Formulating Constraints
  • Examples of Logic Constraints
  • Convex Hull and Big-M Reformulations
​2:30pm - 3:30pm
  • ​Mixed-integer Nonlinear Programming
  • Branch and Bound, Outer-approximation, Benders Decomposition, Extended Cutting Plane
  • DICOPT: Examples Parameter Estimation, Synthesis Heat Exchanger Networks
​3:30pm - 3:45pm ​Coffee break
​3:45pm - 4:45pm
  • ​Generalized Disjunctive Programming
  • Logic-based Methods and Reformulation
  • Global Optimization

​April 20, 2016


​8:30am ​Breakfast
​9:00am - 10:30am
  • Introduction and Roadmap to Scheduling Problems
  • Batch Scheduling: Single Stage, Parallel Units
  • Batch Scheduling: Multi-stage Plants
10:30am - 10:45am ​Coffee break
​10:45am - 11:45am
  • ​Flowshop Scheduling
  • State-task and Resource-task Network
  • Discrete and Continuous Time Models 
​1:30pm - 3:00pm
  • ​Scheduling of Continuous Multistage Plants
  • Refinery Scheduling and Blending
  • Multi-site Production Planning
  • Supply Chain Models
​3:00pm - 3:15pm ​Coffee break
​3:15pm - 4:30pm
  • ​Constraint Programming
  • Hybrid Methods for Scheduling: Single Stage and STN
  • Decomposition Methods for Planning and Scheduling: Lagrangean and Bi-level Methods
  • Closing comments, end of short course