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 条
  • [1] ACKOFF RL, 1977, EUROPEAN J OPERATION, V1
  • [2] EXTENDING CHIP IN ORDER TO SOLVE COMPLEX SCHEDULING AND PLACEMENT PROBLEMS
    AGGOUN, A
    BELDICEANU, N
    [J]. MATHEMATICAL AND COMPUTER MODELLING, 1993, 17 (07) : 57 - 73
  • [3] [Anonymous], 1974, THESIS MIT CAMBRIDGE
  • [4] Baker K. R., INTRO SEQUENCING SCH
  • [5] BAPTISTE P, 1991, RAIRO-AUTOM PROD INF, V25, P87
  • [6] BAPTISTE P, 1994, ILPS 94 NEW YORK
  • [7] Bauer A., 1991, SHOP FLOOR CONTROL S
  • [8] CARLIER J, 1993, RAIRO-RECH OPER, V27, P77
  • [9] CARLIER J, 1987, PROBLEMES ORDONNANCE
  • [10] CARLIER J, 1988, ADV PETRI NETS
12345