Integrated Optimization Model of Production Planning and Scheduling for Batch Production

An integrated optimization model of production plan and scheduling is introduced. Function objective is to minimize sum of total setup cost (initial setup cost and related setup cost), stock cost, production cost and overtime cost. Restraint functions include equilibrium stock, production capacity, as while as scheduling restraints (procedure restriction and machine capacity restriction). Feasible plan can be set down with considering scheduling restraints

Reconciling Semantic Heterogeneity in Web Services Composition

Service Oriented Computing (SOC) is a popular computing paradigm for the development of distributed Web applications. Service composition, a key element of SOC, is severely hampered by various types of semantic heterogeneity among the services. In this paper, we address the various semantic differences from the context perspective and use a lightweight ontology to describe the concepts and their specializations. Atomic conversions between the contexts are implemented using XPath functions and external services. The correspondences between the syntactic service descriptions and the semantic concepts are established using a flexible, standard-compliant mechanism. Given the naive BPEL composition ignoring semantic differences, our reconciliation approach can automatically determine and reconcile the semantic differences. The mediated BPEL composition incorporates necessary conversions to convert the data exchanged between different services. Our solution has the desirable properties (e.g., adaptability, extensibility and scalability) and can significantly alleviate the reconciliation efforts for Web services composition.This work was partially supported by the MIT Sloan China Management Education Project and grants from the National Natural Science Foundation of China (No. 60674080 and No. 60704027) and the National High-Tech R&D (863) Plan of China (No. 2007AA04Z150)

Reconciling Protocol Mismatches of Web Services by Using Mediators

In the era of Global Services, Service Oriented Architecture (SOA) has been gaining momentum for building Web-based information systems. Service composition is one of the key objectives for adopting SOA. Unfortunately, Web services are not always exactly compatible and it is a non-trivial task to address the mismatches between them. To this end, an approach based on mediator patterns is proposed to develop mediators for reconciling protocol mismatches of partially compatible services and mediating them together. A heuristic technique is developed for identifying protocol mismatches and selecting appropriate patterns. The main steps of the reconciliation approach are presented.The work is partially supported by the MIT Sloan China Management Education Project

Rule-Based Automatic Generation of Mediator Patterns for Service Composition Mismatches

To perform service composition, mismatches are challenging obstacles due to the decentralization and independent development of services. Mediation, as a promising solution, attracts most attentions. And pattern based mediation proposed a modularly constructive thoughtway: Basic mediator patterns were created and sufficient for advanced mediators against all possible mismatches. The pattern structure is illustrated in this paper. And construction rules for each pattern are presented. Executable codes such as BPEL codes can be automatically generated from these rules. As a systematic engineering solution, its feasibility is validated through a case study in the end

Workflow Model Performance Analysis Concerning Instance Dwelling Times Distribution

Abstract Instances dwelling times (IDT) which consist of waiting times and handle times in a workflow model is a key performance analysis goal. In a workflow model the instances which act as customers and the resources which act as servers form a queuing network. Multidimensional workflow net (MWF-net) includes multiple timing workflow nets (TWF-nets) and the organization and resource information. This paper uses queuing theory and MWF-net to discuss mean value and probability distribution density function (PDDF) of IDT. An example is used t