如何实现合同网上审批

合同审批是每个企事业单位的重要工作之一,每个合同的签订都需要经过相关职能部门的审核,这个过程往往要花费较长的时间,但随着计算机网络、通信网络、软件技术的不断发展和进步,通过网上审批合同来提高工作效率、节约成本、增强顾客满意度已成为现实。本文从合同网上审批的研发背景、系统功能、系统结构、系统特点及其带来的效益等方面进行论述,并对该系统存在的困难、未来发展趋势等进行分析。     

基于SOA和工作流的数据仓库更新系统

针对数据仓库系统中的异构数据源集成问题和数据仓库更新流程的控制问题,提出一个基于SOA和工作流的数据仓库更新系统,把异构环境下的各个系统作为服务提供者或服务消费者,抽象出标准的功能服务接口,实现了异构平台的系统集成。同时把数据仓库更新过程定义为活动的集合,从逻辑上看作为一个工作流过程,可以根据不同的业务需求进行动态组织,高效地满足用户的需求,提高了更新流程的自动化程度和效率。     

搭建式软件开发技术研究与应用

为适应软件开发对业务敏捷性和即时构造性的新要求,采用面向服务的思想,对搭建式软件开发理论和技术进行了研究和实现。与已有的开发模式相比,搭建式开发技术的优势在于它能将工作流、W ebG IS集成到一个面向服务的可视化的搭建平台中。通过电子政务系统的搭建过程表明,搭建式开发技术具有按需、即时、实用的特点,增强了企业的竞争优势。     

An agent-based workflow system for enterprise based on FIPA-OS framework

The paper describes what we have learned from implementing a multi-agent architecture used to support enterprise notions and principles for intelligent systems design. In the last couple of years, agent-based management systems have been widely used to monitor and control business design processes. In this paper, multi-agent architecture is proposed and applied to the workflow management system in ASE¹ (Advance Semiconductor Electronic) Inc., which is the world’s well-known largest provider of independent semiconductor for manufacturing services in assembly and test. The proposed FIPA-OS autonomous workflow management system uses a workflow co-ordination mechanism and an agent integration mechanism to enable the routine daily jobs error handle. Our vision for extending the FIPA-OS architectural elements to cover the development and implementation of generic web-Centric collaborative applications concludes the paper.     

基于EJB构件的PDM系统中工作流系统研究

针对传统的软件开发方法的缺点,本文按照基于构件的软件开发,结合EJB构件技术,给出了基于EJB构件技术的PDM系统中工作流系统的体系结构,并对此体系结构进行简单的介绍,最后对EJB构件技术与工作流系统的结合给出结论。     

An innovative framework of collaborative-based workflow in Development Chain Management

Currently, most product development procedures have been characterized as unnecessarily complicated. To maintain a competitive edge and to simplify the procedures, joint efforts from different functional groups play such crucial role. Specifically, information from marketing, sales, engineering, sourcing, and manufacturing should be cross-referenced. In addition, adopting pre-defined workflows contributes to efficient collection of distributed information. Moreover, unlike traditional workflow, a collaborative-based workflow (CWF) in product development process boasts of complicated workflow forms with manifold views for a workflow execution. Traditional workflow solutions, for instance, can only transmit a workflow form through different actors. Such workflow solutions merely offer modeling approval-based workflow (AWF), such as drawing reviews or absence applications.     

When does a workflow complete?

Workflow Management Systems (WFMS) coordinate execution of logically related multiple tasks in an organization. Each workflow that is executed on such a system is an instance of some workflow schema. A workflow schema is defined using a set of tasks that are coordinated using dependencies. Workflows generated from the same schema may differ with respect to the tasks executed. An important issue that must be addressed while designing a workflow is to decide what tasks are needed for the workflow to complete — we refer to this set of tasks as the completion set. Since different tasks are executed in different workflow instances, a workflow schema may be associated with multiple completion sets. Incorrect specification of completion sets may prohibit some workflow from completing. This, in turn, will cause the workflow to hold on to the resources and raise availability problems. Manually generating these sets for large workflow schemas can be an error-prone and tedious process.Our goal is to automate this process. We investigate the factors that affect the completion of a workflow. Specifically, we study the impact of control-flow dependencies on completion sets and show how this knowledge can be used for automatically generating these sets. We provide an algorithm that can be used by application developers to generate the completion sets associated with a workflow schema. Generating all possible completion sets for a large workflow is computationally intensive. Towards this end, we show how to approximately estimate the number of completion sets. If this number exceeds some threshold specified by the user, then we do not generate all completion sets.     

Workflow simulation for operational decision support

Simulation is widely used as a tool for analyzing business processes but is mostly focused on examining abstract steady-state situations. Such analyses are helpful for the initial design of a business process but are less suitable for operational decision making and continuous improvement. Here we describe a simulation system for operational decision support in the context of workflow management. To do this we exploit not only the workflow’s design, but also use logged data describing the system’s observed historic behavior, and incorporate information extracted about the current state of the workflow. Making use of actual data capturing the current state and historic information allows our simulations to accurately predict potential near-future behaviors for different scenarios. The approach is supported by a practical toolset which combines and extends the workflow management system YAWL and the process mining framework ProM.     

Deadline division-based heuristic for cost optimization in workflow scheduling

Cost optimization for workflow applications described by Directed Acyclic Graph (DAG) with deadline constraints is a fundamental and intractable problem on Grids. In this paper, an effective and efficient heuristic called DET (Deadline Early Tree) is proposed. An early feasible schedule for a workflow application is defined as an Early Tree. According to the Early Tree, all tasks are grouped and the Critical Path is given. For critical activities, the optimal cost solution under the deadline constraint can be obtained by a dynamic programming strategy, and the whole deadline is segmented into time windows according to the slack time float. For non-critical activities, an iterative procedure is proposed to maximize time windows while maintaining the precedence constraints among activities. In terms of the time window allocations, a local optimization method is developed to minimize execution costs. The two local cost optimization methods can lead to a global near-optimal solution. Experimental results show that DET outperforms two other recent leveling algorithms. Moreover, the deadline division strategy adopted by DET can be applied to all feasible deadlines.