Petri Net model of repetitive push manufacturing with Polca to minimise value-added WIP.
Saved in:
| Title: | Petri Net model of repetitive push manufacturing with Polca to minimise value-added WIP. |
|---|---|
| Authors: | Aziz, M.H.1 (AUTHOR) muhammad.haris.aziz@ait.asia, Bohez, ErikL.J.1 (AUTHOR), Pisuchpen, Roongrat2 (AUTHOR), Parnichkun, Manukid1 (AUTHOR) |
| Source: | International Journal of Production Research. Aug2013, Vol. 51 Issue 15, p4464-4483. 20p. 2 Diagrams, 8 Charts, 12 Graphs. |
| Subjects: | Petri nets, Repetitive manufacturing systems, Value added (Marketing), Work in process, Just-in-time systems, Mixed integer linear programming, Simulation methods & models, Bottlenecks (Manufacturing) |
| Abstract: | A common simplifying assumption used in the literature is to minimise average Work In Process (WIP), while achieving maximum production rate, which does not consider the fact that the value of WIP increases down the stream of a production process as labour, time, energy and resources are added to it. This paper aims at minimising queues of parts waiting downstream of production process and in turn minimising value-added WIP by constraining more and more inventory of unfinished products at the earlier stages of production. For this reason, generic black token closed loop Petri Net (PN) model of Flexible Flow Shop (FFS) with Paired-cell Overlapping Loops with Card Authorisation (POLCA) is developed. Tokens in the control loops represent Polca cards to control the flow of material from order release till finished products. Marking of PN is done through Mix Integer Linear Programming after the computation of semi-positive P invariants. Simulation is being done to obtain queues of parts, waiting at each station during demand variation. Results were compared with PN model of FFS without Polca. Results showed the constriction of unnecessary WIP towards the initial stage of production instead of at bottlenecks, with proposed model, and in turn minimisation of value-added WIP. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | A common simplifying assumption used in the literature is to minimise average Work In Process (WIP), while achieving maximum production rate, which does not consider the fact that the value of WIP increases down the stream of a production process as labour, time, energy and resources are added to it. This paper aims at minimising queues of parts waiting downstream of production process and in turn minimising value-added WIP by constraining more and more inventory of unfinished products at the earlier stages of production. For this reason, generic black token closed loop Petri Net (PN) model of Flexible Flow Shop (FFS) with Paired-cell Overlapping Loops with Card Authorisation (POLCA) is developed. Tokens in the control loops represent Polca cards to control the flow of material from order release till finished products. Marking of PN is done through Mix Integer Linear Programming after the computation of semi-positive P invariants. Simulation is being done to obtain queues of parts, waiting at each station during demand variation. Results were compared with PN model of FFS without Polca. Results showed the constriction of unnecessary WIP towards the initial stage of production instead of at bottlenecks, with proposed model, and in turn minimisation of value-added WIP. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 00207543 |
| DOI: | 10.1080/00207543.2013.765073 |
