Abstract
Scheduling of refineries is a hard hybrid problem. Application of the Constraint Envelope Scheduling (CES) approach required development of the Gradient Constraint Equation Subdivision (GCES) algorithm, a novel global feasibility solver for the large system of quadratic constraints that arise as subproblems. We describe the implemented solver and its integration into the scheduling system. We include discussion of pragmatic design tradeoffs critically important to achieving reasonable performance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Boddy, M., Carciofini, J., Hadden, G.: Scheduling with Partial Orders and a Causal Model. In: Proceedings of the Space Applications and Research Workshop, Johnson Space Flight Center (August 1992)
Boddy, M., Goldman, R.: Empirical Results on Scheduling and Dynamic Backtracking. In: Proceedings of the International Symposium on Artificial Intelligence, Robotics, and Automation for Space, Pacadena, CA (1994)
Boddy, M., White, J., Goldman, R., Short, N.: Integrated Planning and Scheduling for Earth Science Data Processing. In: Hostetter, C.F. (eds.) Proceedings of the 1995 Goddard Conference on Space Applications of Artificial Intelligence and Emerging Information Technologies, pp. 91–101. NASA Conference Publication 3296 (1995)
Boddy, M., Krebsbach, K.: Hybrid Reasoning for Complex Systems. In: Fall Symposium on Model-directed Autonomous Systems (1997)
Cucker, F., Smale, S.: Complexity Estimates Depending on Condition Number and Round-off Error. Jour. of the Assoc. of Computing Machinery 46, 113–184 (1999)
Goldman, R., Boddy, M.: Constraint-Based Scheduling for Batch Manufacturing. IEEE Expert (1997)
Heipcke, S.: Combined Modeling and Problem Solving in Mathematical Pro- gramming and Constraint Programming, PhD Thesis, School of Business, University of Buckingham (1999)
Hooker, J.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, John & Sons, Chichester (2000)
Jansson, C.: Rigorous Error Bounds for the Optimal Value of Linear Programming Problems. In: Bliek, C., Jermann, C., Neumaier, A. (eds.) COCOS 2002. LNCS, vol. 2861, Springer, Heidelberg (2003)
Kearfott, R.: Rigorous Global Search: Continuous Problems. Kluwer Academic Publishers, Dordrecht (1996)
Lee, S., Grossmann, I.: New Algorithms for Nonlinear Generalized Disjunctive Programming. Computers and Chem. Engng. 24(9-10), 2125–2141 (2000)
Moore, R.: Methods and Applications of Interval Analysis, by Moore, R.E., Society for Industrial & Applied Mathematics, Philadelphia (1979)
Smith, B., Brailsford, S., Hubbard, P., Williams, H.: The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared. In: Working Notes of the Joint Workshop on Artificial Intelligence and Operations Research, Timberline, OR (1995)
Van Hentenryck, P., McAllister, D., Kapur, D.: Solving Polynomial Sys- tems Using a Branch and Prune Approach. SIAM Journal on Numerical Analysis 34(2) (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boddy, M.S., Johnson, D.P. (2003). A New Method for the Global Solution of Large Systems of Continuous Constraints. In: Bliek, C., Jermann, C., Neumaier, A. (eds) Global Optimization and Constraint Satisfaction. COCOS 2002. Lecture Notes in Computer Science, vol 2861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39901-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-39901-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20463-3
Online ISBN: 978-3-540-39901-8
eBook Packages: Springer Book Archive