This paper deals with formal modelling of Petri nets including shared resources. These phenomena appear widely in the production management context, for the modelling of manufacturing cells. But, they usually cannot be formally represented in dioid algebraic structures based on sets of scalars. In this paper, we design a method to describe such a phenomenon in a dioid of intervals. In fact, the resource-sharing problem is turned into a time uncertainty problem, regarding the access to the shared resource. In this new problem, time uncertainties are bounded and can be described by intervals. Both bounds of the behaviours of the studied production systems can be manipulated in the scope of the ℤmax dioid, even though the original systems are ...
Queueing models with simultaneous resource possession can be used to model production systems, in wh...
International audienceThis paper is devoted to the exact resolution of a strongly NP-hard resource-c...
Previous work on Linear Resource Temporal Networks (LRTNs) has shown how to construct tight bounds f...
This paper deals with the disambiguation of the behaviour of Petri nets including shared resources. ...
Flow-shops are manufacturing deterministic systems which can be analytically modelled in a fairly ea...
AbstractIn job-shop systems, each product is routed according to its own production cycle. However r...
The topic of this paper is modeling and control of timed discrete event systems in a dioid framework...
AbstractThis paper discusses the usage of shared resources in the context of production networks. A ...
The paper focuses on the correct representation of shared resources in Petri net models of automated...
Inspired by the pioneering work of Petri and the rise of diagrammatic formalisms to reason about net...
This paper is dedicated to the study of constraints violation in manufacturing workshops with time c...
Using an industrial process from the car sector, we show how dioid algebra may be used for the perfo...
AbstractIt is shown that a large class of flexible manufacturing cells can be modeled using timed Pe...
Scheduling a manufacturing system is usually an NP-hard problem. This means that only heuristic algo...
The present work focuses on optimal management, resource sharing and conflicts resolution in Discret...
Queueing models with simultaneous resource possession can be used to model production systems, in wh...
International audienceThis paper is devoted to the exact resolution of a strongly NP-hard resource-c...
Previous work on Linear Resource Temporal Networks (LRTNs) has shown how to construct tight bounds f...
This paper deals with the disambiguation of the behaviour of Petri nets including shared resources. ...
Flow-shops are manufacturing deterministic systems which can be analytically modelled in a fairly ea...
AbstractIn job-shop systems, each product is routed according to its own production cycle. However r...
The topic of this paper is modeling and control of timed discrete event systems in a dioid framework...
AbstractThis paper discusses the usage of shared resources in the context of production networks. A ...
The paper focuses on the correct representation of shared resources in Petri net models of automated...
Inspired by the pioneering work of Petri and the rise of diagrammatic formalisms to reason about net...
This paper is dedicated to the study of constraints violation in manufacturing workshops with time c...
Using an industrial process from the car sector, we show how dioid algebra may be used for the perfo...
AbstractIt is shown that a large class of flexible manufacturing cells can be modeled using timed Pe...
Scheduling a manufacturing system is usually an NP-hard problem. This means that only heuristic algo...
The present work focuses on optimal management, resource sharing and conflicts resolution in Discret...
Queueing models with simultaneous resource possession can be used to model production systems, in wh...
International audienceThis paper is devoted to the exact resolution of a strongly NP-hard resource-c...
Previous work on Linear Resource Temporal Networks (LRTNs) has shown how to construct tight bounds f...