Evaluation of job-shops with random manufacturing times : a Petri net approach - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1989

Evaluation of job-shops with random manufacturing times : a Petri net approach

Abstract

In this paper, we use event graphs, a paricular type of Petri nets, to evaluate job-shops when manufacturing times are random variables and the control is defined as the sequence of product types at the entrance of each machine. Under very general assumptions, we prove that the cycle time of the system converges in probability to a constant and asymptotically tends in distribution to a normal distribution whose standard deviation tends to zero. We also provide a lower bound of the main cycle time. We finally derive from the previous results a heuristic algorithm which leads to a near optimal solution of the problem (an optimal solution being the minimal work-in-process which allows the maximal productivity, i.e. the minimal cycle time, knowing the control).
Fichier principal
Vignette du fichier
RR-1112.pdf (860.87 Ko) Télécharger le fichier

Dates and versions

inria-00075447 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00075447 , version 1

Cite

Saïd Laftit, Jean-Marie Proth. Evaluation of job-shops with random manufacturing times : a Petri net approach. [Research Report] RR-1112, INRIA. 1989, pp.15. ⟨inria-00075447⟩
49 View
96 Download

Share

Gmail Facebook X LinkedIn More