Solving scheduling problems using Petri nets and constraint logic programming

被引：0

作者：

Richard, P ^{[1
]}

Proust, C ^{[1
]}

机构：

[1] Univ Tours, Ecole Ingn Informat Ind, Lab Informat, F-37913 Tours, France

来源：

RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH | 1998年 / 32卷 / 02期

关键词：

scheduling; Petri nets; constraint logic programming;

D O I：

暂无

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper presents an approach to solve scheduling problems from a Petri net model. A timed Petri net describes feasible sequences and schedules of operations. The net is then translated into a CHIP program. Build-in solver of the constraint logic programming language is used to solve the associated scheduling problem. The implementation of the OPTNET software and some results are described. (C) Elsevier, Paris.

引用

页码：125 / 143

页数：19

共 42 条

[21] *IJPR, 1988, INT J PROD RES SPECI, V26
[22] Johnson S.M., 1954, NAV RES LOG, V1, P61, DOI DOI 10.1002/NAV.3800010110
[23] JULIA S, 1994, IEEE SMC SAN ANTONIO, P1683
[24] LAPAPE C, 1994, INTELLIGENT SYSTEMS, V3, P55
[25] LAWLER EL, 1989, BSR8909 CTR MATH COM
[26] LEE DY, 1994, IEEE T ROBOTIC AUTOM, V10, P123, DOI 10.1109/70.282537
[27] LEPAPE C, 1994, 9 C REC FORM INT ART
[28] LEVY ML, 1994, INRIA EUR WORKSH INT, P307
[29] MUNIER A, 1993, RAIRO AUTOMATIQUE PR, V27, P487
[30] PETRI NETS - PROPERTIES, ANALYSIS AND APPLICATIONS
MURATA, T
[J]. PROCEEDINGS OF THE IEEE, 1989, 77 (04) : 541 - 580

← 1 2 3 4 5 →