According to the characteristics of actual production of discrete manufacturing enterprises, a class of new practical job shop scheduling problem was proposed in this paper. It is called nonstandard job shop schedulin...
详细信息
According to the characteristics of actual production of discrete manufacturing enterprises, a class of new practical job shop scheduling problem was proposed in this paper. It is called nonstandard job shop scheduling problem. The detailed description of nonstandard job shop scheduling problem is presented. A nonstandard job shop scheduling algorithm was designed. The objective of the algorithm is minimizing the maximal completion time of all operations to ensure all jobs can be processing completed as soon as possible. The nonstandard job shop scheduling algorithm adapts the engineering practice, and it can find the better solution in polynomial complexity. The feasibility and efficiency of the algorithm was verified through an example.
In this paper, we study a project scheduling problem that is called resource constrained project scheduling problem under minimization of total weighted resource tardiness penalty cost (RCPSP-TWRTPC). In this problem,...
详细信息
In this paper, we study a project scheduling problem that is called resource constrained project scheduling problem under minimization of total weighted resource tardiness penalty cost (RCPSP-TWRTPC). In this problem, the project is subject to renewable resources, each renewable resource is available for limited time periods during the project life cycle, and keeping the resource for each extra period results in some tardiness penalty cost. We introduce a branch and bound algorithm to solve the problem exactly and use several bounding, fathoming, and dominance rules in our algorithm to shorten the enumeration process. We point out parameters affecting the RCPSP-TWRTPC degree of difficulty, generate extensive sets of sample instances for the problem, and perform comprehensive experimental analysis using the customized algorithm and also CPLEX solver. We analyze the algorithm behavior with respect to the changes in instances degree of difficulty and compare its performance for different cases with the CPLEX solver. The results reveal algorithm efficiency.
A new association rule mining algorithm is studied, which is based on gas monitoring database. In order to calculate itemsets support, this paper puts forward the concept of database characteristic matrix and characte...
详细信息
ISBN:
(纸本)9781728140773
A new association rule mining algorithm is studied, which is based on gas monitoring database. In order to calculate itemsets support, this paper puts forward the concept of database characteristic matrix and characteristic vector, and leads to algorithm for mining association rules based on the characteristic matrix. This algorithm needs to traverse the database one time only, and the database operation has been reduced. Based on the characteristic vector inner product to get an Item set support, the efficiency of the algorithm has been improved. It improves the efficiency of association rules mining in mass gas databases.
Apriori is a classical association rule algorithm,On the basis of analyzing the Apriori algorithm and some improved algorithms,Using Matlab tool implements an efficient algorithm,the improved algorithm largely reduces...
详细信息
Apriori is a classical association rule algorithm,On the basis of analyzing the Apriori algorithm and some improved algorithms,Using Matlab tool implements an efficient algorithm,the improved algorithm largely reduces the size of candidate sets and improves the mining ***,the improved algorithm is applied in the university curriculum management,which uses students' academic records as data source to mining the hidden curriculum related *** other relevant metrics such as lift,allonfidence and cosine are introduced to verify the correlation of association *** will be significance to provide the significance information for teaching management.
This paper introduces a new modular approach to robotic grasping that allows for finding a trade off between a simple gripper and more complex human like manipulators. The modular approach to robotic grasping aims to ...
详细信息
ISBN:
(纸本)9781457711992
This paper introduces a new modular approach to robotic grasping that allows for finding a trade off between a simple gripper and more complex human like manipulators. The modular approach to robotic grasping aims to understand human grasping behavior in order to replicate grasping and skilled in-hand movements with an artificial hand using simple, robust, and flexible modules. In this work, the design of modular grasping devices capable of adapting to different requirements and situations is investigated. A novel algorithm that determines effective modular configurations to get efficient grasps of given objects is presented. The resulting modular configurations are able to perform effective grasps that a human would consider "stable". Related simulations were carried out to validate the efficiency of the algorithm. Preliminary results show the versatility of the modular approach in designing grippers.
In this paper a collection of efficient algorithms are described for solving an algebraic systemwith a symmetric Toeplitz coecient matrix. Systems of this form arise when approximating the solution ofboundary value Vo...
详细信息
In this paper a collection of efficient algorithms are described for solving an algebraic system
with a symmetric Toeplitz coecient matrix. Systems of this form arise when approximating the solution of
boundary value Volterra integro-differential equations with finite difference methods. In the nonlinear case,
an iterative procedure is required and is incorporated into the algorithms presented. Numerical examples
illustrate the results.
暂无评论