Flexible process sequencing using Petri net theory

Lee, KyungHuy; Jung, Mooyoung

doi:10.1016/0360-8352(94)00191-o

Cited by 30 publications

(12 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, the tree-structured precedence graph is used since it can be used to generate operation sequences without considering alternative operations. For other representation methods for operation selection and sequencing in process planning, see Cho et al (1994), Lee and Jung (1995) and Kiritsis et al (1999). Figure 1(a) shows the tree-structured precedence graph for an example part with nine operations, in which there are four precedence paths and two sets of alternative operations {2, 8} and {5, 9}.…”

Section: Problem Description and Iterative Approachmentioning

confidence: 99%

Iterative approach to operation selection and sequencing in process planning

Lee

Kiritsis

Xirouchakis

2004

International Journal of Production Research

View full text Add to dashboard Cite

This paper considers the problem of selecting and sequencing operations in process planning for the objective of minimizing the sum of operation processing costs and machine, set-up and tool change costs. The main constraint is the precedence relations among operations. To represent the precedence relations and alternative operations, a tree-structured precedence graph is suggested. Based on the graph, the entire problem is decomposed into two subproblems: operation selection and operation sequencing. Then, three iterative algorithms are suggested that solve the two subproblems iteratively until optimal and nearoptimal solutions are obtained. The algorithms are illustrated using an example part, and to show the performances of the algorithms, computational experiments were done on randomly generated test problems. The results show that the algorithms suggested work well for the test problems. IntroductionComputer-aided process planning (CAPP) is an approach that uses computers to generate a process plan that contains the route, operations, operation parameters, machines, set-ups and tools required for producing a part. Although process planning activities are different according to different industries and shops, they involve several or all of the following (Chang 1990): (1) selection of machining operations;(2) sequencing of machining operations; (3) selection of cutting tools; (4) selection of machine tools; (5) determining set-up requirements; (6) calculations of cutting parameters; (7) tool path planning and generation of NC part programs; and (8) design of jigs and fixtures. There are a number of previous research articles on the above process planning activities. For surveys on these subjects, see Ham and Lu (1988), Alting and Zhang (1989), ElMaraghy et al. (1993) and Kiritsis (1995).Among the various activities in process planning, this paper focuses on the operation selection and sequencing problems. That is, the problem considered in this paper is to select operations among alternatives as well as to determine the sequence of the selected operations so that the resulting solution satisfies the precedence constraints among operations. The objective is to minimize the sum of operation processing costs and machine, set-up and tool change costs. The operation selection and sequencing are needed to consider at the same time since better solutions can be obtained over the extended solution space. However, the two problems, especially

show abstract

Section: Problem Description and Iterative Approachmentioning

confidence: 99%

Iterative approach to operation selection and sequencing in process planning

Lee

Kiritsis

Xirouchakis

2004

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…For a dynamic model, Peng and Zhou 8, Zha and Lim 19, Lee and Jung 20 introduced a new firing function combined with all external input conditions. The new firing function is defined as: where X is the input relay; Y is the output relay; D is the data register; M is the auxiliary relay; S is the step relay; T is the timer; and C is the counter.…”

Section: Petri Nets Theory Overviewmentioning

confidence: 99%

A petri nets‐based process planning system for wastewater treatment

Yao

Liao

2010

Asian Journal of Control

View full text Add to dashboard Cite

It is always challenging to simulate, debug or diagnose automated systems. The aim of this paper is to present the development of a convenient tool for reengineering the control system in a complicated industrial wastewater treatment plant. In this project, a PC-based Human-Machine Interface (HMI) in conjunction with Petri nets (PN) theory is adopted to develop and simulate the operational process for wastewater treatment. The resultant tool offers many advantages to the reality of the automated control world. It not only reduces the process reengineering time and the cost of error recovery, but also builds a panel of human interface for the process. The discrete event control sequence of wastewater treatment can be easily modeled and evaluated before its build-up. Furthermore, this PN-based system can be used as an online diagnostic tool when the wastewater treatment process is malfunctioning. That is, the presented PN tool provides an adequate means for offline process development, simulation, performance evaluation, and quick online process diagnosis.

show abstract

“…By the end of 1980s, more than 156 Computer-Aided Process Planning (CAPP) systems have been reported in the literature survey by Alting and Zhang (1989). Among many others, previous research studies on process planning include object-oriented approach (Zhang et al, 1999), neural network-based approach (Park et al, 1996;Devireddy and Ghosh, 1999;Monostori et al, 2000), Petri net-based approach (Lee and Jung, 1995;Xirouchakis et al, 1998), genetic algorithm-based approach (Zhang et al, 1997), multi-agent bidding-based approach (Gu et al, 1997), constraint-based approach (Márkus et al, 2002), feature-driven approach (Wang and Norrie, 2001) and information and knowledge management (Lutters et al, 1999;Denkena et al, 2007). These reported approaches and their combinations have been applied to several specific problem domains, such as setup planning (Ong and Nee, 1996), process sequencing (Yeo et al, 1998), tool selection (Lim et al, 2001), cutting parameter selection (Arezoo et al, 2000) and tool path planning (Boogert et al, 1996).…”

Section: Introductionmentioning

confidence: 98%

Web-DPP: towards job-shop machining process planning and monitoring

Wang

Feng

2011

IJMR

View full text Add to dashboard Cite

Outsourcing, joint ventures and cross-border collaborations have led to job environments geographically distributed. Targeting the distributed environment, the web has been widely used for developing collaborative applications due to its platform, network and operating system transparency and easy-to-use interface. Utilising the existing infrastructure, the objective of this research is to develop an integrated Web-based Distributed Process Planning (Web-DPP) system for job-shop machining operations and execution monitoring. Our approach engages a dispersed working group in a collaborative environment, allowing team members to share real-time information through the Web-DPP. This paper presents both the system design specification and the latest development.

show abstract

Flexible process sequencing using Petri net theory

Cited by 30 publications

References 20 publications

Iterative approach to operation selection and sequencing in process planning

Iterative approach to operation selection and sequencing in process planning

A petri nets‐based process planning system for wastewater treatment

Web-DPP: towards job-shop machining process planning and monitoring

Contact Info

Product

Resources

About