메뉴 건너뛰기




Volumn 82, Issue 7, 2003, Pages 72-79

Crude oil blend scheduling optimization: An application with multimillion dollar benefits - Part 2

Author keywords

[No Author keywords available]

Indexed keywords

CRUDE PETROLEUM; MIXING; OPTIMIZATION; PETROLEUM PIPELINES; SCHEDULING;

EID: 0041346170     PISSN: 00188190     EISSN: None     Source Type: Trade Journal    
DOI: None     Document Type: Review
Times cited : (44)

References (14)
  • 1
    • 0003335806 scopus 로고    scopus 로고
    • Refinery short-term scheduling using continuous-time formulation - Crude oil operations
    • February
    • Jia, Z., M. Ierapctritou and J. D. Kelly, "Refinery short-term scheduling using continuous-time formulation - crude oil operations," Industrial Engineering Chemistry Research, February 2002.
    • (2002) Industrial Engineering Chemistry Research
    • Jia, Z.1    Ierapctritou, M.2    Kelly, J.D.3
  • 2
    • 0010986664 scopus 로고    scopus 로고
    • Algorithms for hybrid MILP/CP models for a class of optimization problems
    • Jain, V., and I. E. Grossmann, "Algorithms for hybrid MILP/CP models for a class of optimization problems," INFORMS Journal of Computing, 13, 258-276, 2001.
    • (2001) INFORMS Journal of Computing , vol.13 , pp. 258-276
    • Jain, V.1    Grossmann, I.E.2
  • 3
    • 0019585243 scopus 로고
    • A review of production scheduling
    • Graves, S. C., "A review of production scheduling," Operations Research, 29, 4, 646-675, 1981.
    • (1981) Operations Research , vol.29 , pp. 4
    • Graves, S.C.1
  • 4
    • 0041824985 scopus 로고    scopus 로고
    • The necessity of data reconciliation: Some practical issues
    • Chicago, Illinois, November
    • Kelly, J. D., "The necessity of data reconciliation: some practical issues," NPRA Computer Conference, Chicago, Illinois, November 2000.
    • (2000) NPRA Computer Conference
    • Kelly, J.D.1
  • 6
    • 0034631279 scopus 로고    scopus 로고
    • Rolling-horizon lot-sizing when setup times are sequence-dependent
    • Clark, A. R. and S. J. Clark, "Rolling-horizon lot-sizing when setup times are sequence-dependent," International Journal of Production Research, 38, 10, 2287-2308, 2000.
    • (2000) International Journal of Production Research , vol.38 , pp. 10
    • Clark, A.R.1    Clark, S.J.2
  • 10
    • 0037611127 scopus 로고    scopus 로고
    • Smooth-and-dive accelerator: A pre-milp primal heuristic applied to production scheduling problems
    • Kelly, J. D., "Smooth-and-dive accelerator: a pre-milp primal heuristic applied to production scheduling problems," Computers & Chemical Engineering, 27, 827-832, 2003.
    • (2003) Computers & Chemical Engineering , vol.27 , pp. 827-832
    • Kelly, J.D.1
  • 11
    • 0036883253 scopus 로고    scopus 로고
    • Chronological decomposition heuristic for scheduling: A divide & conquer method
    • Kelly, J.D., "Chronological decomposition heuristic for scheduling: a divide & conquer method," AIChE Journal, 48, 2995-2999, 2002.
    • (2002) AIChE Journal , vol.48 , pp. 2995-2999
    • Kelly, J.D.1
  • 13
    • 0020190760 scopus 로고
    • Nonlinear optimization by successive linear programming
    • Palacios-Gomez, F., L. Ladson and M. Enquist, "Nonlinear optimization by successive linear programming," Management Science, 28, 10, 1106, 1120, 1982.
    • (1982) Management Science , vol.28 , pp. 10
    • Palacios-Gomez, F.1    Ladson, L.2    Enquist, M.3


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