01.12.2012 Views

Mixed Integer Linear Programming in Process Scheduling: Modeling ...

Mixed Integer Linear Programming in Process Scheduling: Modeling ...

Mixed Integer Linear Programming in Process Scheduling: Modeling ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

160 FLOUDAS AND LIN<br />

Kondili, E., C.C. Pantelides, and R.W.H. Sargent. (1988). “A General Algorithm for Schedul<strong>in</strong>g Batch<br />

Operations.” In Proceed<strong>in</strong>gs of the Third International Symposium on <strong>Process</strong> Systems Eng<strong>in</strong>eer<strong>in</strong>g,<br />

Sydney, Australia, pp. 62–75.<br />

Kondili, E., C.C. Pantelides, and R.W.H. Sargent. (1993). “A General Algorithm for Short-Term Schedul<strong>in</strong>g<br />

of Batch Operations - I. MILP Formulation.” Computers & Chemical Eng<strong>in</strong>eer<strong>in</strong>g 17, 211–<br />

227.<br />

Ku, H.and I.A. Karimi. (1988). “Schedul<strong>in</strong>g <strong>in</strong> Serial Multiproduct Batch <strong>Process</strong>es with F<strong>in</strong>ite Interstage<br />

Storage: A <strong>Mixed</strong> <strong>Integer</strong> <strong>L<strong>in</strong>ear</strong> <strong>Programm<strong>in</strong>g</strong> Formulation.” Industrial & Eng<strong>in</strong>eer<strong>in</strong>g Chemistry<br />

Research 27, 1840–1848.<br />

Lamba, N. and I.A. Karimi. (2002a). “Schedul<strong>in</strong>g Parallel Production L<strong>in</strong>es with Resource Constra<strong>in</strong>ts. 1.<br />

Model Formulation.” Industrial & Eng<strong>in</strong>eer<strong>in</strong>g Chemistry Research 41, 779–789.<br />

Lamba, N. and I.A. Karimi. (2002b). “Schedul<strong>in</strong>g Parallel Production L<strong>in</strong>es with Resource Constra<strong>in</strong>ts. 2.<br />

Decomposition Algorithm.” Industrial & Eng<strong>in</strong>eer<strong>in</strong>g Chemistry Research 41, 790–800.<br />

Lee, K., S. Heo, H. Lee, and I. Lee. (2002). “Schedul<strong>in</strong>g of S<strong>in</strong>gle-Stage and Cont<strong>in</strong>uous <strong>Process</strong>es on<br />

Parallel L<strong>in</strong>es with Intermediate Due Dates.” Industrial & Eng<strong>in</strong>eer<strong>in</strong>g Chemistry Research 41, 58–<br />

66.<br />

Lee, K., H.I. Park, and I. Lee. (2001). “A Novel Nonuniform Discrete Time Formulation for Short-Term<br />

Schedul<strong>in</strong>g of Batch and Cont<strong>in</strong>uous <strong>Process</strong>es.” Industrial & Eng<strong>in</strong>eer<strong>in</strong>g Chemistry Research 40,<br />

4902–4911.<br />

L<strong>in</strong>, X. and C.A. Floudas. (2001). “Design, Synthesis and Schedul<strong>in</strong>g of Multipurpose Batch Plants via an<br />

Effective Cont<strong>in</strong>uous-Time Formulation.” Computers & Chemical Eng<strong>in</strong>eer<strong>in</strong>g 25, 665–674.<br />

L<strong>in</strong>, X., C.A. Floudas, S. Modi, and N.M. Juhasz. (2002). “Cont<strong>in</strong>uous-Time Optimization Approach for<br />

Medium-Range Production Schedul<strong>in</strong>g of a Multiproduct Batch Plant.” Industrial & Eng<strong>in</strong>eer<strong>in</strong>g Chemistry<br />

Research 41, 3884–3906.<br />

Majozi, T. and X.X. Zhu. (2001). “A Novel Cont<strong>in</strong>uous-Time MILP Formulation for Multipurpose Batch<br />

Plants. 1. Short-Term Schedul<strong>in</strong>g.” Industrial & Eng<strong>in</strong>eer<strong>in</strong>g Chemistry Research 40, 5935–5949.<br />

Manne, A.S. (1960). “On the Job-Shop Schedul<strong>in</strong>g Problem.” Operations Research 8, 219–223.<br />

Maravelias, C.T. and I.E. Grossmann. (2003). “A New General Cont<strong>in</strong>uous-Time State Task Network Formulation<br />

for Short-Term Schedul<strong>in</strong>g of Multipurpose Batch Plants.” Industrial & Eng<strong>in</strong>eer<strong>in</strong>g Chemistry<br />

Research 42, 3056–3074.<br />

Méndez, C.A. and J. Cerdá. (2000a). “Optimal Schedul<strong>in</strong>g of a Resource-Constra<strong>in</strong>ed Multiproduct Batch<br />

Plant Supply<strong>in</strong>g Intermediates to Nearby End-Product Facilities.” Computers & Chemical Eng<strong>in</strong>eer<strong>in</strong>g<br />

24, 369–376.<br />

Méndez, C.A., G.P. Henn<strong>in</strong>g, and J. Cerdá. (2000b). “Optimal Schedul<strong>in</strong>g of Batch Plants Satisfy<strong>in</strong>g Multiple<br />

Product Orders with Different Due-Dates.” Computers & Chemical Eng<strong>in</strong>eer<strong>in</strong>g 24, 2223–2245.<br />

Méndez, C.A., G.P. Henn<strong>in</strong>g, and J. Cerdá. (2001). “An MILP Cont<strong>in</strong>uous-Time Approach to Short-Term<br />

Schedul<strong>in</strong>g of Resource-Constra<strong>in</strong>ed Multistage Flowshop Batch Facilities.” Computers & Chemical<br />

Eng<strong>in</strong>eer<strong>in</strong>g 25, 701–711.<br />

Mockus, J., W. Eddy, A. Mockus, L. Mockus, and R.V. Reklaitis. (1997). Bayesian Heuristic Approach<br />

to Discrete and Global Optimization: Algorithms, Visualization, Software, and Applications. Kluwer<br />

Academic Publishers.<br />

Mockus, L. and G.V. Reklaitis. (1997). “Mathematical <strong>Programm<strong>in</strong>g</strong> Formulation for Schedul<strong>in</strong>g of Batch<br />

Operations Based on Nonuniform Time Discretization.” Computers & Chemical Eng<strong>in</strong>eer<strong>in</strong>g 21, 1147–<br />

1156.<br />

Mockus, L. and G.V. Reklaitis. (1999a). “Cont<strong>in</strong>uous Time Representation Approach to Batch and Cont<strong>in</strong>uous<br />

<strong>Process</strong> Schedul<strong>in</strong>g. 1. MINLP Formulation.” Industrial & Eng<strong>in</strong>eer<strong>in</strong>g Chemistry Research 38,<br />

197–203.<br />

Mockus, L. and G.V. Reklaitis. (1999b). “Cont<strong>in</strong>uous Time Representation Approach to Batch and Cont<strong>in</strong>uous<br />

<strong>Process</strong> Schedul<strong>in</strong>g. 2. Computational Issues.” Industrial & Eng<strong>in</strong>eer<strong>in</strong>g Chemistry Research 38,<br />

204–210.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!