Buradasınız

Anasayfa » Content

PRODUCTION PLANNING FOR A WINERY WITH MIXED INTEGER PROGRAMMING MODEL

Journal Name:

  • Ege Akademik Bakış Dergisi

Publication Year:

  • 2009

Key Words:

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
This paper presents a Mixed Integer Programming (MIP) model to wine production planning. In a MIP problem, some of the decision variables are constrained to have only integer values at the optimal solution. The use of integer variables greatly expands the scope of useful optimization problems. The purpose of this paper is to propose a concise formulation of the production planning problem oriented at the food industry and in particular to wine production. The main idea is the selection of new products to be produced and the determination of the quantity of them in order to maximize profit of a winery. This is a fixed-charge problem and in this paper branch and bound method is used to solve the problem. The results obtained from a MIP model indicate that the selection of new products can favorably produce optimal schedules.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon arastirmax-production-planning-winery-mixed-integer-programming-model.pdf
  • 2
375-387
  • English

REFERENCES

References: 

ACHTERBERG, T. (2004): “Conflict Analysis in Mixed Integer Programming”, Discrete Optimization, 4: 4–20.
ARCURI, P., FLORIO, G. and FRAGIACOMO, P.(2007): “A Mixed Integer Programming Model for Optimal Design of Trigeneration in a Hospital Complex”, Energy, 32: 1430–1447.
ASHFORD, R.W. and DANIEL, R.C. (1992): “Some Lessons in Solving Practical Integer Programs”, Journal of the Operational Research Society, 43: 425–433.
ATAMTÜRK, A. and SAVELSBERGH, M.W.P. (2005): “Integer-Programming Software Systems”, Annals of Operations Research, 140: 67–124.
BELLABDAOUI, A. and TEGHEM, J. (2006): “A Mixed-Integer Linear Programming Model for the Continuous Casting Planning”, Int. J. Production Economics, 104: 260–270.
BİLGEN, B. and OZKARAHAN, I. (2007): “ A Mixed-Integer Linear Programming Model for Bulk Grain Blending and Shipping”, Int. J. Production Economics, 107: 555–571. 385
CARVALHO, M.C.A and PINTO, J.M. (2006): “An MILP Model and Solution Technique for the Planning of Infrastructure in Offshore Oilfields”, Journal of Petroleum Science and Engineering, 51: 97-110.
CONSTANTINO, M. (2000): “A Polyhedral Approach to a Production Planning Problem”, Annals of Operations Research 96: 75–95.
DOGANIS, P. and SARIMVEIS, H. (2007): “Optimal Scheduling in a Yogurt Production Line Based on Mixed Integer Linear Programming”, Journal of Food Engineering, 80: 445–453.
EISELT, H.A. and SANDBLOM, C.L. (2000): “Integer Programming and Network Models”, Springer-Verlag, Berlin, Heidelberg.
ERTUĞRUL, İ. and TUŞ, A. (2007): “Interactive Fuzzy Linear Programming and an Application Sample at a Textile Firm”, Fuzzy Optim Decis Making, 6: 29-49.
ERTUĞRUL, İ. and GÜNEŞ, M. (2007): “Fuzzy Multi-Criteria Decision Making Method for Machine Selection”, Analysis and Design of Intelligent Systems Using Soft Computing Techniques, Advences in Soft Computing, 41, Springer.
ERTUĞRUL, İ. and KARAKAŞOĞLU, N. (2007): “Fuzzy TOPSIS Method for Academic Member Selection in Engineering Faculty”, Innovations in E-learning, Instruction Technology, Assessment and Engineering Education, Iskander, Magued (Ed.), XVI, Springer, Netherlands, pp. 151-156.
FORREST, J.J.H. and TOMLIN, J. A. (2007): “Branch and Bound, Integer, and Non-integer Programming”, Annals of Operations Research, 149: 81–87.
GARFINKEL, R.S. and NEMHAUSER, G.L. (1972): “Integer Programming”, John Wiley & Sons, Inc, New York.
HILLIER, F.S. and LIEBERMAN, G.J. (1990): “Introduction to Operations Research”, Fifth Edition, McGraw Hill, New York.
HIRSCH, W.M. and DANTZIG, G.B. (1968): “The Fixed Charge Problem”, Naval Res.Logistics, 15: 413–424.
HUNG, Y.F., CHEN, C.P., SHIH, C.C. and HUNG, M.H. (2003): “Using Tabu Search with Ranking Candidate List to Solve Production Planning Problems with Setups”, Computer&Industrial Engineering, 45: 615-634.
MAGATA˜O, L., ARRUDA, L.V.R and NEVES, F. A. (2004): “Mixed Integer Programming Approach for Scheduling Commodities in a Pipeline”, Computers and Chemical Engineering, 28: 171-185. 386
MAVROTAS, G. and DIAKOULAKI, D. (2005): “Multi-criteria Branch and bound: A Vector Maximization Algorithm for Mixed 0-1 Multiple Objective Linear Programming”, Applied Mathematics and Computation, 171: 53-71.
NEMHAUSER, G. and WOLSEY, L. (1999): “Integer and Combinatorial Optimization”, John Wiley & Sons, Inc, New York.
RENDER, B. and STAIR, R.M. (1991): “Quantitative Analysis for Management”, Fourth Edition, Allyn and Bacon, Inc, Boston.
SMITH, V. L. and PICKARD, N. B. (1993): “An Integer Programming Solution to a Capacity Planning Problem in an Armaments Factory”, Journal of the Operational Research Society, 44: 973–981. doi:10.1057/jors.1993.166.
TAHA, H.A. (1997): “Operations Research an Introduction”, Prentice Hall Inc, USA.
WINSTON, W.L. (1994): “Operations Research: Applications and Algorithms”, Third Edition, Duxbury Pres, California.
YANG, L. and LIU, L. (2007): “Fuzzy Fixed Charge Solid Transportation Problem and Algorithm”, Applied Soft Computing, 7: 879–889.

Thank you for copying data from http://www.arastirmax.com