Yang Shan-lin

Data oriented analysis of workflow optimization

Recent progress in IT has greatly changed the way we use and organize information resources, making it possible to undertake a fundamental rethinking of business processes that have had complexity and redundancy built into them over the years. We present a data oriented method to optimize the workflow. Some rules are given to complete this analysis. By analyzing data input to and output from functions, this method gives an approach to business process reengineering (BPR), and the right process can be guaranteed.

The Framework for Multi Agent Concurrent Negotiation

In the multi-agent systems, the resources for the task and the ability of each single agent may be limited.An agent cannot do the whole task by itself, it need the help of other agents. So, the task needs to be decomposed into several subtasks. Some of the subtasks will be carried out locally by the original agent,while others need to be done non-locally with other agents. So, during the negotiation process, agents must make sure the order of each subtask and the assignment of the features for all the subtasks. In this paper, we are mainly concerning about the high level of the negotiation, and discuss about how to make the negotiation more efficient. We suggest doing negotiations concurrently, and propose a concurrent negotiation framework based on the Semi Markov Decision Process by using the concurrent action model.The framework helps agents to decide when to make decision in the negotiation. Experimental results show the performance of the model, and compare the outcome with difference termination scheme.

Minimizing makespan in semiresumable case of single-machine scheduling with an availability constraint

Abstract A single-machine scheduling problem with an unavailable period to minimize makespan is discussed in this article. The disrupted job is assumed to be semiresumable. It is shown that the relative worst-case error bound of the longest processing time (LPT) algorithm is α/2, where α is reprocess-ratio. Furthermore, an example is provided to show the tightness of this bound, and then a LPT-based heuristic is proposed. Computational results show that this heuristic is quite effective in finding an optimal or near-optimal solution. Effects of different parameters on this algorithm are also analyzed.

Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times

Abstract A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard, in the strong sense, or open problems, therefore approximation algorithms are studied. The review reveals that there exist some potential areas worthy of further research.

Research on the design method of business-oriented component-based CRM system

CRM under network environment now faces series of tough problems, such as investment protection of the legacy system, managing system complexity, and rapidly adapting to new changing etc. In this article, we first construct the component repository of the system in a top down classified and layered manner from business, function to transaction under the lead of software engineering and the idea of component based software design, then we build up a network environment oriented CRM system according to the different use of the components so as to bring in high reusability to the business components and effectively improve system reliability and the efficiency of development.

Design of a Optimization Cutting Stock I³DSS Base on MAS for a Manufacturing Company

In enterprise the cutting stock is a complex decision problem, so a intelligent, integrated and interactive decision support system is needed to support the cutting stock decision. This article describes the optimization models of a cutting stock problem for a manufacturing company, and puts forward a multi-agent based optimization cutting stock I3DSS. A five-layer structure is designed. The communication and cooperation mechanism among agents as well as the systems work procedure is discussed too.

Solutions to Belief Group Decision Making Using Extended TOPSISs

In this paper, we extend TOPSIS (technique for order preference by similarity to ideal solution) by three approaches to aggregating group preferences, in order to solve multiple attribute decision analysis (MADA) problems in the situation of belief group decision making (BGDM), where the attribute evaluation of each decision maker (DM) is represented by the bba (basic belief assignment), the applied foundation of Dempster-Shafer theory (DST). Corresponding to three approaches, three extended TOPSIS models, the premodel, the postmodel, and the intermodel, are elaborated step by step, which are used to find solutions to BGDM. In three extended models, the aggregation of group preferences depends on some rules of evidence combination, some social choice functions, and some mean approaches, respectively. Furthermore, a numerical example clearly illustrates the procedures of three extended models for BGDM.