single-au.php

IJAT Vol.9 No.3 pp. 216-221
doi: 10.20965/ijat.2015.p0216
(2015)

Paper:

An Exact Method for Robust Capacity Requirements Planning

Daisuke Morita* and Haruhiko Suwa**

*Takachiho University
2-19-1 Ohmiya, Suginami-ku, Tokyo 168-8508, Japan

**Setsunan University
17-8 Ikeda-naka-machi, Neyagawa, Osaka 572-8508, Japan

Received:
December 1, 2014
Accepted:
February 24, 2015
Published:
May 5, 2015
Keywords:
capacity requirements planning, robust load plan, dynamic environment, uncertainty, exact method
Abstract

This paper proposes a robust method of capacity requirements planning (CRP) that can generate a stable load plan against dynamic changes in a manufacturing environment. In our study, robustness refers to the degree of stability in the load plan for the occurrence of unexpected events. The purpose of the proposed method is to determine the processing periods of operation orders with the aim of minimizing the probability that the resource requirement of each operation order will exceed the capacity of corresponding resources. Through numerical experiments, we demonstrate the effectiveness of the proposed CRP method in terms of its robustness.

Cite this article as:
D. Morita and H. Suwa, “An Exact Method for Robust Capacity Requirements Planning,” Int. J. Automation Technol., Vol.9, No.3, pp. 216-221, 2015.
Data files:
References
  1. [1]  M. Sugi, M. Cheng, M. Yamamoto, H. Ito, K. Inoue, and J. Ota, “Online Rescheduling in Semiconductor Manufacturing,” International Journal of Automation Technology, Vol.4, No.2, pp.,184–197, 2010.
  2. [2]  J. Y. Chai, T. Sakaguchi, and K. Shirase, “Dynamic Controls of Genetic Algorithm Scheduling in Supply Chain,” International Journal of Automation Technology, Vol.4, No.2, pp.,169–177, 2010.
  3. [3]  R. L. Daniels and P. Kouvelis, “Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-stage Production,” Management Science, Vol.41, No.2, pp.,363–376, 1995.
  4. [4]  A. Kouvelis, R. L. Daniels, and G. Vairaktarakis, “Robust scheduling of a two-machine flow shop with uncertain processing times,” IIE Transactions, Vol.32, pp.,421–432, 2000.
  5. [5]  V. J. Leon, “Measures and robust scheduling for job shops,” IIE Transactions, Vol.26, No.5, pp.,32–43, 1994.
  6. [6]  D. Briskorn, J. Leung, and M. Pinedo, “Robust scheduling on a single machine using time buffers,” IIE Transactions, Vol.43, No.6, pp.,383–398, 2011.
  7. [7]  J. Yang and G. Yu, “On the Robust Single Machine Scheduling Problem,” Journal of Combinatorial Optimization, Vol.6, pp.,17–33, 2002.
  8. [8]  Y. Tanimizu, K. Amano, and K. Harada, “Multi-Objective Production and Transportation Scheduling Considering Carbon Dioxide Emissions Reductions in Dynamic Supply Chains,” International Journal of Automation Technology, Vol.6, No.3, pp.,322–330, 2012.
  9. [9]  D. Morita and H. Suwa, “An Optimization Method for Critical Chain Scheduling Toward Project Greenality,” International Journal of Automation Technology, Vol.6, No.3, pp.,331–337, 2012.
  10. [10]  H. Hibino, T. Sakuma, and M. Yamaguchi, “Evaluation System for Energy Consumption and Productivity in Manufacturing System Simulation,” International Journal of Automation Technology, Vol.6, No.3, pp.,279–288, 2012.
  11. [11]  H. Narita and H. Fujimoto, “Analysis of Environmental Impact due to Machine Tool Operation,” International Journal of Automation Technology, Vol.3, No.1, pp.,49–55, 2009.
  12. [12]  S. Kondoh, N. Mishima, Y. Hotta, K. Watari, T. Kurita and K. Masui, “Total Performance Analysis of Manufacturing Processes,” International Journal of Automation Technology, Vol.3, No.1, pp.,56–62, 2009.
  13. [13]  H. Oden, G. Langenwalter and R. Lucier, “Handbook of Material and Capacity Requirements Planning,” McGraw-Hill, New York, 1993. [Wuttipornpun2007] T. Wuttipornpun and P. Yenradee, “A New Approach for a Finite CapacityMaterial Requirement Planning System,” International Journal of Science and Technology, Vol.12, No.2, pp.,28–51, 2007.
  14. [14]  T. Wuttipornpun and P. Yenradee, “A New Approach for a Finite CapacityMaterial Requirement Planning System,” International Journal of Science and Technology, Vol.12, No.2, pp.,28–51, 2007.
  15. [15]  W. O. Rom, O. I. Tukel, and J. R. Muscatello, “MRP in a job shop environment using a resource constrained project scheduling model,” Omega, Vol.30, pp.,275–286, 2002.
  16. [16]  J. C. Wortman, M. J. Euwe, M. Taal, and V. C. S. Wires, “A review of capacity planning technique within standard software packages,” Production Planning & Control, Vol.7, No.2, pp.,117–128, 1996.
  17. [17]  P. J. Billington, J. O. McClain, and L. J. Thomas, “Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction,” Management Science, Vol.29, No.10, pp.,1126–1141, 1983.
  18. [18]  H. Matsuura and H. Tsubone, “Setting Planned Leadtimes in Capacity Requirements Planning,” The Journal of the Operational Research Society, Vol.44, No.8, pp.,809–816, 1993.
  19. [19]  N. A. J. Hastings, P. Marshall, and R. J. Willis, “Schedule Based M.R.P.: An Integrated Approach to Production Scheduling and Material Requirements Planning,” The Journal of the Operational Research Society, Vol.33, No.11, pp.,1021–1029, 1982.
  20. [20]  H. Suwa and D. Morita, “A study on stability-directed capacity requirements planning (Application to flexible job shops),” Transactions of the JSME, Vol.80, No.814, 2014.

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, IE9,10,11, Opera.

Last updated on Dec. 13, 2018