Research on workflow meta model supporting activity based costing

Activity based costing (ABC) is a method which can solve many limitations of the traditional cost systems in manufacturing management. In this paper, we investigate how to integrate ABC with workflow technology, and build a workflow meta model supporting ABC. Firstly, the concept and concept model of activity based costing (ABC) are introduced. Next, the meta model of P -PROCE (Process, Product, Resource, Organization, and Cost & Evaluation) is presented. Then the cost meta model is defined by adding ABC to P -PROCE model. Object constraint language (OCL) is used to express meta model and constraints. Finally, we show an enterprise modeling and simulation tool based on the workflow meta model. We can systematically construct an enterprise model and easily and efficiently conduct simulation. Moreover it enables us to analyze and evaluate business processes and its costs.

Differences and relations of objectives, constraints, and decision parameters in the optimization of individual heat exchangers and thermal systems

Performance improvement of heat exchangers and the corresponding thermal systems benefits energy conservation, which is a multi-parameters, multi-objectives and multi-levels optimization problem. However, the optimized results of heat exchangers with improper decision parameters or objectives do not contribute and even against thermal system performance improvement. After deducing the inherent overall relations between the decision parameters and designing requirements for a typical heat exchanger network and by applying the Lagrange multiplier method, several different optimization equation sets are derived, the solutions of which offer the optimal decision parameters corresponding to different specific optimization objectives, respectively. Comparison of the optimized results clarifies that it should take the whole system, rather than individual heat exchangers, into account to optimize the fluid heat capacity rates and the heat transfer areas to minimize the total heat transfer area, the total heat capacity rate or the total entropy generation rate, while increasing the heat transfer coefficients of individual heat exchangers with different given heat capacity rates benefits the system performance. Besides, different objectives result in different optimization results due to their different intentions, and thus the optimization objectives should be chosen reasonably based on practical applications, where the inherent overall physical constraints of decision parameters are necessary and essential to be built in advance.

Solution of Combined Heat and Power Economic Dispatch Problem Using Direct Optimization Algorithm

This paper presents the solution to the combined heat and power economic dispatch problem using a direct solution algorithm for constrained optimization problems. With the potential of Combined Heat and Power (CHP) production to increase the efficiency of power and heat generation simultaneously having been researched and established, the increasing penetration of CHP systems, and determination of economic dispatch of power and heat assumes higher relevance. The Combined Heat and Power Economic Dispatch (CHPED) problem is a demanding optimization problem as both constraints and objective functions can be non-linear and non-convex. This paper presents an explicit formula developed for computing the system-wide incremental costs corresponding with optimal dispatch. The circumvention of the use of iterative search schemes for this crucial step is the innovation inherent in the proposed dispatch procedure. The feasible operating region of the CHP unit three is taken into account in the proposed CHPED problem model, whereas the optimal dispatch of power/heat outputs of CHP unit is determined using the direct Lagrange multiplier solution algorithm. The proposed algorithm is applied to a test system with four units and results are provided.

Pareto-Based Complete Local Search and Combined Timetabling for Multi-objective Job Shop Scheduling Problem with No-Wait Constraint

Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop scheduling problem (JSSP)describe the basic production environment, which have a single objective and limited constraints. However,a practical process of production is characterized by having multiple objectives,no-wait constraint,and limited storage. Thus this research focused on multiobjective,no-wait JSSP. To analyze the problem,it was further divided into two sub-problems, namely, sequencing and timetabling. Hybrid non-order strategy and modified complete local search with memory were used to solve each problem individually. A Pareto-based strategy for performing fitness assessment was presented in this study. Various experiments on benchmark problems proved the feasibility and effectiveness of the proposed algorithm.