Using aggregate fill rate for dynamic scheduling of multi-class systems

Date

2011-01-01

Author

Kat, Bora
Avşar, Zeynep Müge

Metadata

Show full item record

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

Item Usage Stats

168
views

0
downloads

For dynamic scheduling of multi-class systems where backorder cost is incurred per unit backordered regardless of the time needed to satisfy backordered demand, the following models are considered: the cost model to minimize the sum of expected average inventory holding and backorder costs and the service model to minimize expected average inventory holding cost under an aggregate fill rate constraint. Use of aggregate fill rate constraint in the service model instead of an individual fill rate constraint for each class is justified by deriving equivalence relations between the considered cost and service models. Based on the numerical investigation that the optimal policy for the cost model is a base-stock policy with switching curves and fixed base-stock levels, an alternative service model is considered over the class of base-stock controlled dynamic scheduling policies to minimize the total inventory (base-stock) investment under an aggregate fill rate constraint. The policy that solves this alternative model is proposed as an approximation of the optimal policy of the original cost and the equivalent service models. Very accurate heuristics are devised to approximate the proposed policy for given base-stock levels. Comparison with base-stock controlled First Come First Served (FCFS) and Longest Queue (LQ) policies and an extension of LQ policy (Delta policy) shows that the proposed policy performs much better to solve the service models under consideration, especially when the traffic intensity is high.

Subject Keywords

Multi-class, Dynamic scheduling, Base-stock, Fill rate, Cost and service models

URI

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

Journal

ANNALS OF OPERATIONS RESEARCH

DOI

https://doi.org/10.1007/s10479-009-0535-2

Collections

Graduate School of Natural and Applied Sciences, Article

Suggestions

OpenMETU
Core

Effective network formulations for lot sizing with backlogging in two-level serial supply chains Solyali, Oguz; Denizel, Meltem; Süral, Haldun (2016-02-01) This study considers the serial lot sizing problem with backlogging in two-level supply chains to determine when and how much to order at a warehouse and ship to a retailer over a T-period planning horizon so that the external known demand occurring at the retailer is satisfied and the total cost at all levels is minimized. In particular, the uncapacitated two-level serial lot sizing problem with backlogging and the two-level serial lot sizing problem with cargo capacity and backlogging are formulated using...
An Effective Matheuristic for the Multivehicle Inventory Routing Problem Solyalı, Oguz; Süral, Haldun (2022-07-01) Copyright: © 2022 INFORMS.This study considers the multivehicle inventory routing problem in which a supplier has to build a distribution plan over a discrete time horizon to replenish a set of customers that faces a given demand. Transportation costs as well as inventory costs at the supplier and at the customers are to be minimized. A matheuristic algorithm is proposed that is based on sequentially solving different mixed integer linear programs. The algorithm merges the advantage of being easy to design ...
A deterministic inventory/production model with general inventory cost rate function and piecewise linear concave production costs Bayındır, Zeynep Pelin; Frenk, J. B. G. (Elsevier BV, 2007-05-16) We present a thorough analysis of the economic production quantity model with shortages under a general inventory cost rate function and piecewise linear concave production costs. Consequently, an effective solution procedure, particularly useful for an approximation scheme, is proposed. A computational study is appended to illustrate the performance of the proposed solution procedure.
An optimal procedure for the coordinated replenishment dynamic lot-sizing problem with quantity discounts Chung, CS; Hum, SH; Kirca, O (2000-12-01) We consider in this paper the coordinated replenishment dynamic lot-sizing problem when quantity discounts are offered. In addition to the coordination required due to the presence of major and minor setup costs, a separate element of coordination made possible by the offer of quantity discounts needs to be considered as well. The mathematical programming formulation for the incremental discount version of the extended problem and a tighter reformulation of the problem based on variable redefinition are pro...
On forward interest rate models : via random fields and Markov jump processes Altay, Sühan; Körezlioğlu, Hayri; Department of Financial Mathematics (2007) The essence of the interest rate modeling by using Heath-Jarrow-Morton framework is to find the drift condition of the instantaneous forward rate dynamics so that the entire term structure is arbitrage free. In this study, instantaneous forward interest rates are modeled using random fields and Markov Jump processes and the drift conditions of the forward rate dynamics are given. Moreover, the methodology presented in this study is extended to certain financial settings and instruments such as multi-country...

Citation Formats

B. Kat and Z. M. Avşar, “Using aggregate fill rate for dynamic scheduling of multi-class systems,” ANNALS OF OPERATIONS RESEARCH, pp. 87–117, 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/29973.