Constrained Spatial Layout and Simultaneous Production Evaluation for a Production System

Abstract

This paper proposes a mathematical model called Multi-objective Production System Design (MOPSD) model and a two-staged solving procedure. The MOPSD model not only considers the two-dimensional layout of a production system under the constrained factory space to achieve the minimal total material transportation flow but also determines the optimal assigned number of workstations and the optimal system cycle time concerning a simultaneous production situation. The first major objective of MOPSD model is regarded as a Quadratic Assignment Problem (QAP), but it considers the size of operation element, the multiple production lines, and the constrained two-dimensional factory space where traditional QAP studies are seldom mentioned. The second objective of the MOPSD model is to determine the optimal system cycle time as well as the optimal assigned number of workstations under the simultaneous production situation for preventing the underestimation of the system production rate.

The first-stage solving procedure of the MOPSD model applies the space discrete technique to make the infinite deployable locations become finite, and then one can achieve the major objective through the system layout. In addition, the Four Position Coding Technique (FPCT) is developed to code the nodes in the deployed production system obtaining from the first stage, and therefore those FPCT codes can function as the input parameters in the second-stage solving procedure. These two solving procedures are constructed by the syntax of Lingo 9.0 extended version, and a numerical example is followed to describe the detailed solving procedure. In summary, the repeated characteristic of the MOPSD model and its solving procedure make this study a valuable decision support tool because they are constructed by the packaged software Lingo 9.0. That is, a factory can easily duplicate to solve other cases by changing its input parameters only.

Keywords

QAP FPCT space discrete Lingo 9.0 cycle time

Get full access to this article

View all access options for this article.

References

Tompkins, J. A. , White, J. A. , Bozer, Y. A. and Tanchoco, J. M. A. (2002). Facilities Planning, 3rd edn., New York: John Wiley & Sons, Inc.

Apple, J. M. (1983). Plant Layout and Material Handling, New York: John Wiley & Sons, Inc.

Koopmans, T. C. and Beckman, M. (1957). Assignment Problems and the Location of Economics Activities , Econometrica, 25(1): 53-76 .

Lawler, E. L. (1963). The Quadratic Assignment Problem , Management Science, 9(4): 586-599 .

Sahni, S. and Gonzalez, T. (1976). NP-complete Approximation Problems , Journal of the ACM, 23(3): 555-565 .

Gorey, M. R. and Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-completeness, New York: W.H. Freeman .

Gong, D. , Yamazaki, G. , Gen, M. and Xu, W. (1999). A Genetic Algorithm Method for One-dimensional Machine Location Problems , International Journal of Production Economics, 60-61: 337-342 .

Drezner, Z. (2005). The Extended Concentric Tabu for the Quadratic Assignment Problem , European Journal of Operational Research, 160(2): 416-422 .

Shin, H. J. , Kim, C. O. and Kim, S. S. (2002). A Tabu Search Algorithm for Single Machine Scheduling with Release Times, Due Dates, and Sequence-dependent Setup Times , International Journal of Advanced Manufacturing Technology, 19(11): 859-866 .

10.

Misevicius, A. (2003). Genetic Algorithm Hybridized with Ruin and Recreate Procedure: Application to the Quadratic Assignment Problem , Knowledge-Based Systems, 16(5-6): 261-268 .

11.

Sarker, B. R. , Wilhelm, W. E. and Hogg, G. L. (1998). One-dimensional Machine Location Problems in a Multi-product Flowline with Equidistant Locations , European Journal of Operational Research, 105(3): 401-426 .

12.

Wu, M. C. , Hsiung, Y. and Hsu, H. M. (2005). A Tool Planning Approach Considering Cycle Time Constraints and Demand Uncertainty , International Journal of Advanced Manufacturing Technology, 26(5-6): 565-571 .

13.

Bryton, B. (1954). Balancing of a Continuous Production Line, Management Science Thesis, North-Western University.

14.

Salveson, M. E. (1955). The Assembly Line Balancing Problem , Journal of Industrial Engineering, 6(3): 18-25 .

15.

Erel, E. and Gokcen, H. (1999). Shortest-route Formulation of Mixed-model Assembly Line Balancing Problem , European Journal of Operational Research, 116(1): 194-204 .

16.

Kim, Y. K. , Kim, Y. J. and Kim, Y. (1996). Genetic Algorithms for Assembly Line Balancing with Various Objectives , Computers and Industrial Engineering, 30(3): 397-409 .

17.

Ugurdag, H. F. , Rachamadugu, R. and Papachristou, C. A. (1997). Designing Paced Assembly Lines with Fixed Number of Stations , European Journal of Operational Research, 102(3): 488-501 .

18.

Chin, K. S. , Zhao, Y. and Mok, C. K. (2002). STEP-based Multiview Integrated Product Modelling for Concurrent Engineering , International Journal of Advanced Manufacturing Technology, 20: 896-906 .

19.

Ostrosi, E. , Ferney, M. and Garro, O. (2003). A Fractal-based Approach for Concurrent Engineering , Concurrent Engineering: Research and Applications, 11(4): 249-265 .

20.

Sami, K. and Berman, K. (2005). The Effect of the Learning Process in Concurrent Engineering Projects , Concurrent Engineering: Research and Applications, 13(3): 209-217 .

21.

Abernathy, W. J. (1971). Some Issues Concerning the Effectiveness of Parallel Strategies in R&D Projects , IEEE Transactions on Engineering Management, EM-18(3): 80-89 .

22.

Winner, R. I. , Pennell, J. P. , Bertrend, H. E. and Slusarczuk, M. M. G. (1988). The Role of Concurrent Engineering in Weapons System Acquisition, IDA Report R-338, Institute for Defense Analyses, Alexandria, VA .

23.

Yassine, A. and Braha, D. (2003). Complex Concurrent Engineering and the Design Structure Matrix , Concurrent Engineering: Research and Applications, 11(3): 165-176 .