A model for performance evaluation and stock optimization in a kit management problem

Köksalan, Mustafa Murat
In this paper we consider a kit planning problem where demand occurrences are not for individual items, but for kits (a group of items). Each kit contains an arbitrary number of items. Kit demands occur according to a Poisson process. Whenever a kit demand occurs, only one item from the kit is used and the rest is returned as unused. The item that will be used from the kit is not known in advance and the whole kit has to stay at the demand site for the whole duration. The used item is replenished through a stochastic supply system, with possible capacity limitation. This model has applications in health care (planning surgical implant inventories), and repair kit management systems. As a demand for a kit triggers simultaneous demands for the items within the kit, the individual demand arrival processes for the items in that kit are correlated. Therefore, finding the joint probability distribution of the number of items that are outstanding, and hence finding the probability of kit availability, is generally difficult. We can obtain these terms in a fairly explicit form under the assumption that an item which is not in stock when a kit demand occurs can be obtained through borrowing from an emergency supply channel. As soon as a unit of such an item becomes available, it is returned back to its original supply source. We also formulate an optimization problem where the expected holding cost of items is minimized, and pre-specified kit availability constraints are satisfied. Since the optimization problem is hard to solve, we provide a heuristic procedure for obtaining the stock levels, and test the quality of the heuristic.


A linear programming approach to quaity improvement project and product mix selection under inspection error and rework
Şarbak, Nedret; Köksal, Gülser; Department of Industrial Engineering (2006)
In this study, the effect of inspection error on the product mix and quality projects selection in a manufacturing environment where rework and inspection errors exist is examined. It is assumed that the products (items) for which rework is necessary are reprocessed at a separate work center and 100% inspection is performed for the products both after rework and processing operations. Markov chain approach is used to compute yield and rework rates. In addition, nominal-the-best type of a quality loss functi...
A hybrid Benders approach for coordinated capacitated lot-sizing of multiple product families with set-up times
Bayley, Tiffany; Süral, Haldun; Bookbinder, James H. (Informa UK Limited, 2018-01-01)
We examine a coordinated capacitated lot-sizing problem for multiple product families, where demand is deterministic and time-varying. The problem considers set-up and holding costs, where capacity constraints limit the number of individual item and family set-up times and the amount of production in each period. Using a strong reformulation and relaxing the demand constraints, we improve both the upper and lower bounds using a combination of Benders decomposition and an evolutionary algorithm, followed by ...
A modified heuristic procedure for materials management in project networks
Erbasi, A; Sepil, C (1999-06-01)
A heuristic procedure for determining the tradeoff between expediting the ordering of materials and delaying the project is presented. The heuristic procedure is a modification of the procedure taken from the literature. With the use of an illustrative example, it has been shown that the modified procedure provides schedules with lower total cost values. Experimental results performed on randomly generated problems reveal that the modification can bring a decrease in total cost values as much as 52%.
A branch and bound method for the line balancing problem in U-shaped assembly lines with equipment requirements
Ogan, Dilek; Azizoğlu, Meral (2015-07-01)
In this study we consider a U-shaped assembly line balancing problem where each task uses a specified set of equipments and each type of equipment has a specified cost. Our problem is to assign the tasks together with their equipments to the workstations so as to minimize the total equipment cost. We formulate the problem as a mixed integer linear programming model that is capable of solving small sized instances. We propose a branch and bound algorithm that uses efficient precedence relations and lower bou...
A heuristic approach for profit oriented disassembly lot-sizing problem
Kaya, Melike; Bayındır, Zeynep Pelin; Çetinkaya, Ferda Can; Department of Industrial Engineering (2011)
In this thesis, we work on adisassembly lot-sizing problem for multiple products with parts commonality,i.e., general product structure. We assume that supply of discarded products is infinite. When a product (or a subassembly) is disassembled, all its immediate child items are obtained,i.e., complete disassembly case.Intermediate and leaf items obtained are demandedbyexternal suppliers or remanufacturers. The maximum possible salesfor each intermediate and leaf item are known.Sales of the intermediate and ...
Citation Formats
A. R. GÜLLÜ and M. M. Köksalan, “A model for performance evaluation and stock optimization in a kit management problem,” INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, pp. 527–535, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57194.