Digitala Vetenskapliga Arkivet

Driftstörningar
Det förekommer återkommande driftstörningar på några av sök-portalerna på grund av hög belastning. Vi arbetar på att lösa problemet, ni kan tillfälligt mötas av ett felmeddelande.
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
En studie om hur heltalsprogrammering kan optimera ledtidskategoriseringar
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för matematik och matematisk statistik.
2026 (Svenska)Självständigt arbete på avancerad nivå (yrkesexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
Abstract [en]

Hägglunds, part of the Bosch Rexroth group, manufactures hydraulic motors used in industries such as renewable energy, construction and infrastructure, pulp and paper, logistics, and transportation. A few years ago, the company implemented a system in which their motors were categorized based on the time from customer order to final delivery. Three categories were created: category 10, 20, and 30 with corresponding lead times of 6, 10, and 16 weeks. This categorization reflects both inventory management and production strategy. The company wants to achieve greater precision regarding which motors belong to each lead time category. The company also wants to achieve better control over different motors and their respective lead times. This thesis aims to optimize this categorization in order, if possible, to allow motors that are frequently sold to be offered with short lead times to customers. An integer programming model was constructed with the logical expression that the motor must be complete in order for the components belonging to the motor to be selected. The condition is non-linear, which led to the implementation of a pseudo-Boolean transformation.

Two different optimizations were carried out. One minimizes the number of components used to manufacture the motors selected for inventory holding, and the other optimization minimizes the inventory value required to provide the correct lead times for the motors. The optimization based on inventory value generated many selected components, while the optimization based on minimizing components resulted in a high inventory value. A combination of the two optimizations was carried out where the number of different components was minimized under the condition that the inventory value may not increase by more than 20\% above the inventory value obtained from minimizing inventory value. The results show that an optimization model is possible to implement for problems containing logical expressions. A solution with minimized inventory value results in a large number of motors and components. A solution with a minimized number of components results in a high inventory value. Minimizing the number of components under the condition that the inventory value may not be more than 20\% higher than the minimum inventory value balances the relationship between capital binding and inventory size. The work shows that a binary integer programming model is a possible solution for inventory management problems with this level of complexity.

Ort, förlag, år, upplaga, sidor
2026. , s. 37
Nationell ämneskategori
Matematik
Identifikatorer
URN: urn:nbn:se:umu:diva-257673OAI: oai:DiVA.org:umu-257673DiVA, id: diva2:2092834
Externt samarbete
Hägglunds, Bosch Rexroth
Utbildningsprogram
Civilingenjörsprogrammet i industriell ekonomi
Handledare
Examinatorer
Tillgänglig från: 2026-08-17 Skapad: 2026-08-17 Senast uppdaterad: 2026-08-17Bibliografiskt granskad

Open Access i DiVA

fulltext(1526 kB)21 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 1526 kBChecksumma SHA-512
3d595e4392cde9ef747aa9c42815d6fccbd1be837a27571316f2ea532243e521ec8f59761103bb0e7aa759de78c99e688b5062185fb99c2b2d45b13be3829860
Typ fulltextMimetyp application/pdf

Av organisationen
Institutionen för matematik och matematisk statistik
Matematik

Sök vidare utanför DiVA

GoogleGoogle Scholar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 1332 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf