Manufacturing Resource Modeling With Petri Nets

1999 ◽  
Author(s):  
Dimitris Kiritsis ◽  
Paul Xirouchakis
Keyword(s):  
Petri Nets ◽  
Process Planning ◽  
Petri Net ◽  
Cost Estimation ◽  
Modeling Method ◽  
Delivery Time ◽  
Planning And Scheduling ◽  
Process Plans ◽  
Machined Parts ◽  
The Cost

Abstract The problem under consideration is the modeling of manufacturing resources like machine tools, setups and tools which affect the cost and batch delivery time estimation of machined parts. The proposed resource models are built upon Petri net models for process planning and scheduling with three methods: (i) an implicit modeling method where resources are modeled as a data structure which acts on a specific Process Planning Petri net (PP-net), (ii) a first explicit modeling method where resources, are modeled as separated Petri nets whose places are connected to PP-net transitions with adequate arcs and form a Process Planning Cost System (PPC-system) and (iii) a second explicit modeling method where a two-level Petri net model is proposed which allows the modular modeling of process plans and resources. In the later case, integration is achieved through an synchronization mechanism. The first two methods are used for the cost estimation of process plans of unique parts while the third one is used for delivery time and cost estimation of a batch of machined parts.

Identifying Similar Parts for Assisting Cost Estimation of Prismatic Machined Parts

2004 ◽  
Author(s):  
Antonio Cardone ◽  
Satyandra K. Gupta ◽  
Mukul Karnik
Keyword(s):  
Distance Function ◽  
Cost Estimation ◽  
Small Distance ◽  
Point Of View ◽  
The Other ◽  
Shape Similarity ◽  
Feature Vectors ◽  
Machined Parts ◽  
Measure Of Similarity ◽  
The Cost

This paper presents a method for identifying those parts in a database that are similar to a given query part to be machined and hence can be potentially used as a basis for estimating the machining cost of the query part. We utilize projected feature vectors consisting of feature access directions, feature types, and feature volumes as a basis for assessing shape similarity. We have defined a distance function between two sets of projected feature vectors to assess the similarity between them from the cost estimation point of view. To assess similarity between the two parts, one set of projected feature vectors is transformed in space using rigid body transformations with respect to the other set such that the distance between them is minimized. The distance between the projected feature vectors is used as a measure of similarity between the two parts. The existing parts are rank ordered based on the value of the distance with respect to the new part. The cost of machining the new part can then be estimated by using the cost of previously machined parts that have a very small distance from the new part.

Deviplan: A Bid Preparation System for Mechanical SMEs

2000 ◽  
Author(s):  
Dimitris Kiritsis ◽  
Paul Xirouchakis
Keyword(s):  
Petri Net ◽  
Cost Estimation ◽  
Machine Tools ◽  
Software Tool ◽  
Machining Parameters ◽  
Machining Time ◽  
Process Plan ◽  
Machined Parts ◽  
Product Description ◽  
Bid Preparation

Abstract The problem under consideration is the cost estimation and consequent bid preparation for machined parts subcontracted to mechanical small and medium enterprises (SME). This activity, i.e. cost estimation and corresponding bid preparation, becomes more and more important due to the increasing and globalized competition in this market. There is, therefore, a clear need for precise and accurate cost estimation of machined parts in order for a small company to justify its prices. The proposed prototype software system is based (i) on a manufacturing feature based product description of the part to be machined and (ii) on a non-linear model of its process plan using Petri nets, taking into consideration processing alternatives and precedence constraints, which allows a heuristic based best search of the process plan and, consequently, the corresponding machining time and cost. Product description is done interactively through user friendly interfaces and the corresponding process planning model is constructed automatically in the form of a Petri net. Machine tools and their characteristics are selected from a customized database. Tools and machining parameters are selected through a link with the tool management software TOOL Light©. Minimum time or cost process plans and corresponding bids are reported using the Petri net model of the machined part under consideration and using machining heuristics. The type of parts that are considered in our application are rotational or prismatic parts that are used as components in complex machines like machine tools or automatic assembly machines.

scholarly journals A Mathematical Model and Self-Adaptive NSGA-II for a Multiobjective IPPS Problem Subject to Delivery Time

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Li Ba ◽  
Mingshun Yang ◽  
Xinqin Gao ◽  
Yong Liu ◽  
Zhoupeng Han ◽  
...  
Keyword(s):  
Process Planning ◽  
Manufacturing Systems ◽  
Just In Time ◽  
Delivery Time ◽  
Nsga Ii ◽  
Planning And Scheduling ◽  
Adaptive Decoding ◽  
Manufacturing Environments ◽  
Crucial Part ◽  
Self Adaptive

Process planning and scheduling are two important components of manufacturing systems. This paper deals with a multiobjective just-in-time integrated process planning and scheduling (MOJIT-IPPS) problem. Delivery time and machine workload are considered to make IPPS problem more suitable for manufacturing environments. The earliness/tardiness penalty, maximum machine workload, and total machine workload are objectives that are minimized. The decoding method is a crucial part that significantly influences the scheduling results. We develop a self-adaptive decoding method to obtain better results. A nondominated sorting genetic algorithm with self-adaptive decoding (SD-NSGA-II) is proposed for solving MOJIT-IPPS. Finally, the model and algorithm are proven through an example. Furthermore, different scale examples are tested to prove the good performance of the proposed method.

scholarly journals Global Supervisory Structure for Decentralized Systems of Flexible Manufacturing Systems Using Petri Nets

Processes ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 595 ◽  
Author(s):  
Muhammad Bashir ◽  
Liang Hong
Keyword(s):  
Computational Complexity ◽  
Petri Nets ◽  
Petri Net ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Structural Complexity ◽  
Decentralized Systems ◽  
The Cost ◽  
Global Controller

Decentralized supervisory structure has drawn much attention in recent years to address the computational complexity in designing supervisory structures for large Petri net model. Many studies are reported in the paradigm of automata while few can be found in the Petri net paradigm. The decentralized supervisory structure can address the computational complexity, but it adds the structural complexity of supervisory structure. This paper proposed a new method of designing a global controller for decentralized systems of a large Petri net model for flexible manufacturing systems. The proposed method can both reduce the computational complexity by decomposition of large Petri net models into several subnets and structural complexity by designing a global supervisory structure that can greatly reduce the cost at the implementation stage. Two efficient algorithms are developed in the proposed method. Algorithm 1 is used to compute decentralized working zones from the given Petri net model for flexible manufacturing systems. Algorithm 2 is used to compute the global controller that enforces the liveness to the decentralized working zones. The ring assembling method is used to reconnect and controlled the working zones via a global controller. The proposed method can be applied to large Petri nets size and, in general, it has less computational and structural complexity. Experimental examples are presented to explore the applicability of the proposed method.

Study on Models of Planning and Scheduling in IT Manufacturing Processes

2010 ◽  
Vol 20-23 ◽  
pp. 28-33
Author(s):  
Da Wei Liu ◽  
Hong Bin Liu
Keyword(s):  
Process Planning ◽  
Manufacturing Process ◽  
Manufacturing System ◽  
Manufacturing Processes ◽  
Key Factors ◽  
Integration Model ◽  
Planning And Scheduling ◽  
Process Plans ◽  
Manufacturing Process Planning

Traditionally, Models of IT manufacturing process planning and scheduling were carried out in a sequential way, where scheduling was done after process plans had been delivered. Since the two functions are usually complementary, it is necessary to integrate them correctly so that performance of an IT manufacturing system can be improved efficiently. In the thesis, a new integration model focused on key factors has been developed to facilitate the integration and optimization. The practice of the models show that the proposed approaches are promising and very effective methods for the integration of process planning and scheduling in IT manufacturing processes.

STRUCTURAL MODELING AND ANALYSIS OF SIGNALING PATHWAYS BASED ON PETRI NETS

2006 ◽  
Vol 04 (05) ◽  
pp. 1119-1140 ◽  
Author(s):  
CHEN LI ◽  
SHUNICHI SUZUKI ◽  
QI-WEI GE ◽  
MITSURU NAKATA ◽  
HIROSHI MATSUNO ◽  
...  
Keyword(s):  
Petri Nets ◽  
Signaling Pathways ◽  
Signaling Pathway ◽  
Molecular Interactions ◽  
Petri Net ◽  
Structural Modeling ◽  
Modeling Method ◽  
Activation Process ◽  
Modeling And Analysis

The purpose of this paper is to discuss how to model and analyze signaling pathways by using Petri net. Firstly, we propose a modeling method based on Petri net by paying attention to the molecular interactions and mechanisms. Then, we introduce a new notion "activation transduction component" in order to describe an enzymic activation process of reactions in signaling pathways and shows its correspondence to a so-called elementary T-invariant in the Petri net models. Further, we design an algorithm to effectively find basic enzymic activation processes by obtaining a series of elementary T-invariants in the Petri net models. Finally, we demonstrate how our method is practically used in modeling and analyzing signaling pathway mediated by thrombopoietin as an example.

A Generic Petri Net Model for Dynamic Process Planning

1994 ◽  
Author(s):  
Dimitris Kiritsis ◽  
Michel Porchet ◽  
Abdelkader Belhi
Keyword(s):  
Dynamic Model ◽  
Process Planning ◽  
Petri Net ◽  
Dynamic Process ◽  
Reachability Analysis ◽  
Process Plans ◽  
Precedence Relations ◽  
Planning Procedure ◽  
Complete Set ◽  
Manufacturing Knowledge

Abstract In this paper a generic dynamic model for process planning is presented, based on Petri net technology. The proposed Petri net model 1) represents manufacturing knowledge of the type of precedence relations constraints 2) represents dynamically the process planning procedure itself, and 3) encapsulates all possible process planning solutions (process plans). Furthermore, process planning simulation can be performed directly on the Petri net and reachability analysis of the model gives the complete set of solutions (process plans). Then, optimum solutions can be found by using a method based on heuristics.

The Modeling Method and Analysis of Online Top-Up System Based on Open Petri Net

2014 ◽  
Vol 571-572 ◽  
pp. 453-456
Author(s):  
Xiao Mao Li ◽  
Xian Wen Fang
Keyword(s):  
Complex System ◽  
Petri Nets ◽  
Petri Net ◽  
Mathematical Analysis ◽  
Modeling Method ◽  
Network System ◽  
Open Network ◽  
Analysis Methods ◽  
And Behavior

Petri nets have structure and behavior properties, it is convenient to analyze some complex system based on its mathematical analysis methods. Online top-up system is an open network system. The modeling method of this system based on general Petri net has some limitations. A new modeling method based on open Petri net to study online top-up system is proposed, and analyze the open Petri net model by T-invariant. This method laid a foundation for the study of open online top-up system.

Sign in / Sign up

Export Citation Format

Share Document