MULTIECHELON VS SINGLE-ECHELON INVENTORY CONTROL POLICIES FOR LOW-DEMAND ITEMS

Date

1994-05-01

Author

HAUSMAN, WH
ERKIP, NK

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

188
views

0
downloads

Multi-echelon inventory systems are often controlled as a network of single-echelon inventory systems for simplicity of managerial authority, organizational control, and performance monitoring. This paper explores the amount of suboptimization in such a situation, using an actual demand data set provided by other researchers. We consider low-demand, high-cost items controlled on an (S - 1, S) basis, with all warehouse stockouts met on an emergency-ordering basis. We demonstrate that the suboptimality penalty for this data set is 3% to 5% when single-echelon systems are appropriately parameterized.

Subject Keywords

Management Science and Operations Research, Strategy and Management

URI

https://hdl.handle.net/11511/64444

Journal

MANAGEMENT SCIENCE

DOI

https://doi.org/10.1287/mnsc.40.5.597

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Capturing knowledge in construction projects: Knowledge platform for contractors Kivrak, Serkan; Arslan, Gokhan; Dikmen Toker, İrem; Birgönül, Mustafa Talat (American Society of Civil Engineers (ASCE), 2008-04-01) Managing knowledge effectively is critical to the survival and advance of a company, especially in project-based industries such as construction. However, capturing knowledge in construction projects is a tedious task, as knowledge is usually experience based, tacit, and hard to pass on to others. In this study, a survey was carried out among eight leading Turkish construction contractors that are operating within the international construction market. The specific objectives of this survey are to find out ...
Single machine scheduling with preventive maintenances Batun, Sakine; Azizoğlu, Meral (Informa UK Limited, 2009-01-01) We consider the single machine total flow time problem in which the jobs are non-resumable and the machine is subject to preventive maintenance activities of known starting times and durations. We propose a branch-and-bound algorithm that employs powerful optimality properties and bounding procedures. Our extensive computational studies show that our algorithm can solve large-sized problem instances with up to 80 jobs in reasonable times. We also study a two-alternative maintenance planning problem with min...
Capacity and tool allocation problem in flexible manufacturing systems Bilgin, S.; Azizoğlu, Meral (Informa UK Limited, 2006-06-01) This study addresses an allocation problem that arises in the semiconductor industry and flexible manufacturing systems where the tools should be loaded on computer numerical controlled (CNC) machines to process a number of operations. The time and tool magazine capacities of the CNC machines and the number of available tools of each type are limited. The objective is to maximize the total weight of operation assignments. We present a mixed integer programming formulation of the problem and show that the pr...
Comparison of Intelligent Classification Techniques by Practicing a Specific Technology Audit Berkol, A.; Kara, G.; Turk, A. (2016-09-08) Technology audit activities arc carried out for assessment of firms' technological requirements, capacity or management capability. The aim of these assessments is to define the weaknesses of firms and develop actions in order to improve firms' technological capacity and/or technology management capability. Generally these activities are implemented with survey questionnaires. These questionnaires can be filled by managers of firms or can be implemented as an interview by independent experts. However, evalu...
Linear programming based approaches for the discrete time/cost trade-off problem in project networks Hafizoglu, A. B.; Azizoğlu, Meral (Informa UK Limited, 2010-04-01) In project management, the activity durations can often be reduced by dedicating additional resources. The Time/Cost Trade-off Problem considers the compromise between the total cost and the project duration. The discrete version of the problem assumes a number of time/cost pairs, called modes, and selects a mode for each activity. In this paper, we consider the Discrete Time/Cost Trade-off Problem. We study the Deadline Problem, that is, the problem of minimizing total cost subject to a deadline on the pro...

Citation Formats

W. HAUSMAN and N. ERKIP, “MULTIECHELON VS SINGLE-ECHELON INVENTORY CONTROL POLICIES FOR LOW-DEMAND ITEMS,” MANAGEMENT SCIENCE, pp. 597–602, 1994, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64444.