Petri net based decision system modeling in real-time scheduling and control of flexible automotive manufacturing systems

Başak, Özkan; Albayrak, Y. Esra

doi:10.1016/j.cie.2014.09.024

Cited by 40 publications

(15 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The fuzzy Petri net (FPN), a kind of backward extension high-level Petri net (HLPN), has been widely applied to model and analyse uncertainty systems or knowledge-based systems (KBSs) [1]. Due to two unique features of FPN-structural store representation for fuzzy information and visualization description for uncertainty reasoning, FPN has been widely applied in various industrial areas, such as robotics [2,3], intelligent manufacturing systems [4,5], traffic control [6,7], semantic network [8,9], etc.…”

Section: Introductionmentioning

confidence: 99%

An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph

Zhou

Ding

et al. 2018

Symmetry

View full text Add to dashboard Cite

Fuzzy Petri net (FPN) is widely used to repre sent, model and analyse knowledge-based systems (KBSs). Meanwhile, a reachability tree is an important tool to fully represent the flow relationship of FPN and is widely applied to implement inference in industrial areas. However, the traditional reachability ignores recording the dependence relationships (‘and/or’ relationship) among the places in the neighbouring layers. This paper develops a modified reachability tree based on an and/or graph and presents a three-phase generation algorithm to model the reachability tree for the corresponding FPN automatically via fuzzy production rules (FPRs). Four cases are used to verify the correctness and feasibility of the proposed algorithm from different viewpoints, such as general FPRs, FPRs with a condition-sharing situation, FPRs with a conclusion-sharing situation, and FPRs with multi-conclusions. Simulation results reveal that the proposed approach has the ability to automatically generate the reachability tree for the corresponding FPN correctly.

show abstract

Section: Introductionmentioning

confidence: 99%

An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph

Zhou

Ding

et al. 2018

Symmetry

View full text Add to dashboard Cite

show abstract

“…The research of big data in the manufacturing industry focused on using different algorithms to optimize scheduling to assess the program. Basak and Albayrak (2014) proposed a real-time scheduling and control decision model based on object-oriented Petri net for automobile manufacturing. However, this algorithm is not applicable for batch mode adaptation and discrete manufacturing.…”

Section: Introductionmentioning

confidence: 99%

Data-driven process planning for shipbuilding

Bao

Zheng

Zhang

et al. 2017

AIEDAM

View full text Add to dashboard Cite

Erection planning in shipbuilding is a highly complex process. When a process change happens for some reason, it is often difficult to identify how many factors are affected and estimate how sensitive these factors can be. To optimize the planning and replanning of the shipbuilding plan for the best production performance, a data-driven approach for shipbuilding erection planning is proposed, which is composed of an erection plan model, identification of major factors related to the erection plan, and a data-driven algorithm to apply shipbuilding operation data for creating plans and forecasting, for plan adjustment, future availabilities of shipyard resources including machines, equipment, and man power. Through data clustering, the relevant factors are identified as a result of plan change, and critical equipment health management is carried out through data-driven anomaly detection. A case study is implemented, and the result shows that the proposed data-driven method is able to reschedule the shipbuilding plans smoothly.

show abstract

“…Besides their capability to validate and verify the behavior of systems, the simulation capabilities of these formal methods make it more flexible in combining them with solution approaches from Operations Research, Artificial Intelligence (AI), and the Computer Science domains. Specifically, Petri nets (PNs) are a powerful graphical and mathematical modeling tool, which have been extensively used to model, simulate, and analyze discrete-event systems characterized by concurrency, parallelism, causal dependency, resource sharing and synchronization [10,52]. Since its inception in Carl Adam Petri's PhD dissertation on "Communication with Automata" in 1962, it has gained recognition in the research community in addressing manufacturing and logistic systems including its application in a number of different disciplines like communications, transportation, robotics, engineering, business and air traffic management [80].…”

Section: Introductionmentioning

confidence: 99%

TIMSPAT – Reachability graph search-based optimization tool for colored Petri net-based scheduling

Baruwa

Piera

Guasch

2016

Computers & Industrial Engineering

View full text Add to dashboard Cite

The combination of Petri net (PN) modeling with AI-based heuristic search (HS) algorithms (PNHS) has been successfully applied as an integrated approach to deal with scheduling problems that can be transformed into a search problem in the reachability graph. While several efficient HS algorithms have been proposed albeit using timed PN, the practical application of these algorithms requires an appropriate tool to facilitate its development and analysis. However, there is a lack of tool support for the optimization of timed colored PN (TCPN) models based on the PNHS approach for schedule generation. Because of its complex data structure, TCPN-based scheduling has often been limited to simulation-based performance analysis only. Also, it is quite difficult to evaluate the strength and tractability of algorithms for different scheduling scenarios due to the different computing platforms, programming languages and data structures employed. In this light, this paper presents a new tool called TIMSPAT developed to overcome the shortcomings of existing tools. Some features that distinguish this tool are the collection of different HS algorithms, the event-driven exploration of the timed state space including its condensed variant, localized enabling of transitions, the introduction of a static place, and its easy-to-use syntax statements. The tool is easily extensible and can be integrated as a component into existing PN simulators and software environments. A comparative study is performed on a real-world eyeglass production system to demonstrate the usage of the tool for scheduling purposes.

show abstract

Petri net based decision system modeling in real-time scheduling and control of flexible automotive manufacturing systems

Cited by 40 publications

References 37 publications

An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph

An Automatic Algorithm to Generate a Reachability Tree for Large-Scale Fuzzy Petri Net by And/Or Graph

Data-driven process planning for shipbuilding

TIMSPAT – Reachability graph search-based optimization tool for colored Petri net-based scheduling

Contact Info

Product

Resources

About