已为您找到该学者10条结果 成果回收站
汪定伟, Shengxiang Yang and Dingwei Wang
,-0001,():
-1年11月30日
This paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job-shop scheduling problem, one of NP-complete constraint satisfaction problems. The proposed neural network can be easily constructed and can adaptively adjust its weights of connections and biases of units based on the sequence and resource constraints of the job-shop scheduling problem during its processing. Several heuristics that can be combined with the neural network are also presented. In the combined approaches, the neural network is used to obtain feasible solutions, the heuristic algorithms are used to improve the performance of the neural network and the quality of the obtained solutions. Simulations have shown that the proposed neural network and its combined approaches are efficient with respect to the quality of solutions and the solving speed.
Adaptive neural network,, constraint satisfaction,, generalized job-shop scheduling problem,, heuristic.,
-
39浏览
-
0点赞
-
0收藏
-
0分享
-
105下载
-
0
-
引用
【期刊论文】Soft Computing for Multicustomer Due-Date Bargaining
汪定伟, Dingwei Wang, Shu-Cherng Fang, and Henry L. W. Nuttle
,-0001,():
-1年11月30日
The due-date bargainer is a useful tool to support negotiation on due dates between a manufacturer and its customers. To improve the computational performance of an earlier version of the due-date bargainer, we present a new soft computing approach. It uses a genetic algorithm to find the best priority sequence of customer orders for resource allocation and fuzzy logic operations to allocate the resources and determine the order-completion times, following the priority sequence of orders. To extend the due-date bargainer to accommodate bargaining with several customers at the same time, we propose a method to distribute the total penalty using marginal penalties for the individual bargainers. A demonstration software package implementing the improved due-date bargainer has been developed. It is targeted at apparel manufacturing enterprises. Experiments using realistic resource data and randomly generated orders have achieved satisfactory results.
Due-date assignment,, fuzzy optimization,, genetic algorithms,, JIT,, MRP-II,, production planning,, soft computing.,
-
36浏览
-
0点赞
-
0收藏
-
0分享
-
104下载
-
0
-
引用
【期刊论文】A Fuzzy Due-Date Bargainer for the Make-to-Order Manufacturing Systems
汪定伟, Dingwei Wang, Shu-Cherng Fang, and Thom J. Hodgson
,-0001,():
-1年11月30日
For a make-to-order manufacturing system, the uncertainty and flexibility of the due dates required by customers and the production capacity owned by the manufacturer can be modeled in a fuzzy environment. In this paper, a combined due-date assignment and production planning methodology for the make-to-order manufacturing systems is developed. The fuzzy approach determines the optimal due dates for the manufacturer based upon a "rough-cut" resource balance, while a customer can request earlier due dates by paying a higher price to cover the extra manufacturing cost incurred. The resulting fuzzy due-date bargainer is exercised using manufacturing resource planning (MRPII) data from a furniture manufacturing company. Experimental results indicate its potential as a useful tool for real applications.
Branch-and-bound,, due-date assignment,, fuzzy optimization,, just-in-time (, JIT), ,, MRP-II,, production planning.,
-
33浏览
-
0点赞
-
0收藏
-
0分享
-
129下载
-
0
-
引用
【期刊论文】A Genetics-Based Approach for Aggregated Production Planning in A Fuzzy Environment
汪定伟, Dingwei Wang and Shu-Cherng Fang
,-0001,():
-1年11月30日
Due to the nondeterministic nature of the business environment of a manufacturing enterprise, it is more appropriate to describe the aggregated production planning by using a fuzzy mathematical programming model. In this paper, a genetics-based inexact approach is proposed to imitate the human decision procedure for production planning. Instead of locating one exact optimal solution, the proposed approach finds a family of inexact solutions within an acceptable level by adopting a mutation operator to move along a weighted gradient direction. Then, a decision maker can select a preferred solution by examining a convex combination of the solutions in the family via the human-computer interaction. Our computational experiments illustrate how the enterprise managers can be more satisfied by this new approach than others.
-
32浏览
-
0点赞
-
0收藏
-
0分享
-
136下载
-
0
-
引用