A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Hybrid Heuristic Search Based on Petri Net for FMS Scheduling
2012
Energy Procedia
Preserved Fulltext
This paper describes FMS scheduling problem based on Petri net with the goal of minimizing makespan . ...
A hybrid heuristic search approach for the scheduling is presented, which combine dynamic search window with best-first algorithm and backtracking search., In addition redundant markings can be eliminated ...
was the main method to solve the Petri net-based problem [3] ; Lee and DiCesare [3] used A * algorithm for the Petri net-based production scheduling problem; Sun and Chen [9] improved Lee's method ...
doi:10.1016/j.egypro.2012.02.128
fatcat:xnepagrcqfbwzkgqisdxbth5l4
The Internet of Things Enabled Shop Floor Scheduling and Process Control Method Based on Petri Nets
2019
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The value of the mean relative error is 1.77, which illustrates the feasibility and efficiency of the proposed PN-ACO algorithm to solve flexible job shop scheduling problems. ...
A shop floor scheduling/rescheduling method based on Petri net and ant colony optimization (PN-ACO) is proposed given an abnormal event represented by machine breakdown. ...
Ahmad and Khan [27] presented a method for a periodic JSP by combining a timed place Petri net (TTPN) with the heuristic search method. ...
doi:10.1109/access.2019.2900117
fatcat:oeazjyos5ba7dewbuwgx3i7bie
A heuristic solution approach to the machine loading problem of an FMS and its Petri net model
1997
International Journal of Production Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The Petri net model for the problem attempted by the proposed heuristic has been constructed to delineate its graphical representation and subsequent validation. ...
A loading problem in a modern FMS is the allocation of a job from the job pool maintaining the¯exibility of the system, reducing the system imbalance and thereby maximizing the throughput. ...
Acknowledgments The authors wish to express their gratitude to the editor and anonymous referee for their valuable suggestions regarding this paper. ...
doi:10.1080/002075497194840
fatcat:2j2ry7iunrdz7bx5zexnlruc6i
Minimum Initial Marking Estimation in Labeled Petri Nets with Unobservable Transitions
2019
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In the literature, researchers have been studying the minimum initial marking (MIM) estimation problem in the labeled Petri nets with observable transitions. ...
INDEX TERMS Labeled Petri nets, initial marking estimation, unobservable transitions, algorithmic complexity. ...
HEURISTIC METHODS In some cases, we can further reduce the complexity of solving the MIM estimation problem when high accuracy is not required. ...
doi:10.1109/access.2019.2894352
fatcat:w4hi7okxnzgpfi2hvxefafqi5u
A Scheduling Algorithm Based on Petri Nets and Simulated Annealing
2007
American Journal of Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Based on the art state of general scheduling algorithms, we present the metaheuristic, we have decided to apply for a given example of HFMS. That was the study of Simulated Annealing Algorithm SA. ...
Hierarchical Petri nets model was regarded as being made up a set of single timed colored Petri nets models. Each single model represents one process which was composed of many operations and tasks. ...
[5] : They results from the timed Petri nets definition. In timed Petri nets, the marking m i (t) of a place P i is integer, however in continuous Petri nets, m i (t) is real. ...
doi:10.3844/ajassp.2007.269.273
fatcat:trp6anlv7ve33mks7mhr57ad5e
THE FLOW SHOP SCHEDULING PROBLEM MODELED BY MEANS OF TIMED PLACE PETRI NETS
2017
IAENG Transactions on Engineering Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Thus, an FMS presenting the FSSP can be modeled by Petri nets (PNs), which are a powerful tool that has been used to model and analyze discrete event systems. ...
In order to be able to analyze this problem in a better way, this problem needs to be represented adequately for understanding the relationship among the operations that are carried out. ...
There are two ways to generate the reachability tree of a Petri net from an initial marking: depth-first and breadth-first. ...
doi:10.1142/9789813230774_0020
fatcat:iq3uonzcdvechluflzkso3fwha
An Efficient Heuristics for Minimum Time Control of Continuous Petri nets
2009
IFAC Proceedings Volumes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper considers the problem of controlling timed continuous Petri nets under infinite server semantics. ...
First, by using linear programming, a method driving the system from the initial to the target state through a linear trajectory is developed. ...
Continuous Petri nets are a fluid approximation of classical discrete Petri nets (David and Alla (2005) ; Silva and Recalde (2004) ). ...
doi:10.3182/20090916-3-es-3003.00009
fatcat:7ktgniesazdilbanewlayb7rou
Multiobjective Heuristic Scheduling of Automated Manufacturing Systems Based on Petri Nets
2021
International Journal of Machine Learning and Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In addition, a multiobjective heuristic A* search within reachability graphs of extended Petri nets is also proposed to schedule these nets. ...
To deal with them, this paper proposes an extend Petri nets for the multiobjective scheduling of AMSs. ...
The authors declare no conflict of interest AUTHOR CONTRIBUTIONS Chong Yu, Bo Huang concuted the research; Chong Yu, JianGen Hao analyzed the data; Bo Huang, JianGen Hao wrote the paper; all authors had ...
doi:10.18178/ijmlc.2021.11.2.1032
fatcat:zr4dbqlakbc67khstjb2oibrlq
Petri Net Modeling and Decomposition Method for Solving Production Scheduling Problems
2007
Journal of Advanced Mechanical Design, Systems, and Manufacturing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The paper addresses a Petri Net modeling and decomposition method for solving a wide variety of scheduling problems. ...
Considering the need to develop general scheduling problem solver, the recent integration of Petri Nets as modeling tools into effective optimization methods for scheduling problems is very promising. ...
The dynamics of Petri Nets are determined by finding a firing vector from an initial marking to a final marking. ...
doi:10.1299/jamdsm.1.262
fatcat:i4rzedrzinfwnl5vnt7knbehfa
Sensor Selection for Structural Observability in Discrete Event Systems Modeled by Petri Nets
2010
IEEE Transactions on Automatic Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
The problem is important because the majority of existing control schemes for Petri nets rely on complete knowledge of the system state at any given time step. ...
For this reason, we first reduce the problem to the linear integer programming problem, which can be solved optimally using existing linear integer programming solvers (at least for small problem instances ...
ACKNOWLEDGMENT The authors would like to thank anonymous reviewers for very insightful and astute comments regarding this paper and earlier conference versions (namely [37] , [38] ) of parts of this ...
doi:10.1109/tac.2010.2042348
fatcat:rctpcxxcezagzayhnvsvz4nhyi
Petri Net Decomposition Approach for Bi-Objective Routing for AGV Systems Minimizing Total Traveling Time and Equalizing Delivery Time
2012
Journal of Advanced Mechanical Design, Systems, and Manufacturing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A Petri net decomposition approach is proposed to solve the bi-objective optimization problem efficiently. ...
The dispatching and conflictfree routing problem for AGVs is represented as a bi-objective optimal firing sequence problem for Petri Net. ...
Acknowledgement The authors wish to thank the member of Daifuku Institute of Technology and Training Co., LTD. for giving us practical data, advices, suggestion and comments. ...
doi:10.1299/jamdsm.6.672
fatcat:7qwir53save2rnezi2yp27rbju
Gradient-Based Variable Ordering of Decision Diagrams for Systems with Structural Units
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper presents Gradient-Π, a novel heuristics for finding the variable ordering of Decision Diagrams encoding the state space of Petri net systems. ...
The value of the proposed heuristics is assessed on a public benchmark of Petri net models, showing that Gradient-Π can successfully exploit the structural information to produce good variable orderings ...
The state of a PN is usually called a marking m, a multiset on the set P of places. Definition 1 (Petri Net). ...
doi:10.1007/978-3-319-68167-2_13
fatcat:l37skwaj6rd5viodgd3ez4gqey
FMS Scheduling under Availability Constraint with Supervisor Based on Timed Petri Nets
2017
Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper proposes an optimal solution to large-scale Flexible Manufacturing System (FMS) scheduling problems under availability constraints based on Timed Petri Nets (TPNs). ...
First a decomposition method of TPNs is proposed, then a mathematical model is derived based on their properties. ...
Acknowledgments: This work is sponsored by the University of Lorraine and is a part of supervisor implementation project for a flexible manufacturing system in National Engineering School of Metz (ENIM ...
doi:10.3390/app7040399
fatcat:azkwddw6vrhjzhed4nmgl7kxt4
Heuristic search for scheduling flexible manufacturing systems using lower bound reachability matrix
2010
Computers & industrial engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For scheduling flexible manufacturing systems efficiently, we propose new heuristic functions for A Ã algorithm that is based on the T-timed Petri net. ...
The experimental results using a random problem generator show that the proposed heuristic functions perform better as we expected. ...
To solve the scheduling problem, a number of methods have been proposed in the literature. ...
doi:10.1016/j.cie.2010.08.006
fatcat:5k4ggp3w4bee5dvfiitztgrwya
Construction of Multi-project Network Planning based on BOM and its Resource Leveling
2021
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
On this basis, aiming at the problem of resource leveling in multi-project planning management, this paper proposes a genetic algorithm, which provides a transformation method for resource optimization ...
In addition, this paper presents a new genetic coding method and improves the crossover operation. ...
Heuristic methods have been used to solve multi-project scheduling problems. Meloni et al. ...
doi:10.1109/access.2021.3078840
fatcat:5qpyelml3jbddb7a7iffpeu5zu
« Previous
Showing results 1 — 15 out of 1,670 results