Maravelias Group
University of Wisconsin – Madison

Scheduling: Theory

  • Dong, Y.; Velez, S.; Maravelias, C.T. Changeover Formulations for Discrete-time Mixed-integer Programming Scheduling Models. European Journal of Operational Research, 260 (3), 949-963, 2017.
  • Martagan, T.; Krishnamurthy, A.; Maravelias, C.T. Optimal Condition-Based Harvesting Policies for Biomanufacturing Operations with Failure Risks. IIE Transactions, 48(5), 440-461, 2016.
    (DOI: 10.1080/0740817X.2015.1101523).
  • Velez, S.; Maravelias, C.T. Theoretical Framework for the Formulation of MIP Scheduling Models with Multiple and Nonuniform Discrete-time Grids. Computers and Chemical Engineering, 72, 233-254, 2015.
    (DOI: 10.1016/j.compchemeng.2014.03.003).
  • Subramanian, K.; Maravelias, C. T.; Rawlings, J. B. A State-space Model for Chemical Production Scheduling. Computers and Chemical Engineering, 47, 97-110, 2012.
    (DOI: 10.1016/j.compchemeng.2012.06.025).
  • Maravelias, C. T. A General Framework and Modeling Approach Classification for Chemical Production Scheduling. AIChE J., 58 (6), 1812-1828, 2012.
    (DOI: 10.1002/aic)
  • Maravelias, C. T. On the Combinatorial Structure of Discrete-time MIP Formulations for Chemical Production Scheduling. Computers and Chemical Engineering, 38, 204-212, 2012.
    (DOI: 10.1016/j.compchemeng.2011.11.004).
  • Maravelias, C. T.; Papalamprou, K. Polyhedral Results for Discrete-time MIP Formulations for Scheduling and Production Planning. Computers and Chemical Engineering, 33(11), 1890-1904, 2009.
    (DOI:10.1016/j.compchemeng.2009.05.015).
  • Maravelias, C. T.; Grossmann, I. E. On the Relation of Continuous and Discrete Time Models for the State-Task Network Formulation. AIChE J., 52 (2), 843-849, 2006.
    (DOI: 10.1002/aic.10684).