Back to Search
Start Over
A Petri net-based heuristic for mixed-model assembly line balancing problem of Type-E.
- Source :
- International Journal of Production Research; Mar2014, Vol. 52 Issue 5, p1542-1556, 15p, 4 Diagrams, 6 Charts
- Publication Year :
- 2014
-
Abstract
- To effectively respond to the changing market demands, a manufacturer should produce variety of products with small lots. Thus, multiple products (models) are assembled simultaneously on a same line. However, it is very challenging to balance such an assembly line. This paper conducts a study on balancing a mixed-model assembly line of Type E. To solve this problem, a coloured-timed Petri net model is developed to describe the task precedence relationship. Also, the optimisation problem is formulated as a mathematical programming model. Then, with the models, a two-stage heuristic algorithm is proposed to solve the problem. At the first stage, based on the Petri net model, a P-invariant algorithm (PA) is presented to minimise the number of workstations. At the second stage, a heuristic is proposed to further minimise the cycle time by combining the PA with a binary search algorithm (BSA). Performance of the proposed method is evaluated by an illustrative example and numerical experiments. It is shown that it works well in terms of both solution accuracy and computational efficiency for large size problems. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00207543
- Volume :
- 52
- Issue :
- 5
- Database :
- Complementary Index
- Journal :
- International Journal of Production Research
- Publication Type :
- Academic Journal
- Accession number :
- 94803550
- Full Text :
- https://doi.org/10.1080/00207543.2013.849010