By Topic

Use of constraints in Petri nets for modelling and solving scheduling problems in preliminary system design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Boutet, F. ; Inst. Nat. des Sci. Appliquees, Toulouse, France ; Motet, G.

In preliminary system design, scheduling problems are stated with uncertain parameters in order to provide some flexibility to implementation teams. In the paper, the joint use of Petri nets and constraint logic programming paradigms is studied to model and solve job shop scheduling problems, taking into account this uncertainty. The proposed modelling tool is called constrained predicate nets, an extension of predicate/transition nets that formally handles constraints in tokens.

Published in:

Systems, Man, and Cybernetics, 1998. 1998 IEEE International Conference on  (Volume:1 )

Date of Conference:

11-14 Oct 1998