Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Frequently Asked Questions
Frequently Asked Questions
Communities & Collections
Communities & Collections
Optimal lot-sizing/vehicle-dispatching policies under stochastic lead times and stepwise fixed costs
Date
2003-01-01
Author
Alp, O
Erkip, NK
Gullu, R
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
5
views
0
downloads
We characterize optimal policies of a dynamic lot-sizing/vehicle-dispatching problem under dynamic deterministic demands and stochastic lead times. An essential feature of the problem is the structure of the ordering cost, where a fixed cost is incurred every time a batch is initiated (or a vehicle is hired) regardless of the portion of the batch (or vehicle) utilized. Moreover, for every unit of demand not satisfied on time, holding and backorder costs are incurred. Under mild assumptions we show that the demand of a period is satisfied from at most three distinct production (dispatching) epochs. We devise a dynamic programming algorithm to compute the production/dispatching quantities and times.
Subject Keywords
Management Science and Operations Research
,
Computer Science Applications
URI
https://hdl.handle.net/11511/66870
Journal
OPERATIONS RESEARCH
DOI
https://doi.org/10.1287/opre.51.1.160.12799
Collections
Department of Industrial Engineering, Article