메뉴 건너뛰기




Volumn 29, Issue 6 SPEC. ISS., 2005, Pages 1277-1291

A hybrid MILP/CLP algorithm for multipurpose batch process scheduling

Author keywords

Constraint logic programming; MILP CLP algorithm; Process scheduling

Indexed keywords

ALGORITHMS; BATCH DATA PROCESSING; CONSTRAINT THEORY; MATERIALS BALANCE; MATHEMATICAL MODELS; PLANNING; PROBLEM SOLVING; SCHEDULING;

EID: 18244375235     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compchemeng.2005.02.024     Document Type: Conference Paper
Times cited : (47)

References (23)
  • 1
    • 0000397138 scopus 로고    scopus 로고
    • Branch and infer: A unifying framework for integer and finite domain constraint programming
    • A. Bockmayr, and T. Kasper Branch and infer: A unifying framework for integer and finite domain constraint programming INFORMS Journal on Computing 10 3 1998
    • (1998) INFORMS Journal on Computing , vol.10 , Issue.3
    • Bockmayr, A.1    Kasper, T.2
  • 2
    • 0035795519 scopus 로고    scopus 로고
    • An improved RTN continuous-time formulation for the short-term scheduling of multipurpose batch plants
    • P. Castro, A.P.F.D. Barbosa-Povoa, and H. Matos An improved RTN continuous-time formulation for the short-term scheduling of multipurpose batch plants Industrial and Engineering Chemistry Research 40 2001 2059 2068
    • (2001) Industrial and Engineering Chemistry Research , vol.40 , pp. 2059-2068
    • Castro, P.1    Barbosa-Povoa, A.P.F.D.2    Matos, H.3
  • 4
    • 0036568989 scopus 로고    scopus 로고
    • A simple new continuous-time formulation for short-term scheduling of multipurpose batch processes
    • N.F. Giannelos, and M.C. Georgiadis A simple new continuous-time formulation for short-term scheduling of multipurpose batch processes Industrial and Engineering Chemistry Research 41 2002 2178 2184
    • (2002) Industrial and Engineering Chemistry Research , vol.41 , pp. 2178-2184
    • Giannelos, N.F.1    Georgiadis, M.C.2
  • 5
    • 0037111002 scopus 로고    scopus 로고
    • Decomposition techniques for multistage scheduling using mixed-integer and constraint programming
    • I. Harjunkoski, and I.E. Grossmann Decomposition techniques for multistage scheduling using mixed-integer and constraint programming Computers and Chemical Engineering 26 11 2002 1533 1552
    • (2002) Computers and Chemical Engineering , vol.26 , Issue.11 , pp. 1533-1552
    • Harjunkoski, I.1    Grossmann, I.E.2
  • 6
    • 0346548060 scopus 로고    scopus 로고
    • An example of integrating constraint programming and mathematical programming
    • S. Heipcke An example of integrating constraint programming and mathematical programming Electronic Note in Discrete Mathematics 1 1999
    • (1999) Electronic Note in Discrete Mathematics , vol.1
    • Heipcke, S.1
  • 7
    • 0034660721 scopus 로고    scopus 로고
    • Scheduling of pipeless batch plants using constraint satisfaction techniques
    • W. Huang, and P.W.H. Chung Scheduling of pipeless batch plants using constraint satisfaction techniques Computers and Chemical Engineering 24 2000 283 377
    • (2000) Computers and Chemical Engineering , vol.24 , pp. 283-377
    • Huang, W.1    Chung, P.W.H.2
  • 8
    • 0032216021 scopus 로고    scopus 로고
    • Effective continuous time formulation for short-term scheduling. 1. Multipurpose batch processes
    • M.G. Ierapetritou, and C.A. Floudas Effective continuous time formulation for short-term scheduling. 1. multipurpose batch processes Industrial and Engineering Chemistry Research 37 1998 4341 4359
    • (1998) Industrial and Engineering Chemistry Research , vol.37 , pp. 4341-4359
    • Ierapetritou, M.G.1    Floudas, C.A.2
  • 10
    • 4243532938 scopus 로고
    • Constraint logic programming: A survey
    • J. Jaffar, and M.H. Maher Constraint logic programming: A survey Journal of Logic Programming 19 20 1994 503 581
    • (1994) Journal of Logic Programming , vol.19 , Issue.20 , pp. 503-581
    • Jaffar, J.1    Maher, M.H.2
  • 11
    • 0010986664 scopus 로고    scopus 로고
    • Algorithms for hybrid MILP/CLP models for a class of optimization problems
    • V. Jain, and I.E. Grossmann Algorithms for hybrid MILP/CLP models for a class of optimization problems INFORMS Journal on Computing 13 4 2001 377 383
    • (2001) INFORMS Journal on Computing , vol.13 , Issue.4 , pp. 377-383
    • Jain, V.1    Grossmann, I.E.2
  • 12
    • 0034661344 scopus 로고    scopus 로고
    • Hybrid mixed integer/constraint logic programming strategies for solving scheduling and combinatorial optimization problems
    • V. Jain, I. Harjunkoski, and I.E. Grossmann Hybrid mixed integer/constraint logic programming strategies for solving scheduling and combinatorial optimization problems Computers and Chemical Engineering 24 2000 337 343
    • (2000) Computers and Chemical Engineering , vol.24 , pp. 337-343
    • Jain, V.1    Harjunkoski, I.2    Grossmann, I.E.3
  • 14
    • 0035852008 scopus 로고    scopus 로고
    • A novel continuous-time MILP formulation for multipurpose batch plants. 1. Short-term scheduling
    • T. Majozi, and X.X. Zhu A novel continuous-time MILP formulation for multipurpose batch plants. 1. Short-term scheduling Industrial and Engineering Chemistry Research 40 2001 5935 5943
    • (2001) Industrial and Engineering Chemistry Research , vol.40 , pp. 5935-5943
    • Majozi, T.1    Zhu, X.X.2
  • 15
    • 77955822957 scopus 로고    scopus 로고
    • A hybrid MILP/CLP decomposition approach for the continuous time scheduling of multipurpose batch plants
    • submitted for publication
    • Maravelias, C. T., & Grossmann, I. E. (2003). A hybrid MILP/CLP decomposition approach for the continuous time scheduling of multipurpose batch plants. Computers and Chemical Engineering, submitted for publication.
    • (2003) Computers and Chemical Engineering
    • Maravelias, C.T.1    Grossmann, I.E.2
  • 18
    • 50549093656 scopus 로고    scopus 로고
    • Scheduling of continuous processes using constraint-based search: An application to branch and bound
    • Rodrigues, L. C. A., Carnieri, R., & Neves, F., Jr. (2002). Scheduling of continuous processes using constraint-based search: An application to branch and bound. In Proceedings of the European Symposium on CAPE-12 (pp. 751-756).
    • (2002) Proceedings of the European Symposium on CAPE-12 , pp. 751-756
    • Rodrigues, L.C.A.1    Carnieri, R.2    Neves Jr., F.3
  • 19
    • 18244372276 scopus 로고
    • The optimal operation of mixed production facilities - A general formulation for the solution
    • R.W.H. Sargent, and X. Zhang The optimal operation of mixed production facilities - A general formulation for the solution Computers and Chemical Engineering 6 7 1995 897 904
    • (1995) Computers and Chemical Engineering , vol.6 , Issue.7 , pp. 897-904
    • Sargent, R.W.H.1    Zhang, X.2
  • 21
    • 0027545175 scopus 로고
    • A general algorithm for short-term scheduling of batch operations - II Computational issues
    • N. Shah, C.C. Pantelides, and R.W.H. Sargent A general algorithm for short-term scheduling of batch operations - II Computational issues Computers and Chemical Engineering 17 1993 229 244
    • (1993) Computers and Chemical Engineering , vol.17 , pp. 229-244
    • Shah, N.1    Pantelides, C.C.2    Sargent, R.W.H.3
  • 22
    • 0035247584 scopus 로고    scopus 로고
    • Comparison of constraint logic programming and distributed problem solving: A case study for interactive, efficient and practicable job-shop scheduling
    • D. Trentesaux, P. Pesin, and C. Tahon Comparison of constraint logic programming and distributed problem solving: A case study for interactive, efficient and practicable job-shop scheduling Computers and Industrial Engineering 39 2001 187 211
    • (2001) Computers and Industrial Engineering , vol.39 , pp. 187-211
    • Trentesaux, D.1    Pesin, P.2    Tahon, C.3


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