International Journal of Information Engineering and Electronic Business

Cover page and Table of Contents. vol. 9 No. 4, 2017, IJIEEB

Другой

Бесплатно

Cover page and Table of Contents. vol. 1 No. 1, 2009, IJIEEB

Другой

Бесплатно

A New Maximum Entropy Estimation of Distribution Algorithm to Solve Uncertain Information Job-shop Scheduling Problem

Lu Lin

Статья научная

Estimation of Distribution Algorithm (EDA) is a new kinds of colony evolution algorithm, through counting excellent information of individuals of the present colony EDA construct probability distribution model, then sample the model produces newt generation. To solve the NP-Hard question as EDA searching optimum network structure a new Maximum Entropy Distribution Algorithm (MEEDA) is provided. The algorithm takes Jaynes principle as the basis, makes use of the maximum entropy of random variables to estimate the minimum bias probability distribution of random variables, and then regard it as the evolution model of the algorithm, which produces the optimal/near optimal solution. Then this paper presents a rough programming model for job shop scheduling under uncertain information problem. The method overcomes the defects of traditional methods which need pre-set authorized characteristics or amount described attributes, designs multi-objective optimization mechanism and expands the application space of a rough set in the issue of job shop scheduling under uncertain information environment. Due to the complexity of the proposed model, traditional algorithms have low capability in producing a feasible solution. We use MEEDA in order to enable a definition of a solution within a reasonable amount of time. We assume that machine flexibility in processing operations to decrease the complexity of the proposed model. Muth and Thompson’s benchmark problems tests are used to verify and validate the proposed rough programming model and its algorithm. The computational results obtained by MEEDA are compared with GA. The compared results prove the effectiveness of MEEDA in the job shop scheduling problem under uncertain information environment.

Бесплатно

Research on Fine-grained Job scheduling in Grid Computing

Yeqing Liao, Quan Liu

Статья научная

Grid computing is the technology used in building Internet-wide computing environment and integrating distributed and heterogeneous resources. However, in Grid environment, job scheduling is confronted with a great challenge. This paper focuses on lightweight jobs scheduling in Grid Computing. An Adaptive Fine-grained Job Scheduling (AFJS) algorithm is proposed. Compared with other fine-grained job scheduling algorithms based on grouping, AFJS can outperform them according to the experimental results. And some other related problems are also illustrated.

Бесплатно

A Virtualized Network Architecture for Improving QoS

Yanfeng Zhang, Cuirong Wang, Yuan Gao

Статья научная

Recently, researches have shown that today'sbest-effort Internet with "one fits all" principle comes to an impasse. Addressed to the different QoS requirements oftoday's network services, we propose a new network architecture based on network virtualization technology for improving Internet QoS. It divides a “thick” network into multiple “thin” virtual networks deploying on the same substrate, each is customized with a special designing goal and runs a customized protocol. Then the traffic with different QoS requirements is classified at the ingress router,and distributed to different virtual networks, which are the most suitable for carrying the special traffic. Also, we can deploy a service on multiple virtual networks, and making them working collaboratively to achieve a better QoS. To verify this idea, a prototype is implemented in LAN-scale network. By some simply designed experiments for comparison, we observe that, by use of our network architecture, service provider with specific QoS requirement can take its choice to choose appropriate virtual networks to achieve better QoS performance.

Бесплатно

Sensing the Material Position in Construction Project

NIE Wen-hui, ZOU Zhi-wen, JU Shi-guang

Статья научная

In order to improve the monitoring and controlling performances in construction projects, especially in multi-story projects, This paper researched the approaches to track the materials and components on construction project. A locating model in 3 dimensional spaces is proposed. The mentioned locating algorithms are compared, and shortages and advantages of each are given. The purpose is to find an optimal solution to manage the location information in construction project site with lower costs, higher locating accuracy and ideal reliability.

Бесплатно