On the relation of continuous‐ and discrete‐time state–task network formulations

[1]  Iftekhar A. Karimi,et al.  A simpler better slot-based continuous-time formulation for short-term scheduling in multipurpose batch plants , 2005 .

[2]  Ignacio E. Grossmann,et al.  New general continuous-time state-task network formulation for short-term scheduling of multipurpose batch plants , 2003 .

[3]  In-Beum Lee,et al.  A novel nonuniform discrete time formulation for short-term scheduling of batch and continuous processes , 2001 .

[4]  R. Sargent,et al.  A general algorithm for short-term scheduling of batch operations—II. Computational issues , 1993 .

[5]  R. Sargent,et al.  A general algorithm for short-term scheduling of batch operations */I , 1993 .

[6]  C. Pantelides,et al.  A simple continuous-time process scheduling formulation and a novel solution algorithm , 1996 .

[7]  N. Giannelos,et al.  A Simple New Continuous-Time Formulation for Short-Term Scheduling of Multipurpose Batch Processes , 2002 .

[8]  Ignacio E. Grossmann,et al.  A hybrid MILP/CP decomposition approach for the continuous time scheduling of multipurpose batch plants , 2004, Comput. Chem. Eng..

[9]  A. Barbosa‐Póvoa,et al.  An Improved RTN Continuous-Time Formulation for the Short-term Scheduling of Multipurpose Batch Plants , 2001 .

[10]  C. Floudas,et al.  Effective Continuous-Time Formulation for Short-Term Scheduling. 1. Multipurpose Batch Processes , 1998 .

[11]  G. Reklaitis,et al.  Continuous Time Representation Approach to Batch and Continuous Process Scheduling. 1. MINLP Formulation , 1999 .