Cart (Loading....) | Create Account
Close category search window
 

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

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

3 Author(s)
Bourdeaud'huy, T. ; Ecole Centrale de Lille, Villeneuve d''Ascq ; Hanafi, S. ; Yim, P.

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" manufacturing 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

Published in:

Discrete Event Systems, 2006 8th International Workshop on

Date of Conference:

10-12 July 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.