Advertisement

Intelligent Non-split Mixing Decisions: A Value-Engineering Tool Applied to Flour Mills

  • Jürg P. KellerEmail author
  • Mukul Agarwal
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 325)

Abstract

Many manufacturing processes involve using a multitude of intermediate products to make a few final products. The decision regarding which intermediate products go to make which final product involves engineering the value of the final products with respect to several properties and the amounts. Even when each property “mixes linearly,” this decision is complex in cases where no mathematical function is known for the relationship between the value of a product and its properties. The complexity of a tool to support this decision making is further aggravated in cases where an intermediate product cannot contribute to more than one final product, e.g. due to mechanical limitations, process constraints, logistics restrictions, or traceability considerations. For this situation, an interactive decision-support tool is developed, and applied to the sensitive example of flour mills, where up to 80 intermediate products, 6 final products, and 6 properties are involved during continuous mixing of flours. The tool allows the head miller to flexibly specify the feasible space in the dimensions of decision variables, properties, and amounts. For any change in this specification, the tool computes and presents without prohibitive time lag a convenient overview of all relevant non-inferior solutions, to facilitate selection of a particular solution. The head miller makes specifications and selects a solution for one final product at a time, usually starting with the most valuable product, but can iterate back to any product at will. Better and more reliable mixing decisions are achieved with the support of the tool.

Keywords

Decision support systems Intelligent manufacturing Discrete-event systems Systems modelling and simulation Logistics engineering Cost and value engineering Production planning Quality control and management Performance evaluation and optimization Human-system interface 

References

  1. 1.
    Borghetti, A., Paolone, M., Nucci, C.A.: A Mixed Integer Linear Programming Approach to the Optimal Configuration of Electrical Distribution Networks with Embedded Generators, 17th Power Systems Computation Conference. Stockholm, Sweden (2011)Google Scholar
  2. 2.
    Chen, D.-S., Batson, R.G., Dang, Y.: Applied Integer Programming: Modeling and Simulation. Wiley, New York (2010)Google Scholar
  3. 3.
    Guan, X., Zhai, Q., Papalexopoulos, A.: Optimization based methods for unit commitment: lagrangian relaxation versus general mixed integer programming. IEEE Power Eng. Soc. Gen. Meet. 2(4), 2666 (2003)Google Scholar
  4. 4.
    Hansen, P., Jaumard, B., Savard, G.: New branch-and-bound rules for linear bilevel programming. SIAM J. Sci. Stat. Comput. 13(5), 1194–1217 (1992)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Keller, J.P., Agarwal, M.: Fast, Flexible, Interactive Decision-Support Tool: An Industrial Application, 8th International Symposium on Intelligent and Manufacturing Systems. Adrasan, Turkey (2012)Google Scholar
  6. 6.
    Lawler, E.L., Wood, D.E.: Branch-and-bound methods: a survey. Oper. Res. 14(4), 699–719 (1966)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Lee, M.L., Kim, J.-G., Kim, Y.-D.: Linear programming and lagrangian relaxation heuristics for designing a material flow network on a block layout. Int. J. Prod. Res. 47(18), 5185–5202 (2009)CrossRefzbMATHGoogle Scholar
  8. 8.
    Leyffer, S.: Integrating SQP and branch-and-bound for mixed integer nonlinear programming. Comput. Optim. Appl. 18, 295–309 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Vielma, J.P., Ahmed, S., Nemhauser, G.L.: A lifted linear programming branch-and-bound algorithm for mixed integer conic quadratic programs. INFORMS J. Comput. 20, 438–450 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Wolsey, L.A.: Heuristic analysis, linear programming and branch and bound. Math. Prog. Stud. 13, 121–134 (1980)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Institute for AutomationUniversity of Applied Sciences and Arts Northwestern SwitzerlandWindischSwitzerland
  2. 2.Corporate TechnologyBühler AGUzwilSwitzerland

Personalised recommendations