Short-term scheduling and recipe optimization of blending processes
|
|
- Dana Tucker
- 7 years ago
- Views:
Transcription
1 Computers and Chemical Engineering 25 (2001) Short-term scheduling and recipe optimization of blending processes Klaus Glismann, Günter Gruhn * Department of Process and Plant Engineering, Technical Uniersity Hamburg-Harburg, Schwarzenbergstrasse 95, D Hamburg, Germany Received 10 May 2000; accepted 5 January 2001 Abstract The main objective of this paper is to develop an integrated approach to coordinate short-term scheduling of multi-product blending facilities with nonlinear recipe optimization. The proposed strategy is based on a hierarchical concept consisting of three business levels: Long-range planning, short-term scheduling and process control. Long-range planning is accomplished by solving a large-scale nonlinear recipe optimization problem (multi-blend problem). Resulting blending recipes and production volumes are provided as goals for the scheduling level. The scheduling problem is formulated as a mixed-integer linear program derived from a resource-task network representation. The scheduling model permits recipe changeovers in order to utilize an additional degree of freedom for optimization. By interpreting the solution of the scheduling problem, new constraints can be imposed on the previous multi-blend problem. Thus bottlenecks arising during scheduling are considered already on the topmost long-range planning level. Based on the outlined approach a commercial software system has been designed to optimize the operation of in-line blending and batch blending processes. The application of the strategy and software is demonstrated by a detailed case study Elsevier Science Ltd. All rights reserved. Keywords: Blending; Short-term scheduling; Recipe optimization; Mixed integer linear programming Nomenclature B g,g + N B N Cn N I N P N R N T V Cm,n V Pn V Pn,i V Pn,i w Cm W k,i w Pn batch size, resp. throughput of blender k during interval i with task l negative/positive deviation from a goal, g 0, g + 0 number of blenders number of components for product n number of time intervals number of products number of recipes minimum running time of a recipe in terms of intervals volume of component m for product n volume of product n volume of product n in interval i goal volume of product n in interval i cost of component m availability of a blender k during time interval i, binary variable price of product n * Corresponding author. Tel.: ; fax: address: gruhn@tuhh.de (G. Gruhn) /01/$ - see front matter 2001 Elsevier Science Ltd. All rights reserved. PII: S (01)
2 628 K. Glismann, G. Gruhn / Computers and Chemical Engineering 25 (2001) Introduction This paper presents a strategy to coordinate shortterm scheduling of industrial blending processes with nonlinear recipe optimization. The focus is on blending processes but the strategy is also applicable to other multi-product processes having typical criterions of blending processes. Blending processes themselves can be characterized by the following key features: Blending stocks of widely different properties are supplied continuously or in batches. They are sent to intermediate tanks. Properties and volume flow raterates of the components usually vary over time. The different components are blended according to recipes in an in-line blender or in a batch tank. The blends are stored in tanks and/or are delivered directly. The recipes must guarantee an on-spec product with minimum give-away. Product property limits are often restricted by law. Similar products can be blended by applying different recipes. A common field for blending processes is the production of gasoline and gas oil in refineries. Nevertheless, blending applications can also be found in several variations throughout all branches of process industry. Today s widespread approach for the scheduling of such processes is to use intuitive graphical user interfaces combined with discrete-event simulators (Bodington, 1996). Heuristics related to operating policies can be incorporated to speed exploration of alternate policies. However, each scenario still has to be constructed and rated manually. Mathematical programming techniques for shortterm scheduling of multi-product plants have been extensively studied in the past years (Reklaitis, 1995), but not much is reported about the application of these techniques to the short-term scheduling of blending processes. Even though the process has a simple structure and therefore should be well suited for creating an appropriate optimization model. The scheduling of crude oil can be named as a related application that is mentioned in the literature (Shah, 1996; Lee, Pinto, Fig. 1. Hierarchical management levels. Grossmann & Park, 1996). An approach based on a mathematical model offers a user-friendly treatment of the underlying scheduling problem: User-defined constraints and objectives can be included in a straightforward way. Thus, in this paper a strategy based on a combined nonlinear programming (NLP) and mixed-integer linear programming (MILP) formulation is developed. Planning the operation of blending processes covers proper coordination of feedstock and products with market requirements and economics. However, shortterm scheduling of blending processes is more complicated than scheduling of most other processes because of the option to blend a product in many different ways: Consideration of recipe optimization and shortterm scheduling within an integrated approach becomes necessary. In order to avoid arising nonlinearities in scheduling, an iterative scheduling strategy is developed so that the problem can still be modeled favorably as a MILP based on a resource-task network (RTN) representation (Pantelides, 1994). Nonlinear recipe optimization is carried out separately within long-range planning but can be integrated into the overall strategy. 2. Basic planning and scheduling approach Within each company of process industry three hierarchical business areas can be identified (Polke, 1994): planning, scheduling, and control (Fig. 1). Planning and operating of blending processes can be understood according to these levels. This hierarchical model can be described by the following features: Detailing and reliability of information increases from top to bottom. The longest planning horizon can be found at the top. The horizon shortens rapidly, when moving down towards the process control level. Complex planning and scheduling tasks are broken into simpler ones that are solved within each level. Results of each level are forwarded to the attached levels (in both directions). The developed strategy is built up according to this hierarchical view. A long-range plan for blending processes usually covers a horizon of about one month. Therein roughly scheduled customer demands are balanced with the available blending component volumes. State of the art models are multi-period models that consider multiple blends simultaneously (multi-blend optimization) (Rigby, Lasdon & Waren, 1995). They embody a nonlinear recipe optimization problem. During the optimization run the running times of each operation mode for all upstream facilities (e.g. the reformer) can also be determined.
3 K. Glismann, G. Gruhn / Computers and Chemical Engineering 25 (2001) Fig. 2. Short-term scheduling strategies. At this level, a large-scale NLP has to be set up and solved. The usual objective is maximum profit given by the sum of sold products minus the value of spent feedstock: N P N Cn max n=1 wpn V Pn w Cm V m=1 Cn,m. (1) The free variables are, the component volumes related to each product and each period, the running times of each possible operation mode for the upstream facilities. Constraints arise from the blending process structure (flowsheet, tank, and blender data, etc.), the forecast on the component production defined by each operation mode for the upstream facilities, the product delivery-dates, the nonlinear and linear blending models, and the planning periods, given by product demands and specific planning priorities. The obtained solution is transferred to the short-term scheduling level: the calculated product quantities are the goal quantities that have to be met applying the optimized recipes. At this short-term level, specific attention is paid to the delivery-dates and the allocation of the blenders. The planning horizon is shortened to one week. The main scheduling priorities are (in the given order): 1. to obtain a feasible schedule satisfying all product demands, 2. to meet the goals set by the long-range planning, and 3. to optimize the operation of all blending facilities itself (e.g. to minimize product and recipe changeovers). An appropriate MILP formulation derived from a RTN process representation can be developed in order to fulfill the named goals. The most important feature of this model is that alternate recipes for each product and period can be provided. A recipe changeover becomes a free variable for optimization. So, which one of the alternative recipes is preferred in a particular situation results from the optimization run. The mathematical model will be described in detail within the next chapter. After processing the scheduling problem deviations from the goals can occur because of the following reasons: The more precisely considered delivery-dates in scheduling require an earlier production, because within long-range planning product demands were defined for periods and not for precise deliverydates. The necessary number of changeover operations can not be determined within long-range planning. No equipment item can be assigned to different operations at the same time anymore. Simultaneous allocation of equipment can not be excluded within long-range planning. In long-range planning, material is balanced according to the defined periods. A violation of given tank limits inside a period can not be determined until scheduling is done. When one of the given goals can not be met within scheduling actions according to three different strategies are available: (a) The resulting feasible schedule is accepted in spite of the deviations. The closest approximation to all given goals can be guaranteed mathematically. (b)within scheduling a modified problem is constructed in order to shift deviations between goals. This can be accomplished by applying different weights to each single goal. (c) Finally a strategy coordinating short-term scheduling with long-range planning can be applied. The scheduling level can be left and a modified multiblend problem can be solved utilizing knowledge of the bottleneck in scheduling. The new goals for scheduling are more likely to be met. This strategy leads to an integrated optimization of planning and scheduling. Selection between the given strategies depends mainly on the current situation and the given scheduling priorities. Fig. 2 illustrates all alternatives explained above. After passing the scheduling level, a schedule which can be visualized graphically as a Gantt-chart is recovered. Set-points for the process control level can be derived from it. The blending process itself is carried out within this operative level. The received operating instructions are transformed into control strategies for the process control system. Advanced control of all blenders, respectively blend tanks, adjusts their opera-
4 630 K. Glismann, G. Gruhn / Computers and Chemical Engineering 25 (2001) tion to the given set-points taking into account the current situation that can differ from the assumed. 3. Scheduling model The scheduling model is based on a RTN representation. Fig. 3 shows an example of a simple in-line blending process with 1 blender, 2 products and 3 components. The mathematical model can by characterized by the following key features: Time is modeled according to a uniform discretization. Tasks can be given a temporary validity in order to adjust scheduling to the periods of long-range planning. The maximum count of a resource is 1. Resources with similar characteristics are treated as different resources. This assumption simplifies resource balances. To formulate a mathematical model for optimization requires a deliberate consideration of how time can be modeled. For semi-continuously operated blending processes the duration of each single blending operation is not known a priori. The same is true for batch blending processes with variable batch sizes. However, a continuous-time problem formulation is not appropriate since a nonlinear mixed-integer program would result from modeling the continuously refilled blending component tanks. The application of a model based on uniform discretization of time is less crucial because the most significant simplification can be lessened: previous fixing of the duration for an individual blending operation is necessary but by subdividing a blending order into several smaller tasks corresponding to the discretization of time, blending becomes more flexible. In order to avoid unreasonable short running times of a recipe and too many recipe changeovers constraints can be added to enforce a minimum running time for particular recipes on a blender k, Eqs. (2) (4). N T (N T 1) W k,1 W k,i, (2) i=2 Fig. 3. RTN of a typical blending process. i +2+N T (N T 1)W k,i+1 (N T 1)W k,i + W k,i i =i+3 i=1,2,,(n I N T +1), (3) W k,i+1 W k,i i{iin I N T +1} (4) Forced recipe changeovers due to the periods defined within long-range planning are not restrained by these constraints. Additionally, the technique of goal programming is applied in order to minimize changes in throughput of all blenders between intervals. The objective function (minimization) is extended by the term given in Eq. (5). N B N I 1 k=1 i=1 N R l=1 (ḡ + +ḡ ), (5) ḡ + and ḡ are the positive and negative deviations from a given goal, defined by Eq. (6) 0=(B B k,i+1,l )+ḡ + ḡ k=1,2,,n B ; i=1,2,,n I, l=1,2,,n R. (6) By making use of a RTN representation, it is possible to define a different product recipe for each period defined in long-range planning. This is achieved by providing different tasks at different points of time. This temporary validity contributes to the operating strategy of running the blending process optimally as initially planned. Even better fulfillment of the targets of a long-range plan can be accomplished by providing alternative recipes for each product and period. Calculation of these alternative recipes is carried out in the multi-blend optimization on the long-range planning level. But it is not possible to calculate additional recipes in advance since the planning model is incapable of taking scheduling tasks into account. So these recipes are added to the second scheduling problem after deviations occurred in the first problem following the proposed coordination strategy. 4. Case study In this section, an example is presented to illustrate the application of the short-term scheduling model together with the proposed strategy to coordinate scheduling with recipe optimization. The blending process example is defined by 2 operation modes of the upstream facilities, 3 products, stored in 3 tanks, 9 components, 6 are stored in intermediate tanks, 3 must be processed immediately, 2 in-line blenders capable of blending all 3 products. The process structure is given by the RTN graph shown in Fig. 4. Table 1 details all tank data regarding components and products. Components 7, 8, and 9 do not have any storage tanks.
5 K. Glismann, G. Gruhn / Computers and Chemical Engineering 25 (2001) Fig. 4. RTN graph of the blending process. Upstream facilities can be operated in 2 different modes, leading to the component volume flow rates listed in Table 2. The flow rates are assumed different according to the 2 periods given by long-range planning.maximum throughput of all blenders is 90 m 3 /h. Table 3 sums up product demands and tank volume goals given by long-range planning for an overall future period of 7 days. Data is defined for two distinct points of time: The end of the second day and the end of the seventh day. For fulfillment of the 9 product property values 8 different recipes are available: for each period and product one different recipe is provided. Product C can only be blended during operation mode 2 because
6 632 K. Glismann, G. Gruhn / Computers and Chemical Engineering 25 (2001) Table 1 Tank data Material Minimum volume (m 3 ) Maximum volume (m 3 ) Initial volume (m 3 ) Component Component Component Component Component Component Product A Product B Product C component 7 is needed which is available only during this mode. To guarantee immediate consumption of component 8 and 9 product A must be blended simultaneously with product C, utilizing a second recipe for product A. The RTN graph is formulated as a MILP as explained in the last section. Product demands are modeled by constraints and must be fulfilled entirely to obtain a feasible solution. Eighty four time intervals of equal duration (2 h) are defined. Product changeovers from A to B or from A to C (and vice versa) are possible but require 6 h. The same is true for switching between operation modes. Changeovers from product B to C and from C to B do not require extra time. The objective is to minimize absolute deviations from the given tank volume goals. A second term is supplied in order to minimize changes in throughput of all blenders between intervals (Eq. (5)), the weight w is set to 0.001, Eq. (7). The goals are defined by Eq. (8) and Eq. (6). N P min N I n=1i=1 (g + n,i +g n,i )+w N B N I 1 N R k=1 i=1 l=1 (ḡ + +ḡ ), (7) 0=(V Pn,i V Pn,i )+g + n,i g n,i n=1,2,,n P ; i=1,2,,n I. (8) The final problem consists of equations and variables variables are binary ones. XPRESS-MP Release 11 (Dash Associates Limited, 1999) is used to solve the MILP. After CPU seconds, an objective value of is obtained and the solver is stopped. The best bound is The resulting schedule and the tank volume development of all products are shown in Figs. 5 and 6. Fig. 7 details the tank volume development of all components. All product demands can be satisfied. In spite of utilizing all available degrees of freedom in optimization product A shows a deficit of m 3 after the second day and of m 3 after the seventh day. In addition product C shows a deficit of m 3 after the seventh day. During the whole scheduling horizon product A is not blended with maximum throughput. This can be explained by looking at the recipe for product A within the second period (day 3 7). The consumption of component 3 at maximum blender throughput is higher than the production of the upstream facilities for this component. Together with the very low storage capacity of component 3 a bottleneck arises, blender throughput is reduced to a value that corresponds to the refilling stream. The calculations of long-range planning are based on the overall quantity of component 3 that is available throughout a period. Now, scheduling reveals that this component must be con- Table 2 Blending stock production Material Volume flow rate (m 3 /h) Operation mode Mode 1 Mode 2 Period No. 1 No. 2 No. 1 No. 2 Component Component Component Component Component Component Component Component Component Table 3 Product demands and tank volume goals given by long-range planning Material Demand (m 3 ) Tank volume (m 3 ) Date T 1 T 2 T 1 T 2 Product A Product B Product C
7 K. Glismann, G. Gruhn / Computers and Chemical Engineering 25 (2001) Fig. 5. Schedule of all blenders, first problem (naming of recipes: A1P2 recipe 1 for product A, period 2). sumed with a constant level to take the low storage capacity into account. Tank limits must be met at each point of time in scheduling. The original long-range planning problem is modified according to this knowledge: The maximum volume fraction of component 3 within product A in period 2 is lowered from 100% to 16.67%. This bound enforces that at maximum throughput of a single blender the consumption of component 3 exactly equals the refilling rate. The new recipe after carrying out the multi-blend optimization meets this new upper bound. The recipe is added to the scheduling problem and can be chosen as alternative to the old recipe. The second scheduling problem is solved and the optimizer is stopped after CPU seconds. The objective value is , the best bound is All product deficits after the second day stay unchanged. But the deficit of product A reduces to 39.3 m 3 after the seventh day. The deficit of product C after the seventh day changes to a surplus of m 3. Deviations in the given goals of long-range planning can be transferred to the recipe optimization problem according to the presented strategy: The NLP is modified based on an analysis of the solution resulting from the scheduling problem. So bottlenecks that can not be foreseen in long-range planning can be included. The altered NLP is solved and new goals are obtained that are more likely to be met within scheduling. The proposed planning and scheduling approach has been implemented into a commercial system for the overall optimization of blending processes. A high efficiency and sufficient ease of use could be proved by solving several problems of industrial magnitude. 5. Summary and discussion This paper has presented a strategy to coordinate short-term scheduling of blending processes with nonlinear recipe optimization. The recipe optimization problem is treated as a NLP and its results, the recipes and tank goals, are forwarded to the scheduling problem. The scheduling problem is formulated as a MILP based on a RTN representation. The scheduling model is capable of switching between alternative recipes during optimization, can take recipes into account that are defined to the long-range planning periods, and uses a combined strategy consisting of additional constraints and a special objective that avoids unreasonable short running times of recipes and that minimizes recipe changeovers. Fig. 6. Tank volumes of all product tanks. Fig. 7. Tank volume of all component tanks.
8 634 K. Glismann, G. Gruhn / Computers and Chemical Engineering 25 (2001) References Bodington, C. E. (1996). Planning, scheduling and control integration in the process industries. New York: McGraw-Hill Chapter 6. Dash Associates Limited, (1999) Warwickshire, UK: XPRESS-MP Release 11. Lee, H., Pinto, J. M., Grossmann, I. E., & Park, S. (1996). Mixed-integer linear programming model for refinery short-term scheduling of crude oil unloading with inventory management. Industrial Engineering Chemical Research, 35, Pantelides, C.C. (1994). Unified frameworks for optimal process planning and scheduling. In Proceedings of the second international conference on foundations of computer, CACHE Publications, pp Polke, M. (Hrsg.) (1994). Prozeßleittechnik, 2. Auflage, Oldenbourg Verlag, München, Wien. Reklaitis, G.V. (1995). Scheduling approaches for the batch process industries, Working Paper No. CIPAC 95-9, School of Chemical Engineering, Purdue University, West Lafayette. Rigby, B., Lasdon, L. S., & Waren, A. D. (1995). The evolution of texaco s blending systems: from OMEGA to StarBlend. Interfaces, 25(5), Shah, N. (1996). Mathematical programming techniques for crude oil scheduling. Computers Chemical Engineering, 20(Suppl.), S1227 S1232..
Design, synthesis and scheduling of multipurpose batch plants via an effective continuous-time formulation
Computers and Chemical Engineering 25 (2001) 665 674 www.elsevier.com/locate/compchemeng Design, synthesis and scheduling of multipurpose batch plants via an effective continuous-time formulation X. Lin,
More informationBlending petroleum products at NZ Refining Company
Blending petroleum products at NZ Refining Company Geoffrey B. W. Gill Commercial Department NZ Refining Company New Zealand ggill@nzrc.co.nz Abstract There are many petroleum products which New Zealand
More informationA MILP Scheduling Model for Multi-stage Batch Plants
A MILP Scheduling Model for Multi-stage Batch Plants Georgios M. Kopanos, Luis Puigjaner Universitat Politècnica de Catalunya - ETSEIB, Diagonal, 647, E-08028, Barcelona, Spain, E-mail: luis.puigjaner@upc.edu
More information4.2 Description of the Event operation Network (EON)
Integrated support system for planning and scheduling... 2003/4/24 page 39 #65 Chapter 4 The EON model 4. Overview The present thesis is focused in the development of a generic scheduling framework applicable
More informationOverview of Industrial Batch Process Scheduling
CHEMICAL ENGINEERING TRANSACTIONS Volume 21, 2010 Editor J. J. Klemeš, H. L. Lam, P. S. Varbanov Copyright 2010, AIDIC Servizi S.r.l., ISBN 978-88-95608-05-1 ISSN 1974-9791 DOI: 10.3303/CET1021150 895
More informationA New Approach for Efficient Rescheduling of Multiproduct Batch Plants
4228 Ind. Eng. Chem. Res. 2000, 39, 4228-4238 A New Approach for Efficient Rescheduling of Multiproduct Batch Plants Jeetmanyu P. Vin and Marianthi G. Ierapetritou* Department of Chemical and Biochemical
More informationState-of-the-art review of optimization methods for short-term scheduling of batch processes
Computers and Chemical Engineering 30 (2006) 913 946 Review State-of-the-art review of optimization methods for short-term scheduling of batch processes Carlos A. Méndez a, Jaime Cerdá b, Ignacio E. Grossmann
More informationGenerate optimal production schedules to maximize profitability and meet service levels
Aspen Plant Scheduler Family Generate optimal production schedules to maximize profitability and meet service levels Aspen Plant Scheduler Family is comprised of a three-tiered scheduling solution designed
More informationIntegrated support system for planning and scheduling... 2003/4/24 page 75 #101. Chapter 5 Sequencing and assignment Strategies
Integrated support system for planning and scheduling... 2003/4/24 page 75 #101 Chapter 5 Sequencing and assignment Strategies 5.1 Overview This chapter is dedicated to the methodologies used in this work
More informationRefinery Planning & Scheduling - Plan the Act. Act the Plan.
Refinery Planning & Scheduling - Plan the Act. Act the Plan. By Sowmya Santhanam EXECUTIVE SUMMARY Due to the record high and fluctuating crude prices, refineries are under extreme pressure to cut down
More informationOptimization of Preventive Maintenance Scheduling in Processing Plants
18 th European Symposium on Computer Aided Process Engineering ESCAPE 18 Bertrand Braunschweig and Xavier Joulia (Editors) 2008 Elsevier B.V./Ltd. All rights reserved. Optimization of Preventive Maintenance
More information2007/26. A tighter continuous time formulation for the cyclic scheduling of a mixed plant
CORE DISCUSSION PAPER 2007/26 A tighter continuous time formulation for the cyclic scheduling of a mixed plant Yves Pochet 1, François Warichet 2 March 2007 Abstract In this paper, based on the cyclic
More informationOptimal Planning of Closed Loop Supply Chains: A Discrete versus a Continuous-time formulation
17 th European Symposium on Computer Aided Process Engineering ESCAPE17 V. Plesu and P.S. Agachi (Editors) 2007 Elsevier B.V. All rights reserved. 1 Optimal Planning of Closed Loop Supply Chains: A Discrete
More informationLinear Programming. Solving LP Models Using MS Excel, 18
SUPPLEMENT TO CHAPTER SIX Linear Programming SUPPLEMENT OUTLINE Introduction, 2 Linear Programming Models, 2 Model Formulation, 4 Graphical Linear Programming, 5 Outline of Graphical Procedure, 5 Plotting
More informationSimulation-based Optimization Approach to Clinical Trial Supply Chain Management
20 th European Symposium on Computer Aided Process Engineering ESCAPE20 S. Pierucci and G. Buzzi Ferraris (Editors) 2010 Elsevier B.V. All rights reserved. Simulation-based Optimization Approach to Clinical
More informationBatch Production Scheduling in the Process Industries. By Prashanthi Ravi
Batch Production Scheduling in the Process Industries By Prashanthi Ravi INTRODUCTION Batch production - where a batch means a task together with the quantity produced. The processing of a batch is called
More informationA Continuous-Time Formulation for Scheduling Multi- Stage Multi-product Batch Plants with Non-identical Parallel Units
European Symposium on Computer Arded Aided Process Engineering 15 L. Puigjaner and A. Espuña (Editors) 2005 Elsevier Science B.V. All rights reserved. A Continuous-Time Formulation for Scheduling Multi-
More informationSensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS
Sensitivity Analysis 3 We have already been introduced to sensitivity analysis in Chapter via the geometry of a simple example. We saw that the values of the decision variables and those of the slack and
More informationMIP-Based Approaches for Solving Scheduling Problems with Batch Processing Machines
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 132 139 MIP-Based Approaches for Solving
More informationThe Challenge of Integrating Non-Continuous Processes Milk Powder Plant Case Study
The Challenge of Integrating Non-Continuous Processes Milk Powder Plant Case Study Martin Atkins, Michael Walmsley, James Neale Energy Research Group, University of Waikato Private Bag 315, Hamilton, New
More informationPlanning and scheduling in the process industry
Noname manuscript No. (will be inserted by the editor) Planning and scheduling in the process industry Josef Kallrath 12 1 BASF-AG, GVC/S (Scientific Computing) - C13, D-67056 Ludwigshafen, Germany (e-mail:
More information1.1 The scheduling problem
Integrated support system for planning and scheduling... 2003/4/24 page 1 #27 Chapter 1 Introduction 1.1 The scheduling problem The scheduling of batch processes is one of the most complex and important
More informationDevelopment of a decision support tool for supply network planning: A case study from the chemical industry
The 7th International Symposium on Operations Research and Its Applications (ISORA 08) Lijiang, China, October 31 Novemver 3, 2008 Copyright 2008 ORSC & APORC, pp. 18 24 Development of a decision support
More informationEnergy Management for Heat Intensive Production Plants using Mixed Integer Optimization
20 th European Symposium on Computer Aided Process Engineering ESCAPE20 S. Pierucci and G. Buzzi Ferraris (Editors) 2010 Elsevier B.V. All rights reserved. Energy Management for Heat Intensive Production
More informationEffective Process Planning and Scheduling
Effective Process Planning and Scheduling The benefits of integrated planning and scheduling developed in the olefins industry extend into many areas of process manufacturing. Elinor Price, Aspen Technology
More informationLinear Programming Supplement E
Linear Programming Supplement E Linear Programming Linear programming: A technique that is useful for allocating scarce resources among competing demands. Objective function: An expression in linear programming
More informationSummary of specified general model for CHP system
Fakulteta za Elektrotehniko Eva Thorin, Heike Brand, Christoph Weber Summary of specified general model for CHP system OSCOGEN Deliverable D1.4 Contract No. ENK5-CT-2000-00094 Project co-funded by the
More informationA Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem
A Genetic Algorithm Approach for Solving a Flexible Job Shop Scheduling Problem Sayedmohammadreza Vaghefinezhad 1, Kuan Yew Wong 2 1 Department of Manufacturing & Industrial Engineering, Faculty of Mechanical
More informationConstraints Propagation Techniques in Batch Plants Planning and Scheduling
European Symposium on Computer Arded Aided Process Engineering 15 L. Puigjaner and A. Espuña (Editors) 2005 Elsevier Science B.V. All rights reserved. Constraints Propagation Techniques in Batch Plants
More informationOptimal Model-Based Production Planning for Refinery Operation
Optimal Model-Based Production Planning for Refinery Operation Abdulrahman Alattas Advisor: Ignacio E. Grossmann Chemical Engineering Department Carnegie Mellon University 1 Presentation Outline Introduction
More informationThe retrofit of a closed-loop distribution network: the case of lead batteries
20 th European Symposium on Computer Aided Process Engineering ESCAPE20 S. Pierucci and G. Buzzi Ferraris (Editors) 2010 Elsevier B.V. All rights reserved. The retrofit of a closed-loop distribution network:
More informationScheduling Intermediate Storage Multipurpose Batch Plants Using the S-Graph
Scheduling Intermediate Storage Multipurpose Batch Plants Using the S-Graph Javier Romero and Luis Puigjaner Chemical Engineering Dept., Universidad Politècnica de Catalunya, E-08028 Barcelona, Spain Tibor
More informationMultiproduct Batch Plant Scheduling
Multiproduct Batch Plant Scheduling I A Karimi & Dong-Yup Lee Department of Chemical & Biomolecular Engineering National University of Singapore Batch operations (e.g. batch drying, batch distillation,
More informationSpeech at IFAC2014 BACKGROUND
Speech at IFAC2014 Thank you Professor Craig for the introduction. IFAC President, distinguished guests, conference organizers, sponsors, colleagues, friends; Good evening It is indeed fitting to start
More informationAbstract. 1. Introduction. Caparica, Portugal b CEG, IST-UTL, Av. Rovisco Pais, 1049-001 Lisboa, Portugal
Ian David Lockhart Bogle and Michael Fairweather (Editors), Proceedings of the 22nd European Symposium on Computer Aided Process Engineering, 17-20 June 2012, London. 2012 Elsevier B.V. All rights reserved.
More informationModels for Incorporating Block Scheduling in Blood Drive Staffing Problems
University of Arkansas, Fayetteville ScholarWorks@UARK Industrial Engineering Undergraduate Honors Theses Industrial Engineering 5-2014 Models for Incorporating Block Scheduling in Blood Drive Staffing
More informationOptimal Scheduling for Dependent Details Processing Using MS Excel Solver
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 8, No 2 Sofia 2008 Optimal Scheduling for Dependent Details Processing Using MS Excel Solver Daniela Borissova Institute of
More informationThe Multi-Item Capacitated Lot-Sizing Problem With Safety Stocks In Closed-Loop Supply Chain
International Journal of Mining Metallurgy & Mechanical Engineering (IJMMME) Volume 1 Issue 5 (2013) ISSN 2320-4052; EISSN 2320-4060 The Multi-Item Capacated Lot-Sizing Problem Wh Safety Stocks In Closed-Loop
More informationCreating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities
Algebra 1, Quarter 2, Unit 2.1 Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned
More informationChapter 11 Monte Carlo Simulation
Chapter 11 Monte Carlo Simulation 11.1 Introduction The basic idea of simulation is to build an experimental device, or simulator, that will act like (simulate) the system of interest in certain important
More informationDENSITY MEASUREMENTS OF LIQUID FUELS TO DETERMINE TEMPERATURE CONVERSION FACTORS FOR LEGAL METROLOGY
XX IMEKO World Congress Metrology for Green Growth September 9 14, 2012, Busan, Republic of Korea DENSITY MEASUREMENTS OF LIQUID FUELS TO DETERMINE TEMPERATURE CONVERSION FACTORS FOR LEGAL METROLOGY H.
More informationIssues in Information Systems Volume 14, Issue 2, pp.353-358, 2013
A MODEL FOR SIMULTANEOUS DECISIONS ON MASTER PRODUCTION SCHEDULING, LOT SIZING, AND CAPACITY REQUIREMENTS PLANNING Harish C. Bahl, California State University-Chico, hbahl@csuchico.edu Neelam Bahl, California
More informationINTEGRATED OPTIMIZATION OF SAFETY STOCK
INTEGRATED OPTIMIZATION OF SAFETY STOCK AND TRANSPORTATION CAPACITY Horst Tempelmeier Department of Production Management University of Cologne Albertus-Magnus-Platz D-50932 Koeln, Germany http://www.spw.uni-koeln.de/
More informationOil Refinery Scheduling Optimisation
Cranfield UNIVERSITY Oil Refinery Scheduling Optimisation School of Engineering Department of Process & Systems Engineering MSc Thesis Cranfield UNIVERSITY School of Engineering Department of Process &
More informationA simplified implementation of the least squares solution for pairwise comparisons matrices
A simplified implementation of the least squares solution for pairwise comparisons matrices Marcin Anholcer Poznań University of Economics Al. Niepodleg lości 10, 61-875 Poznań, Poland V. Babiy McMaster
More informationSummary. Chapter Five. Cost Volume Relations & Break Even Analysis
Summary Chapter Five Cost Volume Relations & Break Even Analysis 1. Introduction : The main aim of an undertaking is to earn profit. The cost volume profit (CVP) analysis helps management in finding out
More informationA joint control framework for supply chain planning
17 th European Symposium on Computer Aided Process Engineering ESCAPE17 V. Plesu and P.S. Agachi (Editors) 2007 Elsevier B.V. All rights reserved. 1 A joint control framework for supply chain planning
More informationMicroeconomics Sept. 16, 2010 NOTES ON CALCULUS AND UTILITY FUNCTIONS
DUSP 11.203 Frank Levy Microeconomics Sept. 16, 2010 NOTES ON CALCULUS AND UTILITY FUNCTIONS These notes have three purposes: 1) To explain why some simple calculus formulae are useful in understanding
More informationTime Series and Forecasting
Chapter 22 Page 1 Time Series and Forecasting A time series is a sequence of observations of a random variable. Hence, it is a stochastic process. Examples include the monthly demand for a product, the
More informationMotivated by a problem faced by a large manufacturer of a consumer product, we
A Coordinated Production Planning Model with Capacity Expansion and Inventory Management Sampath Rajagopalan Jayashankar M. Swaminathan Marshall School of Business, University of Southern California, Los
More informationIndex Terms- Batch Scheduling, Evolutionary Algorithms, Multiobjective Optimization, NSGA-II.
Batch Scheduling By Evolutionary Algorithms for Multiobjective Optimization Charmi B. Desai, Narendra M. Patel L.D. College of Engineering, Ahmedabad Abstract - Multi-objective optimization problems are
More informationEVALUATING REFINERY SUPPLY CHAIN POLICIES AND INVESTMENT DECISIONS THROUGH SIMULATION-OPTIMIZATION. Arief Adhitya
Proceedings of the 2006 Winter Simulation Conference L. F. Perrone, F. P. Wieland, J. Liu, B. G. Lawson, D. M. Nicol, and R. M. Fujimoto, eds. EVALUATING REFINERY SUPPLY CHAIN POLICIES AND INVESTMENT DECISIONS
More informationTEACHING AGGREGATE PLANNING IN AN OPERATIONS MANAGEMENT COURSE
TEACHING AGGREGATE PLANNING IN AN OPERATIONS MANAGEMENT COURSE Johnny C. Ho, Turner College of Business, Columbus State University, Columbus, GA 31907 David Ang, School of Business, Auburn University Montgomery,
More informationThe truck scheduling problem at cross-docking terminals
The truck scheduling problem at cross-docking terminals Lotte Berghman,, Roel Leus, Pierre Lopez To cite this version: Lotte Berghman,, Roel Leus, Pierre Lopez. The truck scheduling problem at cross-docking
More informationA Rough-Cut Capacity Planning Model with Overlapping
1 A Rough-Cut Capacity Planning Model with Overlapping Baydoun G. 1, Haït A. 2 and Pellerin R. 1 1 École Polytechnique de Montréal, Montréal, Canada georges.baydoun, robert.pellerin@polymlt.ca 2 University
More informationHow to Configure and Use MRP
SAP Business One How-To Guide PUBLIC How to Configure and Use MRP Applicable Release: SAP Business One 8.8 All Countries English October 2009 Table of Contents Purpose... 3 The MRP Process in SAP Business
More informationSTRATEGIC CAPACITY PLANNING USING STOCK CONTROL MODEL
Session 6. Applications of Mathematical Methods to Logistics and Business Proceedings of the 9th International Conference Reliability and Statistics in Transportation and Communication (RelStat 09), 21
More informationA Tool for Generating Partition Schedules of Multiprocessor Systems
A Tool for Generating Partition Schedules of Multiprocessor Systems Hans-Joachim Goltz and Norbert Pieth Fraunhofer FIRST, Berlin, Germany {hans-joachim.goltz,nobert.pieth}@first.fraunhofer.de Abstract.
More informationOptimal Maintenance Scheduling of a. Gas Engine Power Plant. using Generalized Disjunctive Programming
Optimal Maintenance Scheduling of a Gas Engine Power Plant using Generalized Disjunctive Programming Pedro M. Castro * Unidade de Análise Energética e Redes, Laboratório Nacional de Energia e Geologia,
More informationENGINEERING ECONOMICS AND FINANCE
CHAPTER Risk Analysis in Engineering and Economics ENGINEERING ECONOMICS AND FINANCE A. J. Clark School of Engineering Department of Civil and Environmental Engineering 6a CHAPMAN HALL/CRC Risk Analysis
More informationHigh-Mix Low-Volume Flow Shop Manufacturing System Scheduling
Proceedings of the 14th IAC Symposium on Information Control Problems in Manufacturing, May 23-25, 2012 High-Mix Low-Volume low Shop Manufacturing System Scheduling Juraj Svancara, Zdenka Kralova Institute
More informationAgile Manufacturing for ALUMINIUM SMELTERS
Agile Manufacturing for ALUMINIUM SMELTERS White Paper This White Paper describes how Advanced Information Management and Planning & Scheduling solutions for Aluminium Smelters can transform production
More informationSolving convex MINLP problems with AIMMS
Solving convex MINLP problems with AIMMS By Marcel Hunting Paragon Decision Technology BV An AIMMS White Paper August, 2012 Abstract This document describes the Quesada and Grossman algorithm that is implemented
More informationInteger Operations. Overview. Grade 7 Mathematics, Quarter 1, Unit 1.1. Number of Instructional Days: 15 (1 day = 45 minutes) Essential Questions
Grade 7 Mathematics, Quarter 1, Unit 1.1 Integer Operations Overview Number of Instructional Days: 15 (1 day = 45 minutes) Content to Be Learned Describe situations in which opposites combine to make zero.
More informationHIGH ACCURACY APPROXIMATION ANALYTICAL METHODS FOR CALCULATING INTERNAL RATE OF RETURN. I. Chestopalov, S. Beliaev
HIGH AUAY APPOXIMAIO AALYIAL MHODS FO ALULAIG IAL A OF U I. hestopalov, S. eliaev Diversity of methods for calculating rates of return on investments has been propelled by a combination of ever more sophisticated
More informationInternational Journal of Industrial Engineering Computations
International Journal of Industrial Engineering Computations 2 (2011) 329 336 Contents lists available at GrowingScience International Journal of Industrial Engineering Computations homepage: www.growingscience.com/ijiec
More information99.37, 99.38, 99.38, 99.39, 99.39, 99.39, 99.39, 99.40, 99.41, 99.42 cm
Error Analysis and the Gaussian Distribution In experimental science theory lives or dies based on the results of experimental evidence and thus the analysis of this evidence is a critical part of the
More informationA new cost model for comparison of Point to Point and Enterprise Service Bus integration styles
A new cost model for comparison of Point to Point and Enterprise Service Bus integration styles MICHAL KÖKÖRČENÝ Department of Information Technologies Unicorn College V kapslovně 2767/2, Prague, 130 00
More informationLinear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.
1. Introduction Linear Programming for Optimization Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1.1 Definition Linear programming is the name of a branch of applied mathematics that
More informationCHAPTER 5: MEASURING GDP AND ECONOMIC GROWTH
CHAPTER 5: MEASURING GDP AND ECONOMIC GROWTH Learning Goals for this Chapter: To know what we mean by GDP and to use the circular flow model to explain why GDP equals aggregate expenditure and aggregate
More informationDesign, Synthesis and Scheduling of Multipurpose Batch Plants via an Effective Continuous-Time Formulation
Design, Synthesis and Scheduling of Multipurpose Batch Plants via an Effective Continuous-Time Formulation X. Lin and C. A. Floudas 1 Department of Chemical Engineering, Princeton University, Princeton,
More informationBusiness Solutions that Create Value for Aluminium Producers
Business Solutions that Create Value for Aluminium Producers Benefits of an Integrated and Collaborative Approach White Paper This White Paper discusses the business challenges and requirements of the
More informationClick on the links below to jump directly to the relevant section
Click on the links below to jump directly to the relevant section What is algebra? Operations with algebraic terms Mathematical properties of real numbers Order of operations What is Algebra? Algebra is
More informationFigure 1. Diode circuit model
Semiconductor Devices Non-linear Devices Diodes Introduction. The diode is two terminal non linear device whose I-V characteristic besides exhibiting non-linear behavior is also polarity dependent. The
More informationCHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING
60 CHAPTER 3 SECURITY CONSTRAINED OPTIMAL SHORT-TERM HYDROTHERMAL SCHEDULING 3.1 INTRODUCTION Optimal short-term hydrothermal scheduling of power systems aims at determining optimal hydro and thermal generations
More informationLecture 10 Scheduling 1
Lecture 10 Scheduling 1 Transportation Models -1- large variety of models due to the many modes of transportation roads railroad shipping airlines as a consequence different type of equipment and resources
More informationA Mixed-Integer Linear Programming Model for Optimizing the Scheduling and Assignment of Tank Farm operations
A Mixed-Integer Linear Programming Model for Optimizing the Scheduling and Assignment of Tan Farm operations Sebastian Terrazas-Moreno a, Ignacio E. Grossmann a*, John M. Wassic b a Carnegie Mellon University,
More informationSuggestions for simplified Fixed Capital Stock calculations at Statistics Sweden Michael Wolf, National Accounts Division Statistics Sweden
Capital Stock Conference March 1997 Agenda Item VI Suggestions for simplified Fixed Capital Stock calculations at Statistics Sweden Michael Wolf, National Accounts Division Statistics Sweden 1 Suggestions
More informationSupply chain design and planning accounting for the Triple Bottom Line
Krist V. Gernaey, Jakob K. Huusom and Rafiqul Gani (Eds.), 12th International Symposium on Process Systems Engineering and 25th European Symposium on Computer Aided Process Engineering. 31 May 4 June 2015,
More informationDesign Procedure. Step 2: The simulation is performed next. Usually the column is not difficult to converge, as the liquid reflux ratio is large.
Design Procedure We now summarize the technique for designing a multipurpose energy efficient atmospheric column. First, the Watkins design method is used to obtain an initial scheme without pump-around
More informationCalculating Carbon Intensity: Implications of Projection Horizon and Future Land Use Prepared for the Renewable Fuels Association
April 30, 2009 Calculating Carbon Intensity: Implications of Projection Horizon and Future Land Use Prepared for the Renewable Fuels Association Project Team David Harrison, Jr., Ph.D. Albert L. Nichols,
More informationNote on growth and growth accounting
CHAPTER 0 Note on growth and growth accounting 1. Growth and the growth rate In this section aspects of the mathematical concept of the rate of growth used in growth models and in the empirical analysis
More informationDefinition 8.1 Two inequalities are equivalent if they have the same solution set. Add or Subtract the same value on both sides of the inequality.
8 Inequalities Concepts: Equivalent Inequalities Linear and Nonlinear Inequalities Absolute Value Inequalities (Sections 4.6 and 1.1) 8.1 Equivalent Inequalities Definition 8.1 Two inequalities are equivalent
More informationVilnius University. Faculty of Mathematics and Informatics. Gintautas Bareikis
Vilnius University Faculty of Mathematics and Informatics Gintautas Bareikis CONTENT Chapter 1. SIMPLE AND COMPOUND INTEREST 1.1 Simple interest......................................................................
More informationMaintenance performance improvement with System Dynamics:
Maintenance performance improvement with System Dynamics: A Corrective Maintenance showcase R.E.M. Deenen 1,2, C.E. van Daalen 1 and E.G.C. Koene 2 1 Delft University of Technology, Faculty of Technology,
More informationObservations on PCB Assembly Optimization
Observations on PCB Assembly Optimization A hierarchical classification scheme based on the number of machines (one or many) and number of boards (one or many) can ease PCB assembly optimization problems.
More informationStatistical estimation using confidence intervals
0894PP_ch06 15/3/02 11:02 am Page 135 6 Statistical estimation using confidence intervals In Chapter 2, the concept of the central nature and variability of data and the methods by which these two phenomena
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More informationScheduling of Mixed Batch-Continuous Production Lines
Université Catholique de Louvain Faculté des Sciences Appliquées Scheduling of Mixed Batch-Continuous Production Lines Thèse présentée en vue de l obtention du grade de Docteur en Sciences Appliquées par
More informationSINGLE-STAGE MULTI-PRODUCT PRODUCTION AND INVENTORY SYSTEMS: AN ITERATIVE ALGORITHM BASED ON DYNAMIC SCHEDULING AND FIXED PITCH PRODUCTION
SIGLE-STAGE MULTI-PRODUCT PRODUCTIO AD IVETORY SYSTEMS: A ITERATIVE ALGORITHM BASED O DYAMIC SCHEDULIG AD FIXED PITCH PRODUCTIO Euclydes da Cunha eto ational Institute of Technology Rio de Janeiro, RJ
More informationGuided Study Program in System Dynamics System Dynamics in Education Project System Dynamics Group MIT Sloan School of Management 1
Guided Study Program in System Dynamics System Dynamics in Education Project System Dynamics Group MIT Sloan School of Management 1 Solutions to Assignment #4 Wednesday, October 21, 1998 Reading Assignment:
More informationOperations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 36 Location Problems In this lecture, we continue the discussion
More informationDiscrete Optimization Introduction & applications
Discrete Optimization 2013 1/21 Discrete Optimization Introduction & applications Bertrand Cornélusse ULg - Institut Montefiore 2013 Discrete Optimization 2013 2/21 Outline Introduction Some applications
More informationCost VOLUME RELATIONS & BREAK EVEN ANALYSIS
1. Introduction The cost volume profit (CVP) analysis helps management in finding out the relationship of costs and revenues to profit. Cost depends on various factors like Volume of production Product
More informationDuality in Linear Programming
Duality in Linear Programming 4 In the preceding chapter on sensitivity analysis, we saw that the shadow-price interpretation of the optimal simplex multipliers is a very useful concept. First, these shadow
More informationSupply Chain Design and Inventory Management Optimization in the Motors Industry
A publication of 1171 CHEMICAL ENGINEERING TRANSACTIONS VOL. 32, 2013 Chief Editors: Sauro Pierucci, Jiří J. Klemeš Copyright 2013, AIDIC Servizi S.r.l., ISBN 978-88-95608-23-5; ISSN 1974-9791 The Italian
More informationSupply Chain Planning Considering the Production of Defective Products
Supply Chain Planning Considering the Production of Defective Products Ferrara Miguel, Corsano Gabriela, Montagna Marcelo INGAR Instituto de Desarrollo y Diseño CONICET-UTN Avellaneda 3657, Santa Fe, Argentina
More informationDISCRETE EVENT SIMULATION IN THE DESIGN, LAYOUT AND SCHEDULING OF PIPELESS BATCH PLANTS
DISCRETE EVENT SIMULATION IN THE DESIGN, LAYOUT AND SCHEDULING OF PIPELESS BATCH PLANTS F. Mushtaq and P.W.H. Chung Department of Chemical Engineering, Loughborough University, Loughborough, Leicestershire,
More informationOverview. Essential Questions. Precalculus, Quarter 4, Unit 4.5 Build Arithmetic and Geometric Sequences and Series
Sequences and Series Overview Number of instruction days: 4 6 (1 day = 53 minutes) Content to Be Learned Write arithmetic and geometric sequences both recursively and with an explicit formula, use them
More informationProduct Documentation SAP Business ByDesign 1302. Supply Chain Planning and Control
Product Documentation PUBLIC Supply Chain Planning and Control Table Of Contents 1 Supply Chain Planning and Control.... 6 2 Business Background... 8 2.1 Demand Planning... 8 2.2 Forecasting... 10 2.3
More information