Scheduling of flexible manufacturing systems using Timed Petri nets and mathematical programming

被引：0
|
作者：
Bourdeaud'huy, Thomas [1 ]
Hanafi, Said [2 ]
Yim, Pascal [3 ]
机构：
[1] Ecole Cent Lille, SED, LAGIS, Lille, France
[2] Univ Valencia, LAMIH ROI, E-46003 Valencia, Spain
[3] Ecole Cent Lille, LAGIS SED, Ecully, France
来源：
WODES 2006: EIGHTH INTERNATIONAL WORKSHOP ON DISCRETE EVENT SYSTEMS, PROCEEDINGS | 2006年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we propose a mathematical programming model for the exact resolution of the reachability problem in Timed Petri nets. Such nets allow to model a large class of scheduling problems, while taking into account concurrency, parallelism and synchronisation. They are thus a natural way of dealing with 'flexible" manufacting problems, where several resources can be used for the same task. Our model is as general as possible since we do not make assumptions about the firing policy.
引用
收藏
页码：94 / +
页数：2
相关论文
共 50 条
12345