Computation algorithm of the exact value of passive robustness in milk manufacturing workshop

Abstract

Developments presented in this paper are devoted to the robustness of manufacturing job-shops with time constraints and assembling tasks. A computing algorithm, of an exact bound of the maximal time disturbances allowed in a given point, is provided. To demonstrate the effectiveness and accuracy of this new algorithm, an industrial example is depicted. The example shows how the proposed algorithm results allow avoiding false alarms and mutually compensate a disturbance which is propagated on two parallel paths.