Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 30184
Production Planning and Measuring Method for Non Patterned Production System Using Stock Cutting Model

Authors: S. Homrossukon, D. Aromstain

Abstract:

The simple methods used to plan and measure non patterned production system are developed from the basic definition of working efficiency. Processing time is assigned as the variable and used to write the equation of production efficiency. Consequently, such equation is extensively used to develop the planning method for production of interest using one-dimensional stock cutting problem. The application of the developed method shows that production efficiency and production planning can be determined effectively.

Keywords: Production Planning, Parallel Machine, Production Measurement, Cutting and Packing.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1059649

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 879

References:


[1] H. Dykhoff, "A typology of cutting and packing problem," European Journal of Operational Research, 44, 1990, pp. 145-159.
[2] P. C. Gilmore, R. E. Gomory, "Linear programming Approach to the cutting-stock problem," Operation Research, 9(6), 1961, pp. 849-859.
[3] P. C. Gilmore, R. E. Gomory, "Linear programming Approach to the cutting-stock problem-part II," Operation Research, 11(6), 1963, pp. 863-888.
[4] M. Gradi┼íar, G. Resinovi─ì, M. Kljajić, "Evaluation of algorithms for one-diamensional cutting," Computer & Operations Research, 29(9), 2002, pp. 1207-1220.
[5] T. Gau, G. Wäscher, "CUTGEN1: A problem generator for the Standard One-dimensional Cutting Stock Problem," European Journal of Operational Research, 84, 1995, pp. 572-579.
[6] D. R. Sule, "Parallel Processing and Batch Sequencing," Industrial Scheduling, Boston, MA: PWS Publishing Co., 1997, pp. 81-111.
[7] M. Pinedo, "Parallel Machine Model (Deterministic)," Scheduling Theory, Algorithm, and Systems, 2nd ed., Upper Saddle River, NJ: Prentice-Hall, Inc., 2002, pp. 93-128.
[8] T. Aktin, R. G. Özdemir, "An integrate approach to the one-dimensional cutting stock problem in coronary, " European Journal of Operation Research, 2008, doi:10.1016/j.ejor.2008.04.005
[9] H. H. Yanasse, M. J. P. Lamosa, "An integrated cutting stock and sequencing problem," European Journal of Operational Research, 183, 2007, pp. 1353-1370.
[10] P. Trkman, M. Gradisar, "One-dimensional cutting stock optimization in consecutive time periods," European Journal of Operational Research, 179, 2007, pp. 291-301.
[11] A. C. Cherri, M. N. Arenales, H. H. Yanasse, "The one-dimensional cutting stock problem with usable leftover- A heuristic approach," European Journal of Operation Research, 2008, doi:10.1016/j.ejor.2008.04.039
[12] A. C. Dikili, A. C. Takinaci, N. A. Pek, "A new heuristic approach to one-dimensional stock-cutting problems with multiple stock lengths in ship production," Ocean Engineering, 35, 2008, pp. 637-645.
[13] M. C. N. Gramani, P. M. França, "The combined cutting stock and lotsizing problem in industrial processes," European Journal of Operational Research, 174, 2006, pp. 509-521.
[14] M. Gradi┼íar, M. Kljajić, G. Resinović, J. Jesenko, "A sequential heuristic procedure for one-dimensional cutting," European Journal of Operation Research, 114, 1999, pp.557-568.
[15] G. F. Cintra, F. K. Miyazawa, Y. Wakabayashi, E. C. Xavier, "A note on the approximability of cutting stock problem," European Journal of Operation Research, 183, 2007, pp. 1328-1332.
[16] J. Rietz, S. Dempe, "Large faps in one dimensional cutting stock problems," Discrete Applied Mathematics, 156, 2008, pp. 1929-1935.
[17] E. G. Coffman, Jr., M. R. Garey, D. S. Johnson, "Bin Packing Approximation Algorithms: A Survey," Approximation Algorithms for NP-Hard Problems, D. Hochbaum, Ed. Boston, MA: PWS Publishing Co., 1996.
[18] Kanawaty, G., Introduction to Work Study, 4th eds, 1992, International Labor Office Geneva.
[19] L. Schrage, Optimization Model with LINGO, 6th. ed, Available: http://www.lindo.com