{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:14:36Z","timestamp":1742948076188,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540218364"},{"type":"electronic","value":"9783540246640"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24664-0_1","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"1-20","source":"Crossref","is-referenced-by-count":14,"title":["Using MILP and CP for the Scheduling of Batch Chemical Processes"],"prefix":"10.1007","author":[{"given":"Christos T.","family":"Maravelias","sequence":"first","affiliation":[]},{"given":"Ignacio E.","family":"Grossmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Maravelias, T.C., Grossmann, I.E.: A Hybrid MILP\/CP Decomposition Approach for the Scheduling of Batch Plants. In: Proceedings of CP-AI-OR 2003, Montreal, Canada (2003)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Maravelias, C.T., Grossmann, I.E.: A Hybrid MILP\/CP Decomposition Approach for the Short Term Scheduling of Multipurpose Batch Plants. To appear in Comput Chem. Eng. (2004)","DOI":"10.1016\/j.compchemeng.2004.03.016"},{"key":"1_CR3","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"2001","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice Hall, Englewood Cliffs (2001)"},{"key":"1_CR4","unstructured":"Reklaitis, G.V.: Overview of scheduling and planning of batch process operations. In: NATO Advanced Study Institute- Batch Process Systems Engineering, Antalya, Turkey (1992)"},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0098-1354(93)85002-4","volume":"17","author":"D.W.T. Rippin","year":"1993","unstructured":"Rippin, D.W.T.: Batch process systems engineering: a retrospective and prospective review. Comput. Chem. Eng.\u00a017, S1\u2013S13 (1993)","journal-title":"Comput. Chem. Eng."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1023\/A:1018929829086","volume":"81","author":"J. Pinto","year":"1998","unstructured":"Pinto, J., Grossmann, I.E.: Assignment and Sequencing Models for the Scheduling of Chemical Processes. Annals of Operations Research\u00a081, 433\u2013466 (1998)","journal-title":"Annals of Operations Research"},{"key":"1_CR7","unstructured":"Shah, N.: Single- and multisite planning and scheduling: Current status and future challenges. In: AIChE Symposium Series, vol.\u00a094, p. 75 (1998)"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0098-1354(93)80015-F","volume":"17","author":"E. Kondili","year":"1993","unstructured":"Kondili, E., Pantelides, C.C., Sargent, R.: A General Algorithm for Short-Term Scheduling of Batch Operations - I. MILP Formulation. Comput. Chem. Eng.\u00a017, 211\u2013227 (1993)","journal-title":"Comput. Chem. Eng."},{"key":"1_CR9","unstructured":"Pantelides, C.C.: Unified Frameworks for the Optimal Process Planning and Scheduling. In: Proceedings on the Second Conference on Foundations of Computer Aided Operations, pp. 253\u2013274 (1994)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1016\/0098-1354(96)00211-6","volume":"20","author":"G. Schilling","year":"1996","unstructured":"Schilling, G., Pantelides, C.C.: A Simple Continuous-Time Process Scheduling Formulation and a Novel Solution Algorithm. Comput. Chem. Eng.\u00a020, S1221\u20131226 (1996)","journal-title":"Comput. Chem. Eng."},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1016\/0098-1354(95)00186-7","volume":"20","author":"X. Zhang","year":"1996","unstructured":"Zhang, X., Sargent, R.W.H.: The Optimal Operation of Mixed Production Facilities - General Formulation and Some Approaches for the Solution. Comput. Chem. Eng.\u00a020, 897\u2013904 (1996)","journal-title":"Comput. Chem. Eng."},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1021\/ie970311r","volume":"38","author":"L. Mockus","year":"1999","unstructured":"Mockus, L., Reklaitis, G.V.: Continuous Time Representation Approach to Batch and Continuous Process Scheduling. 1. MTNLP Formulation. Ind. Eng. Chem. Res.\u00a038, 197\u2013203 (1999)","journal-title":"Ind. Eng. Chem. Res."},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"2059","DOI":"10.1021\/ie000683r","volume":"40","author":"P. Castro","year":"2001","unstructured":"Castro, P., Barbosa-Povoa, A.P.F.D., Matos, H.: An Improved RTN Continuous-Time Formulation for the Short-term Scheduling of Multipurpose Batch Plants. Ind. Eng. Chem. Res.\u00a040, 2059\u20132068 (2001)","journal-title":"Ind. Eng. Chem. Res."},{"issue":"13","key":"1_CR14","doi-asserted-by":"publisher","first-page":"3056","DOI":"10.1021\/ie020923y","volume":"42","author":"C.T. Maravelias","year":"2003","unstructured":"Maravelias, C.T., Grossmann, I.E.: A New General Continuous-Time State Task Network Formulation for the Short-Term Scheduling of Multipurpose Batch Plants. Ind. Eng. Chem. Res.\u00a042(13), 3056\u20133074 (2003)","journal-title":"Ind. Eng. Chem. Res."},{"key":"1_CR15","unstructured":"ILOG OPL Studio 3.5: The Optimization Language, ILOG Inc. (2001)"},{"key":"1_CR16","unstructured":"ILOG OPL Studio 3.5 :The User\u2019s Manual, ILOG Inc. (2001)"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"Adams, J., Balas, E., Zawack, D.: The Shifting Bottleneck Procedure for Job Shop Scheduling. Management Science\u00a034, 391\u2013401 (1988)","journal-title":"Management Science"},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E. Balas","year":"1998","unstructured":"Balas, E., Vazacopoulos, A.: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling. Management Science\u00a044(2), 262\u2013275 (1998)","journal-title":"Management Science"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"3013","DOI":"10.1021\/ie9807809","volume":"38","author":"V. Jain","year":"1999","unstructured":"Jain, V., Grossmann, I.E.: Resource-constrained Scheduling of Tests in New Product Development. Ind. Eng. Chem. Res.\u00a038, 3013\u20133026 (1999)","journal-title":"Ind. Eng. Chem. Res."},{"key":"1_CR20","unstructured":"Bockmayr, A., Pisaruk, N.: Detecting Infeasibility and Generating Cuts for MTP Using CP. In: Proceedings of CP-AI-OR 2003, Montreal, Canada (2003)"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"Balas, E.: Facets of the Knapsack Polytope. Mathematical Programming\u00a08, 146\u2013164 (1975)","journal-title":"Mathematical Programming"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"Wolsey, L.A.: Faces for a Linear Inequality in 0-1 Variables. Mathematical Programming\u00a08, 165\u2013178 (1975)","journal-title":"Mathematical Programming"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1016\/S0098-1354(02)00100-X","volume":"26","author":"I. Harjunkoski","year":"2002","unstructured":"Harjunkoski, I., Grossmann, I.E.: Decomposition Techniques for Multistage Scheduling Problems Using Mixed-Integer and Constrained Programming Methods. Comput. Chem. Eng.\u00a026, 1533\u20131552 (2002)","journal-title":"Comput. Chem. Eng."}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24664-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T10:18:52Z","timestamp":1674814732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}