Production-process modelling based on production-management data: a Petri-net approach

Gradišar, Dejan; Mušič, Gasper

doi:10.1080/09511920601103064

Cited by 32 publications

(13 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…by generating neigbour solutions given a feasible solution is known. An initial feasible solution can be easily obtained by employing an arbitrary PN conflict resolution strategy, e.g., dispatching rules (Gradišar and Mušič, 2007). In the Operation Research (OR) literature several neighborhood generation operators have been proposed (Blazewicz et al, 1996;Jain et al, 2000).…”

Section: Pn Based Neighbour Solution Generationmentioning

confidence: 99%

“…This motivated the investigation of Petri net based optimization of manufacturing planning and scheduling problems. In our previous work a simulation based optimization approach applying Petri nets was intensively studied, as well as other, more classical approaches, such as dispatching rules and reachability tree based heuristic search (Gradišar and Mušič, 2007;Löscher et al, 2007;Mušič, 2008). In particular, the investigations focused on combination of Petri net modelling approach and local search methods (Löscher et al, 2007;Mušič, 2009.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Generation of Feasible Petri Net Based Scheduling Problem Solutions

Mušič

2015

IFAC-PapersOnLine

View full text Add to dashboard Cite

The contribution deals with local search based optimization of schedules that are modelled by Petri nets (PNs). PN modelling of scheduling problems in manufacturing domain is addressed and a generalization of neighbour solution generation is proposed. Such a solution generator can be used to optimize schedules by standard local search optimization algorithms. Neighbourhood construction procedures are described with the emphasis on solutions feasibility.

show abstract

Section: Pn Based Neighbour Solution Generationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Generation of Feasible Petri Net Based Scheduling Problem Solutions

Mušič

2015

IFAC-PapersOnLine

View full text Add to dashboard Cite

show abstract

“…(1) 5 T can't be triggered, and task b can't be implemented, so task b will be waiting resources. n n n ≤ + .…”

Section: Three Kinds Of Transitionmentioning

confidence: 99%

“…In recent years, Petri-Net was used to model and analyze various types of scheduling problems and had achieved good results. Gradisar [5] classified scheduling rules and established colored Petri-Nets Model for simulation of different scheduling rules. Ramirez [6] presented interpreted Petri-Nets to model the events and states of RCPSP system behaviour.…”

Section: Introductionmentioning

confidence: 99%

A Novel Petri-Net Based Resource Constrained Multi-project Scheduling Method

Wang

2014

Algorithms and Architectures for Parallel Processing

View full text Add to dashboard Cite

Abstract. This work proposes an extended Petri-Nets for resource constrained project scheduling problem (RCPSP). Several important issues about Petri-Nets on RCPSP are discussed in this paper. Firstly, the most important elements in Petri-Nets on RCPSP, including waiting place, activity place, resource place and final place, are designed. At the same time, three kinds of transitions are designed. They are coordination transition, resource allocating transition and resource releasing transition. Secondly, the Petri-Nets are improved according to the varying with increase or decrease of the number of resource acquisition. In this extended Petri-net, for the foremost difference with conventional Petri-Nets is to add a place and replace a releasing transition by the delaying transition and the firing rules of transition. Extensive experiments are performed to evaluate the performances of the proposed Petri-Nets against the state-of-art algorithms. The simulation experimental results of difference sides showed that extended Petri-Nets provides a more efficient way to solve RCPSP and produces competitive results compared with other methods investigated in this works.Keywords: RCPSP, Petri-Nets, Simulation, modeling. IntroductionRCPSP is widespread in engineering fields, such as job shop scheduling, flexible manufacturing systems and so on. In real engineering projects, there are usually multiple projects in parallel and competition for resources among projects, which increase the complexity of project scheduling. The resources allocation is necessary to consider the project itself and among projects. In addition, there is competition among the executed duration of projects, which leads to use some scheduling methods of the single project problem to the multi-project very difficultly. So how to model and solve multi-project in the environment of resource constrained is the key point of this research field. This paper will focus on the modeling technology and do some research on the RCPSP solution performance. In order to minimize the maximum completion time of the RCPSP, the approach based on the integer programming (IP) with Lagrange multiplier has attracted great attention where some multi-constraints in RCPSP. Although IP is an effective * Corresponding author.

show abstract

“…These methods can be applied to specific areas in real factory environments with high levels of production, together with large distribution centers. Additionally, during the development of the control system, an appropriate representation of the process is necessary to make possible the evaluation of the different control methodologies (Gradisar and Music 2007).…”

Section: Introductionmentioning

confidence: 99%

Improvements in operations management applied to a 3D simulation connected to a physical platform

2010

View full text Add to dashboard Cite

Logistics are a key factor for manufacturing companies in developed countries to better exploit their competitive advantages of proximity to market and flexibility. In order to improve the management of a logistics/distribution center, this paper proposes the use of control methods based on Multi-Agent Systems enhanced with Radio-Frequency Identification. However, the best way to demonstrate the benefits of using these solutions, is to apply them to a real company; but, naturally, this is impractical. In this paper, an experimental platform composed of a 3D simulation combined with a physical miniature model is used to illustrate the proposed control methods. The set-up described here has been assembled in the AUTOLOG laboratory at the University of Castilla-La Mancha in Spain. The design of the platform is somewhat generic, allowing adaptation to different distribution problems, but has been inspired on a real local facility. The objective of this system is to provide a testbench to experiment with multidisciplinary theories, techniques, and algorithms that can be grouped into four areas: automation and robotics, instrumentation and control, production planning, and logistics and distribution.

show abstract

Production-process modelling based on production-management data: a Petri-net approach

Cited by 32 publications

References 35 publications

Generation of Feasible Petri Net Based Scheduling Problem Solutions

Generation of Feasible Petri Net Based Scheduling Problem Solutions

A Novel Petri-Net Based Resource Constrained Multi-project Scheduling Method

Improvements in operations management applied to a 3D simulation connected to a physical platform

Contact Info

Product

Resources

About