Browse > Article

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

Lee, Young-Ho (고려대학교 산업시스템정보공학과)
Kim, Seong-In (고려대학교 산업시스템정보공학과)
Shim, Bo-Kyung (고려대학교 정보경영학부)
Han, Jung-Hee (강원대학교 경영학과)
Publication Information
Korean Management Science Review / v.24, no.1, 2007 , pp. 35-43 More about this Journal
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
Product-mix Problem; Scheduling; Integer Programming; Heuristic;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Blazewicz, J. and M. Y. Kovalyov, 'The Complexity of Two Group Scheduling Problems,' Journal of Scheduling, Vol. 5(2002), pp.477-485   DOI   ScienceOn
2 Candler, W., 'Coal Blending with Acceptance Sampling,' Computers and Operations research, Vol.18(1991), pp.591-596   DOI   ScienceOn
3 Candler, W., 'An Integrating Model for the Acquisition and Use of Metallurgical Coals in Steel Works,' Ph.D Thesis, 1995, Lancaster Univesity, Brazil
4 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   DOI   ScienceOn
5 McColl, W.H.S., 'Management and Operations in an Oil Company,' Operations Research Quarterly, Vol.20(1969), pp.64-65
6 Belvaux, G. and L.A. Wolsey, 'Modelling Practical Lot-Sizing Problems as Mixed- Integer Programs,' Management Science, No.47(2001), pp.993-1007
7 Stigler, G., 'The Cost of Subsistence,' Journal of Farm Economics, Vol.27(1945), pp.303-314   DOI   ScienceOn
8 Arthur, J.L. and K.D. Lawrence, 'A Multiple Goal Blending Problem,' Computers and Operations Research, Vol.7(1980), pp.215-224   DOI   ScienceOn
9 Cheng, T.C.E. and Z.L. Chen, 'Parallel Machine Scheduling with Batch Setup Times,' Operations Research, Vol.42(1994), pp.1171-1174   DOI   ScienceOn
10 Garver, L.L., 'Power Scheduling by Integer Programming,' IEEE Transactions on Power Apparatus and Systems, Vol. 81(1963), pp.730-735
11 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   DOI
12 Glismann, K. and G. Gruhn, 'Short-term Scheduling and Recipe Optimization of Blending Processes,' Computer and Chemical Engineering, Vol.25(2001), pp.627-634   DOI   ScienceOn
13 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   DOI
14 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   DOI   ScienceOn
15 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   DOI   ScienceOn
16 Suerie, C. and H. Stadtler, 'The Capacitated Lot-Sizing Problem with Linked Lot Sizes,' Management Science, Vol.49(2003), pp.1039-1054   DOI   ScienceOn