伍乃骐
制造系统及设计。 生产计划、调度和控制。离散事件系统及Petri网理论。信息安全和计算机网络入侵检测。
个性化签名
- 姓名:伍乃骐
- 目前身份:
- 担任导师情况:
- 学位:
-
学术头衔:
博士生导师
- 职称:-
-
学科领域:
系统工程
- 研究兴趣:制造系统及设计。 生产计划、调度和控制。离散事件系统及Petri网理论。信息安全和计算机网络入侵检测。
伍乃骐教授
学历:
· 1982年于淮南矿业学院获电气工程专业学士学位。
· 1985年于西安交通大学获系统工程专业硕士学位。
· 1988年于西安交通大学获系统工程专业博士学位。
· 1991-1992年美国Purdue大学工业工程系,访问学者。
· 1999年美国Arizona State University工业工程系,博士后研究。
· 2004年5-8月美国新泽西理工学院(NJIT)电机与计算机工程系,高级访问学者。
· 2007-2009三次去法国UTT大学工业系统优化教育部重点实验室,访问教授。
科研方向:
· 制造系统及设计。
· 生产计划、调度和控制。
· 离散事件系统及Petri网理论。
· 信息安全和计算机网络入侵检测。
职务兼职和荣誉称号:
· 广东工业大学博士生导师。
· 国家自然科学基金通讯评议专家。
· IEEE高级会员。
· IEEE Robotics and Automation Society半导体制造自动化专业委员会委员。
· IEEE Trans.on system, Man, and Cybernetics, part C: Associate Editors。
· IEEE Trans.on Automation science and Engineering: Associate Editors。
· Who's Who in Science and Engineering (Marquis Who's Who),7Th Edition,2003。
· Who's Who in Science and Engineering (Marquis Who's Who),8Th Edition,2004。
· Member of Program Committe of 2003-2010 IEEE Internatinal Conference on System,Man,and Cybernetics。
· Member of Program Committe of 2005-2010 IEEE Internatinal Conference on Networking,sensing and control,and organizer of a special session and session chair。
Member of Program Committe of 2008-2010 IEEE Internatinal Conference on Automation Science and Engineering.
· IEEE Trans. on Automatic Control评审员。
· IEEE Trans. on Robotics and Automation评审员。
· IEEE Trans.on system, Man, and Cybernetics评审员。
· IEEE Trans.on Automation science and Engineering 评审员。
· IEEE Robotics and Automation Magazine评审员。
· International Journal of Production Research评审员。
· Production Planning and Control评审员。
· Journal of Intelligent Manufacturing评审员。
· International Journal of Operations and Quantitative Management评审员。
· Robotics and computer Integrated Manufacturing Journal评审员。
-
主页访问
1580
-
关注数
0
-
成果阅读
232
-
成果数
3
伍乃骐, Naiqi Wua, b, ?, Feng Chuc, Chengbin Chud, MengChu Zhoue, f,
Computers and Chemical Engineering 34(2010)529-543,-0001,():
-1年11月30日
For short-term scheduling of crude oil operations, oil residency time and high fusion crude oil transportation constraints are difficult to model. With high setup cost for high fusion point oil transportation, it is desired that the volume of such oil should be transported as much as possible by a single setup. To do so and obtain a feasible schedule, charging tank cycling is an effective strategy. With a hybrid Petri net model, scheduling analysis is carried out and schedulability conditions under a charging tank cycling strategy are presented. They can be used for determining a refining schedule and checking if a target refining schedule is realizable. If so, a detailed feasible schedule can be easily obtained by creating the operation decisions one by one and put into immediate industrial use.
Crude oil operations, Scheduling, Schedulability, Petri net
-
61浏览
-
0点赞
-
0收藏
-
0分享
-
166下载
-
0评论
-
引用
【期刊论文】Selection of partners in virtual enterprise paradigm☆
伍乃骐, Naiqi Wu, Ping Su
Robotics and Computer-Integrated Manufacturing 21(2005)119-131,-0001,():
-1年11月30日
Agility is the competitive advantage in the global manufacturing environment. It is believed that the agility can be realized by dynamically reconfigurable virtual enterprise. However, the configuration of virtual enterprises is a challenge to us. In selecting the partners for the reconfiguration of virtualenterprise, many factors should be taken into consideration. However, the manufacturing cost and time to market are the most important factors. In this paper, in considering the completion time as a constraint we model the partner selection problem by an integer programming formulation to minimize the manufacturing cost. The formulation is then transformed into a graph-theoretical formulation and a 2-phase algorithm is developed to solve the problem. In the first phase, a polynomial bounded algorithm is proposed to find the earliest completion time, so we obtained a feasible solution. In phase 2, we improve the solution by exchanging the candidate partners in keeping the solution in the feasible region. Although we may not find the optimal solution for the problem by the improvement algorithm, the objective is reduced iteration by iteration. Thus, the algorithm is efficient and can be applicable to practical problems. An illustrative example is presented to show the application of the proposed algorithm.
Virtual enterprise (, VE), , Agile manufacturing, VE reconfiguration, Partner selection
-
131浏览
-
0点赞
-
0收藏
-
0分享
-
503下载
-
0评论
-
引用
【期刊论文】An approach to partner selection in agile manufacturing*
伍乃骐, NAIQ IWU, NING MAO and YANMING QIAN
Journal of Intelligent Manufacturing (1999) 10, 519-529,-0001,():
-1年11月30日
It is believed that agile manufacturing is the twenty-?rst century manufacturing enterprise strategy and should be realized by agile virtual enterprise (AVE) which is dynamically con?gured for the manufacturing of one or more products. Agile manufacturing creates a signi?cant challenge for the partner selection in con?guring an AVE. This paper presents a brief introduction to the task decomposition for the manufacturing of a product in multisite environment. A bidding process should be carried out for each task so as to get the information necessary for the con?guration of AVE. To minimize the manufacturing cost, an integer programming (IP) formulation is presented for the partner selection problem. The IP formulation is then transformed into a graph-theoretical formulation by taking the advantage of the precedence relationship between the tasks. The graph obtained turns out to be a directed multipartite graph. Based on the graph-theoretical formulation, an ef?cient solution algorithm is proposed for the problem. It is shown that the algorithm is polynomial bounded. Therefore, it is applicable to large practical problems.
Agile manufacturing,, partner selection,, integer programming,, graph theory
-
40浏览
-
0点赞
-
0收藏
-
0分享
-
138下载
-
0评论
-
引用