Solving scheduling problems using Petri nets and constraint logic programming

Solving scheduling problems using Petri nets and constraint logic programming

0.00 Avg rating0 Votes
Article ID: iaor20001545
Country: France
Volume: 32
Issue: 2
Start Page Number: 125
End Page Number: 143
Publication Date: Jan 1998
Journal: RAIRO Operations Research
Authors: ,
Keywords: petri nets
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.