Traditional models for project management have not adequately incorporated a number of factors that are important for resource allocation. This paper proposed a unified timed Petri net model in which scheduling and pl...Traditional models for project management have not adequately incorporated a number of factors that are important for resource allocation. This paper proposed a unified timed Petri net model in which scheduling and planning were collectively carried out to take full advantages of the flexibility of the FMS. Through the lens of system theory, two types of resources were distinguished: major role and auxiliary role, and the major role was used to construct the FMS' Petri net. The method simplified the Petri net's construction and gave a clear flow chart for scheduling. Hence, the auxiliary resource allocation could be easily carried out according to the schedule, which was proposed by heuristic search algorithm. At last, the efficacy of the Petri net model for online scheduling in a resource constrained environment was discussed.展开更多
Internet based technologies, such as mobile payments, social networks, search engines and cloud computation, will lead to a paradigm shift in financial sector. Beside indirect financing via commercial banks and direct...Internet based technologies, such as mobile payments, social networks, search engines and cloud computation, will lead to a paradigm shift in financial sector. Beside indirect financing via commercial banks and direct financing through security markets, a third way to conduct financial activities will emerge, which we call ＂internet finance＇＂ This paper presents a detailed analysis of payment, information processing and resource allocation under internet finance.展开更多
The Internet presents numerous sources of useful information nowadays. However, these resources are drowning under the dynamic Web, so accurate finding user-specific information is very difficult. In this paper we dis...The Internet presents numerous sources of useful information nowadays. However, these resources are drowning under the dynamic Web, so accurate finding user-specific information is very difficult. In this paper we discuss a Semantic Graph Web Search (SGWS) algorithm in topic-specific resource discovery on the Web. This method combines the use of hyperlinks, characteristics of Web graph and semantic term weights. We implement the algorithm to find Chinese medical information from the Internet. Our study showed that it has better precision than traditional IR (Information Retrieval) methods and traditional search engines. Key words HITS - evolution web graph - power law distribution - context analysis CLC number TP 391 - TP 393 Foundation item: Supported by the National High-Performance Computation Fund (00303)Biography: Ye Wei-guo (1970-), male, Ph. D candidate, research direction: Web information mining, network security, artificial intelligence.展开更多
This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage ti...This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage time, batch splitting, partial equipment connectivity and transfer time. The objective is to make a production plan to satisfy all constraints while meeting demand requirement of packed products from various product families. This problem is NP-hard and the problem size is exponentially large for a realistic-sized problem. Therefore,we propose a genetic algorithm to handle this problem. Solutions to the problems are represented by chromosomes of product family sequences. These sequences are decoded to assign the resource for producing packed products according to forward assignment strategy and resource selection rules. These techniques greatly reduce unnecessary search space and improve search speed. In addition, design of experiment is carefully utilized to determine appropriate parameter settings. Ant colony optimization and Tabu search are also implemented for comparison. At the end of each heuristics, local search is applied for the packed product sequence to improve makespan. In an experimental analysis, all heuristics show the capability to solve large instances within reasonable computational time. In all problem instances, genetic algorithm averagely outperforms ant colony optimization and Tabu search with slightly longer computational time.展开更多
Efficient resource scheduling and allocation in radiological examination process （REP） execution is a key requirement to improve patient throughput and radiological resource utilization and to manage unexpected even...Efficient resource scheduling and allocation in radiological examination process （REP） execution is a key requirement to improve patient throughput and radiological resource utilization and to manage unexpected events that occur when resource scheduling and allocation decisions change due to clinical needs. In this paper, a Tabu search based approach is presented to solve the resource scheduling and allocation problems in REP execution. The primary objective of the approach is to minimize a weighted sum of average examination flow time, average idle time of the resources, and delays. Unexpected events, i.e., emergent or absent examinations, are also considered. For certain parameter combinations, the optimal solution of radielogical resource scheduling and allocation is found, while considering the limitations such as routing and resource constraints. Simulations in the application case are performed. Results show that the proposed approach makes efficient use ofradiological resource capacity and improves the patient throughput in REP execution.展开更多
文摘Traditional models for project management have not adequately incorporated a number of factors that are important for resource allocation. This paper proposed a unified timed Petri net model in which scheduling and planning were collectively carried out to take full advantages of the flexibility of the FMS. Through the lens of system theory, two types of resources were distinguished: major role and auxiliary role, and the major role was used to construct the FMS' Petri net. The method simplified the Petri net's construction and gave a clear flow chart for scheduling. Hence, the auxiliary resource allocation could be easily carried out according to the schedule, which was proposed by heuristic search algorithm. At last, the efficacy of the Petri net model for online scheduling in a resource constrained environment was discussed.
文摘Internet based technologies, such as mobile payments, social networks, search engines and cloud computation, will lead to a paradigm shift in financial sector. Beside indirect financing via commercial banks and direct financing through security markets, a third way to conduct financial activities will emerge, which we call ＂internet finance＇＂ This paper presents a detailed analysis of payment, information processing and resource allocation under internet finance.
文摘The Internet presents numerous sources of useful information nowadays. However, these resources are drowning under the dynamic Web, so accurate finding user-specific information is very difficult. In this paper we discuss a Semantic Graph Web Search (SGWS) algorithm in topic-specific resource discovery on the Web. This method combines the use of hyperlinks, characteristics of Web graph and semantic term weights. We implement the algorithm to find Chinese medical information from the Internet. Our study showed that it has better precision than traditional IR (Information Retrieval) methods and traditional search engines. Key words HITS - evolution web graph - power law distribution - context analysis CLC number TP 391 - TP 393 Foundation item: Supported by the National High-Performance Computation Fund (00303)Biography: Ye Wei-guo (1970-), male, Ph. D candidate, research direction: Web information mining, network security, artificial intelligence.
基金Thailand Research Fund (Grant #MRG5480176)National Research University Project of Thailand Office of Higher Education Commission
文摘This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage time, batch splitting, partial equipment connectivity and transfer time. The objective is to make a production plan to satisfy all constraints while meeting demand requirement of packed products from various product families. This problem is NP-hard and the problem size is exponentially large for a realistic-sized problem. Therefore,we propose a genetic algorithm to handle this problem. Solutions to the problems are represented by chromosomes of product family sequences. These sequences are decoded to assign the resource for producing packed products according to forward assignment strategy and resource selection rules. These techniques greatly reduce unnecessary search space and improve search speed. In addition, design of experiment is carefully utilized to determine appropriate parameter settings. Ant colony optimization and Tabu search are also implemented for comparison. At the end of each heuristics, local search is applied for the packed product sequence to improve makespan. In an experimental analysis, all heuristics show the capability to solve large instances within reasonable computational time. In all problem instances, genetic algorithm averagely outperforms ant colony optimization and Tabu search with slightly longer computational time.
基金Project supported by the National Natural Science Foundation of China(No.61562088)
文摘Efficient resource scheduling and allocation in radiological examination process （REP） execution is a key requirement to improve patient throughput and radiological resource utilization and to manage unexpected events that occur when resource scheduling and allocation decisions change due to clinical needs. In this paper, a Tabu search based approach is presented to solve the resource scheduling and allocation problems in REP execution. The primary objective of the approach is to minimize a weighted sum of average examination flow time, average idle time of the resources, and delays. Unexpected events, i.e., emergent or absent examinations, are also considered. For certain parameter combinations, the optimal solution of radielogical resource scheduling and allocation is found, while considering the limitations such as routing and resource constraints. Simulations in the application case are performed. Results show that the proposed approach makes efficient use ofradiological resource capacity and improves the patient throughput in REP execution.
