Korean Management Science Review (경영과학)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

An Integer Programming Model and Heuristic Algorithm to Minimize Setups in Product Mix

원료의 선택 및 혼합비율의 변경 횟수를 최소화하기 위한 정수계획법 모형 및 근사해 발견 기법

  • 이영호 (고려대학교 산업시스템정보공학과) ;
  • 김성인 (고려대학교 산업시스템정보공학과) ;
  • 심보경 (고려대학교 정보경영학부) ;
  • 한정희 (강원대학교 경영학과)
  • Published : 2007.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

Minimizing the total number of setup changes of a machine increases the throughput and improves the stability of a production process, and as a result enhances the product qualify. In this context, we consider a new product-mix problem that minimizes the total number of setup changes while producing the required quantities of a product over a given planning horizon. For this problem, we develop a mixed integer programming model. Also, we develop an efficient heuristic algorithm to find a feasible solution of good quality within reasonable time bounds. Computational results show that the developed heuristic algorithm finds a feasible solution as good as the optimal solution in most test problems.

Keywords

References

  1. Arthur, J.L. and K.D. Lawrence, 'A Multiple Goal Blending Problem,' Computers and Operations Research, Vol.7(1980), pp.215-224 https://doi.org/10.1016/0305-0548(80)90007-6
  2. Belvaux, G. and L.A. Wolsey, 'Modelling Practical Lot-Sizing Problems as Mixed- Integer Programs,' Management Science, No.47(2001), pp.993-1007
  3. Blazewicz, J. and M. Y. Kovalyov, 'The Complexity of Two Group Scheduling Problems,' Journal of Scheduling, Vol. 5(2002), pp.477-485 https://doi.org/10.1002/jos.118
  4. Candler, W., 'Coal Blending with Acceptance Sampling,' Computers and Operations research, Vol.18(1991), pp.591-596 https://doi.org/10.1016/0305-0548(91)90066-Z
  5. Candler, W., 'An Integrating Model for the Acquisition and Use of Metallurgical Coals in Steel Works,' Ph.D Thesis, 1995, Lancaster Univesity, Brazil
  6. Cheng, T.C.E. and Z.L. Chen, 'Parallel Machine Scheduling with Batch Setup Times,' Operations Research, Vol.42(1994), pp.1171-1174 https://doi.org/10.1287/opre.42.6.1171
  7. Dorsey, R.C., T.J. Hodgson, and H.D. Ratliff, 'A Production-Scheduling Problem with Batch Processing,' Operations Research, Vol.22(1974), pp.1271-1279 https://doi.org/10.1287/opre.22.6.1271
  8. Garver, L.L., 'Power Scheduling by Integer Programming,' IEEE Transactions on Power Apparatus and Systems, Vol. 81(1963), pp.730-735
  9. Gopalakrishnan, M., 'A Modified Framework for Modeling Set-up Carryover in the Capacitated Lotsizing Problem,' International Journal of Production Research, Vol.38(2000), pp.3421-3424 https://doi.org/10.1080/002075400418324
  10. Glismann, K. and G. Gruhn, 'Short-term Scheduling and Recipe Optimization of Blending Processes,' Computer and Chemical Engineering, Vol.25(2001), pp.627-634 https://doi.org/10.1016/S0098-1354(01)00643-3
  11. Gupta, D. and T. Magnusson, 'The Capacitated Lot-sizing and Scheduling Problem with Sequence-dependent Setup Costs and Setup Times,' Computers and Operations Research, Vol.32(2005), pp.727-747 https://doi.org/10.1016/j.cor.2003.08.014
  12. McColl, W.H.S., 'Management and Operations in an Oil Company,' Operations Research Quarterly, Vol.20(1969), pp.64-65
  13. Orcun, S., I. K. Altinel, and O. Hortacsu, 'General Continuous Time Models for Production Planning and Scheduling of Batch Processing Plants : Mixed Integer Linear Program Formulations and Computational Issues,' Computer and Chemical Engineering, Vol.25(2001), pp.371-389 https://doi.org/10.1016/S0098-1354(00)00663-3
  14. Stigler, G., 'The Cost of Subsistence,' Journal of Farm Economics, Vol.27(1945), pp.303-314 https://doi.org/10.2307/1231810
  15. Suerie, C. and H. Stadtler, 'The Capacitated Lot-Sizing Problem with Linked Lot Sizes,' Management Science, Vol.49(2003), pp.1039-1054 https://doi.org/10.1287/mnsc.49.8.1039.16406
  16. Sutton, D.W. and P.A. Coates, 'On-Line Mixture Calculation System for Stainless Steel Production by BSC Stainless : the Least Through Cost Mix System,' Journal of the Operational Research Society, Vol. 32(1981), pp.165-169 https://doi.org/10.1057/jors.1981.39