Transient inter-production scheduling based on Petri nets and constraint programming.
Saved in:
| Title: | Transient inter-production scheduling based on Petri nets and constraint programming. |
|---|---|
| Authors: | Bourdeaud'huy, Thomas1 (AUTHOR) thomas.bourdeaud_huy@ec-lille.fr, Belkahla, Olfa1 (AUTHOR), Yim, Pascal1 (AUTHOR), Korbaa, Ouajdi1 (AUTHOR), Ghedira, Khaled1 (AUTHOR) |
| Source: | International Journal of Production Research. Nov2011, Vol. 49 Issue 22, p6591-6608. 18p. |
| Subjects: | Production scheduling, Petri nets, Constraint programming, Flexible manufacturing systems, Multiagent systems, Methodology |
| Abstract: | In this article, we focus on the transient inter-production scheduling problem between two cyclic productions in the framework of flexible manufacturing systems. This problem is first formulated as a reachability problem in timed Petri nets (TPN), then solved using a methodology based on constraint programming. Our work is based on the controlled executions proposed by Chretienne to model the sequence of transition firing dates. Our methodology is based on a preliminary resolution of the state equation between initial and final states in the underlying non-TPN. Then, we choose a duration Tmax corresponding to the maximal duration time of the scheduling. For each solution S of the state equation, we build a controlled execution from the sequence of firings in S. After the propagation of firing date constraints and reachability constraints in the TPN, we use constraint programming to enumerate the set of feasible controlled executions. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | In this article, we focus on the transient inter-production scheduling problem between two cyclic productions in the framework of flexible manufacturing systems. This problem is first formulated as a reachability problem in timed Petri nets (TPN), then solved using a methodology based on constraint programming. Our work is based on the controlled executions proposed by Chretienne to model the sequence of transition firing dates. Our methodology is based on a preliminary resolution of the state equation between initial and final states in the underlying non-TPN. Then, we choose a duration Tmax corresponding to the maximal duration time of the scheduling. For each solution S of the state equation, we build a controlled execution from the sequence of firings in S. After the propagation of firing date constraints and reachability constraints in the TPN, we use constraint programming to enumerate the set of feasible controlled executions. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 00207543 |
| DOI: | 10.1080/00207543.2010.519113 |
