Skip to Main content Skip to Navigation
Reports

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).
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00075447
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 6:14:11 PM
Last modification on : Thursday, February 11, 2021 - 2:48:12 PM
Long-term archiving on: : Tuesday, April 12, 2011 - 7:04:34 PM

Identifiers

  • HAL Id : inria-00075447, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

136

Files downloads

173