Change search
Refine search result
1 - 8 of 8
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Abdul-Jalbar, Beatriz
    et al.
    Universidad de La Laguna.
    Segerstedt, Anders
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Business Administration and Industrial Engineering.
    Sicilia, Joaquín
    Universidad de La Laguna.
    Nilsson, Andreas
    A new heuristic to solve the one-warehouse N-retailer problem2010In: Computers & Operations Research, ISSN 0305-0548, E-ISSN 1873-765X, Vol. 37, no 2, p. 265-272Article in journal (Refereed)
    Abstract [en]

    We deal with a multi-echelon inventory system in which one warehouse supplies an item to multiple retailers. Customer demand arrives at each retailer at a constant rate. The retailers replenish their inventories from the warehouse that in turn orders from an outside supplier. It is assumed that shortages are not allowed and lead times are negligible. The goal is to determine replenishment policies that minimize the overall cost in the system. We develop a heuristic to compute efficient policies, which also can easily be used in a spreadsheet application. The main idea consists of finding a balance between the replenishment and the inventory holding costs at each installation. This new heuristic we compare with two other approaches proposed in the literature; the computational studies show that in most of the instances generated the new method provides lower costs.

  • 2.
    Nilsson, Andreas
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences.
    Essays on joint replenishment and multi-echelon inventory systems2006Licentiate thesis, comprehensive summary (Other academic)
    Abstract [en]

    This Licentiate thesis addresses the topics of Joint Replenishment and Multi-Echelon Inventory Systems. Both are important parts in the concepts and current trends in Supply Chain Management and Logistics. The objective of Supply Chain Management is to manage the flow of information and goods from the supplier to the final customer with respect to high customer value and low costs. A common inventory and coordination problem is the so called Joint Replenishment Problem. The problem often occurs when several items are replenished at a single stocking point. This can happen in many different situations, e.g. when several items are procured from the same supplier or when a product after manufacturing, is packaged in different quantities. Cost savings can be obtained by coordinating the replenishments, compared to when items are replenished independently. Coordination of several levels in a supply chain, often referred to as multi-echelon inventory control, is another important part of Supply Chain Management. A frequently encountered problem in practice is the One-warehouse N-retailer problem, which can found in divergent distribution systems where a central warehouse supplies several retailers with goods. The thesis contains an introductory part and three research papers. The first two papers deal with the Joint Replenishment Problem and the second with the One-warehouse N-retailer problem. Paper I provides a novel heuristic method to solve joint replenishment problems using a spread-sheet technique. The principle of the recursion procedure is to find a balance between the replenishment and inventory holding costs for the different items by adjusting the replenishment frequencies. Paper II is an extension of the area and presents a new method that may help reduce peak inventory levels and arrival quantities in joint replenishment problems. The replenishments are re-scheduled during the cycle periods and if necessary individual replenishments are delayed single time periods. Paper III deals with the problem of prioritizing retailers when there is a shortage of supply at a warehouse. All customers are often not equally important and a warehouse that suffers from stock-outs may therefore want to give higher priority to some retailers when new goods are ready for delivery. The paper presents an approximation of the inventory holding and shortage cost when retailers are prioritized according to two groups, high and low priority retailers.

  • 3.
    Nilsson, Andreas
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences.
    Prioritizing retailers in a two-echelon inventory system2005In: Special issue for the 17th triennial conference of IFORS, Hawaii, July, 2005: the 17th triennial conference of the International Federation of Operational Research Societies, held in Honolulu, Hawaii from 11 to 15 July 2005 / [ed] Janny Leung, Oxford: Blackwell Munksgaard, 2005Conference paper (Other academic)
    Abstract [en]

    In this paper we deal with the problem of prioritizing retailers in a two-echelon inventory system when there is a shortage of supply at the warehouse. We evaluate the performance of both the warehouse and retailers, which face Poisson demand and use a one-for-one replenishment policy.

  • 4.
    Nilsson, Andreas
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences.
    Reducing peak inventory levels and arrival quantities in the joint replenishment problem2006In: Proceedings, Igls 2006, 2006, Vol. 4, p. 125-136Conference paper (Refereed)
  • 5.
    Nilsson, Andreas
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences.
    The Joint Replenishment Problem with a procurement restriction2006In: OR News : das Magazin der GOR, ISSN 1437-2045, Vol. 27Article in journal (Other academic)
  • 6. Nilsson, Andreas
    et al.
    Segerstedt, Anders
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Business Administration and Industrial Engineering.
    Sluis, Erik van der
    University of Amsterdam.
    A new heuristics to solve the Joint Replenishment Problem using a spread-sheet technique2004Conference paper (Refereed)
    Abstract [en]

    In this paper, a heuristic method is presented which gives a novel approach to solve joint replenishment problems (JRP) with strict cycle policies. The heuristic solves the JRP in an iterative procedure and is based on a spreadsheet technique. The principle of the recursion procedure is to find a balance between the replenishment and inventory holding costs for the different items by adjusting the replenishment frequencies. The heuristic is also tested according to an extensive test template and shows pleasing results. It also performs well in comparison with many other heuristics.

  • 7. Nilsson, Andreas
    et al.
    Segerstedt, Anders
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Business Administration and Industrial Engineering.
    Sluis, Erik van der
    University of Amsterdam.
    A new iterative heuristic to solve the joint replenishment problem using a spread-sheet technique2007In: International Journal of Production Economics, ISSN 0925-5273, E-ISSN 1873-7579, Vol. 108, no 1-2, p. 399-405Article in journal (Refereed)
    Abstract [en]

    In this paper, a heuristic method is presented which gives a novel approach to solve joint replenishment problems (JRP) with strict cycle policies. The heuristic solves the JRP in an iterative procedure and is based on a spreadsheet technique. The principle of the recursion procedure is to find a balance between the replenishment and inventory holding costs for the different items by adjusting the replenishment frequencies. The heuristic is also tested according to an extensive test template and shows pleasing results. It also performs well in comparison with many other heuristics.

  • 8.
    Nilsson, Andreas
    et al.
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Business Administration and Industrial Engineering.
    Silver, Edward A.
    University of Calgary.
    A simple improvement on Silver's heuristic for the joint replenishment problem2008In: Journal of the Operational Research Society, ISSN 0160-5682, E-ISSN 1476-9360, Vol. 59, no 10, p. 1415-1421Article in journal (Refereed)
    Abstract [en]

    In this paper, we revisit the well-known joint replenishment problem. There is a family of items with a major fixed cost associated with any replenishment of the family and a minor, (item-dependent) setup cost for each item that is included in the replenishment. In contrast with optimization methods and sophisticated (iterative) heuristics that have been presented in the literature, we present a simple (including ease of understanding) improvement routine to be used in conjunction with the original, simple approach advocated by one of the authors 30 years ago. Tests on 48,000 examples reveal that the improvement routine does, indeed, substantially improve performance and with relatively little extra computational effort. Thus, it should be of particular interest to practitioners and for teaching materials.

1 - 8 of 8
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf