메뉴 건너뛰기




Volumn 42, Issue 11, 2003, Pages 2365-2380

An improved MILP formulation for scheduling multiproduct, multistage batch plants

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; INDUSTRIAL PLANTS; INTEGER PROGRAMMING; LINEAR PROGRAMMING;

EID: 0037503184     PISSN: 08885885     EISSN: None     Source Type: Journal    
DOI: 10.1021/ie020180g     Document Type: Review
Times cited : (107)

References (16)
  • 2
    • 0002259729 scopus 로고
    • Learning to solve process scheduling problems: The role of rigorous knowledge acquisition frameworks
    • Rippin, D. W. T., Hale J. C., Davis, J. F., Eds.; CACHE: Austin, TX
    • Zentner, M. G.; Pekny, J. F. Learning To Solve Process Scheduling Problems: The Role Of Rigorous Knowledge Acquisition Frameworks. In Foundations of Computer Aided Process Operations; Rippin, D. W. T., Hale J. C., Davis, J. F., Eds.; CACHE: Austin, TX, 1994.
    • (1994) Foundations of Computer Aided Process Operations
    • Zentner, M.G.1    Pekny, J.F.2
  • 4
    • 0027545176 scopus 로고
    • A general algorithm for short-term scheduling of batch operations. I. MILP formulation
    • Kondili, E.; Pantelides, C. C.; Sargent, R. W. H. A General Algorithm for Short-term Scheduling of Batch Operations. I. MILP Formulation. Comput. Chem. Eng. 1993, 17, 211-227.
    • (1993) Comput. Chem. Eng. , vol.17 , pp. 211-227
    • Kondili, E.1    Pantelides, C.C.2    Sargent, R.W.H.3
  • 5
    • 0027545175 scopus 로고
    • A general algorithm for short-term scheduling of batch operations. II. Computational issues
    • Shah, N.; Pantelides, C. C.; Sargent, R. W. H. A General Algorithm for Short-term Scheduling of Batch Operations. II. Computational Issues. Comput. Chem. Eng. 1993, 17, 229-244.
    • (1993) Comput. Chem. Eng. , vol.17 , pp. 229-244
    • Shah, N.1    Pantelides, C.C.2    Sargent, R.W.H.3
  • 6
    • 0030174820 scopus 로고    scopus 로고
    • The optimal operation of mixed production facilities-A general formulation and some approaches for the solution
    • Zhang, X.; Sargent, R. W. H. The Optimal Operation of Mixed Production Facilities-A General Formulation and Some Approaches for the Solution. Comput. Chem. Eng. 1996, 20, 897-904.
    • (1996) Comput. Chem. Eng. , vol.20 , pp. 897-904
    • Zhang, X.1    Sargent, R.W.H.2
  • 8
    • 0029717404 scopus 로고    scopus 로고
    • A simple continuous-time process scheduling formulation a novel solution algorithm
    • Schilling, G.; Pantelides, C. C. A Simple Continuous-time Process Scheduling Formulation and a Novel Solution Algorithm. Comput. Chem. Eng. 1996, 20, S1221-S1226.
    • (1996) Comput. Chem. Eng. , vol.20
    • Schilling, G.1    Pantelides, C.C.2
  • 9
    • 0032216021 scopus 로고    scopus 로고
    • Effective continuous-time formulation for short-term scheduling. 1. Multipurpose batch processes
    • Ierapetritou, M. G.; Floudas, C. A. Effective Continuous-Time Formulation for Short-term Scheduling. 1. Multipurpose Batch Processes. Ind. Eng. Chem. Res. 1998, 37, 4341-4359.
    • (1998) Ind. Eng. Chem. Res. , vol.37 , pp. 4341-4359
    • Ierapetritou, M.G.1    Floudas, C.A.2
  • 10
    • 0031140322 scopus 로고    scopus 로고
    • A mixed-integer linear programming model for short-term scheduling of single-stage multiproduct batch plants with parallel lines
    • Cerda, J.; Henning, G. P.; Grossmann, I. E. A Mixed-Integer Linear Programming Model for Short-Term Scheduling of Single-Stage Multiproduct Batch Plants with Parallel Lines. Ind. Eng. Chem. Res. 1997, 36, 1695-1707.
    • (1997) Ind. Eng. Chem. Res. , vol.36 , pp. 1695-1707
    • Cerda, J.1    Henning, G.P.2    Grossmann, I.E.3
  • 11
    • 0034307307 scopus 로고    scopus 로고
    • Optimal scheduling of batch plants satisfying multiple product orders with different due dates
    • Mendez, C. A.; Henning, G. P.; Cerda, J. Optimal Scheduling of Batch Plants Satisfying Multiple Product Orders with Different Due Dates. Comput. Chem. Eng. 2000, 24, 2223-2245.
    • (2000) Comput. Chem. Eng. , vol.24 , pp. 2223-2245
    • Mendez, C.A.1    Henning, G.P.2    Cerda, J.3
  • 12
    • 0001690679 scopus 로고
    • A continuous time mixed integer linear programming model for short-term scheduling of multistage batch plants
    • Pinto, J. M.; Grossmann, I. E. A Continuous Time Mixed Integer Linear Programming Model for Short-Term Scheduling of Multistage Batch Plants. Ind. Eng. Chem. Res. 1995, 34, 3037-3051.
    • (1995) Ind. Eng. Chem. Res. , vol.34 , pp. 3037-3051
    • Pinto, J.M.1    Grossmann, I.E.2
  • 13
    • 0002584921 scopus 로고    scopus 로고
    • An alternate MILP model for short-term scheduling of batch plants with preordering constraints
    • Pinto, J. M.; Grossmann, I. E. An Alternate MILP Model for Short-Term Scheduling of Batch Plants with Preordering Constraints. Ind. Eng. Chem. Res. 1996, 35, 338-342.
    • (1996) Ind. Eng. Chem. Res. , vol.35 , pp. 338-342
    • Pinto, J.M.1    Grossmann, I.E.2
  • 14
    • 0034661353 scopus 로고    scopus 로고
    • A novel MILP formulation for short-term scheduling of multistage multi-product batch plants
    • Huí, C. W.; Gupta, A. A novel MILP formulation for short-term scheduling of multistage multi-product batch plants. Comput. Chem. Eng. 2000, 24, 1611-1617.
    • (2000) Comput. Chem. Eng. , vol.24 , pp. 1611-1617
    • Huí, C.W.1    Gupta, A.2
  • 15
    • 0034387803 scopus 로고    scopus 로고
    • A novel MILP formulation for short-term scheduling of multi-stage multi-product batch plants with sequence-dependent constraints
    • Huí, C. W.; Gupta, A.; Meulen, H. A. J. A novel MILP formulation for short-term scheduling of multi-stage multi-product batch plants with sequence-dependent constraints. Comput. Chem. Eng. 2000, 24, 2705-2717.
    • (2000) Comput. Chem. Eng. , vol.24 , pp. 2705-2717
    • Huí, C.W.1    Gupta, A.2    Meulen, H.A.J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.